An overview of population-based algorithms for multi-objective optimisation

Author: Giagkiozis Ioannis   Purshouse Robin C.   Fleming Peter J.  

Publisher: Taylor & Francis Ltd

E-ISSN: 1464-5319|46|9|1572-1599

ISSN: 1464-5319

Source: International Journal of Systems Science, Vol.46, Iss.9, 2015-07, pp. : 1572-1599

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

In this work we present an overview of the most prominent population-based algorithms and the methodologies used to extend them to multiple objective problems. Although not exact in the mathematical sense, it has long been recognised that population-based multi-objective optimisation techniques for real-world applications are immensely valuable and versatile. These techniques are usually employed when exact optimisation methods are not easily applicable or simply when, due to sheer complexity, such techniques could potentially be very costly. Another advantage is that since a population of decision vectors is considered in each generation these algorithms are implicitly parallelisable and can generate an approximation of the entire Pareto front at each iteration. A critique of their capabilities is also provided.

Related content