An Adaptive Evolutionary Algorithm based on Non-Euclidean Geometry for Many-objective Optimization


Annibale Panichella


GECCO 2019


In the last decade, several evolutionary algorithms have been proposed in the literature for solving multi- and many-objective optimization problems. The performance of such algorithms depends on their capability to produce a well-diversified front (diversity) that is as closer to the Pareto optimal front as possible (proximity). Diversity and proximity strongly depend on the geometry of the Pareto front, i.e., whether it forms a Euclidean, spherical or hyperbolic hypersurface. However, existing multi- and many-objective evolutionary algorithms show poor versatility on different geometries. To address this issue, we propose a novel evolutionary algorithm that: (1) estimates the geometry of the generated front using a fast procedure with O(MxN) computational complexity (M is the number of objectives and N is the population size); (2) adapts the diversity and proximity metrics accordingly. Therefore, to form the population for the next generation, solutions are selected based on their contribution to the diversity and proximity of the non-dominated front with regards to the estimated geometry. Computational experiments show that the proposed algorithm outperforms state-of-the-art multi and many-objective evolutionary algorithms on benchmark test problems with different geometries and number of objectives (M=3,5, and 10).

Getting started

The source code of AGE-MOEA can be downloaded: here

AGE-MOEA is implemented as a module (algorithm) to include in the platform PlatEMO. Download the zip file (see link above) and extract its content in the folder Algorithms of PlatEMO.

Annibale Panichella
Annibale Panichella
Associate Professor

Associate Professor in Software Engineering