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 manyobjective 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(M × N) 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).
Original languageEnglish
Title of host publicationGECCO '19
Subtitle of host publicationProceedings of The Genetic and Evolutionary Computation Conference
Place of PublicationNew york
PublisherAssociation for Computing Machinery (ACM)
Number of pages9
ISBN (Print)978-1-4503-6111-8
Publication statusPublished - 2019
EventGECCO '19 Proceedings of the Genetic and Evolutionary Computation Conference - Prague, Czech Republic
Duration: 13 Jul 201917 Jul 2019


ConferenceGECCO '19 Proceedings of the Genetic and Evolutionary Computation Conference
Abbreviated titleGECCO '19
CountryCzech Republic

    Research areas

  • Many-objective optimization, Genetic algorithm (GA), Evolutionary algorithms, Non-Euclidean Geometry, Norms

ID: 54130698