Abstract
The unbounded population multi-objective covariance matrix adaptation evolution strategy∼(UP-MO-CMA-ES) aims at maximizing the total hypervolume covered by all evaluated points. It adds all non-dominated solutions found to its population and employs Gaussian mutations with adaptive covariance matrices to also solve ill-conditioned problems. A novel recombination operator adapts the covariance matrices to point along the Pareto front. The UP-MO-CMA-ES is combined with a parallel exploration strategy and empirically evaluated on the bi-objective BBOB-biobj benchmark problems. Results show that the algorithm can reliably solve ill-conditioned problems as well as weakly-structured problems. However, it is less suited for the rugged multi-modal objective functions in the benchmark.
Original language | English |
---|---|
Title of host publication | Proceedings of the 2016 Genetic and Evolutionary Computation Conference Companion |
Number of pages | 8 |
Publisher | Association for Computing Machinery |
Publication date | 20 Jul 2016 |
Pages | 1177-1184 |
ISBN (Print) | 978-1-4503-4323-7 |
DOIs | |
Publication status | Published - 20 Jul 2016 |
Event | Genetic and Evolutionary Computation Conference - Denver, United States Duration: 20 Jul 2016 → 24 Jul 2016 |
Conference
Conference | Genetic and Evolutionary Computation Conference |
---|---|
Country/Territory | United States |
City | Denver |
Period | 20/07/2016 → 24/07/2016 |