Incrementally maximising hypervolume for selection in multi-objective evolutionary algorithms
- 1 September 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1089778X,p. 3203-3210
- https://doi.org/10.1109/cec.2007.4424881
Abstract
Several multi-objective evolutionary algorithms compare the hypervolumes of different sets of points during their operation, usually for selection or archiving purposes. The basic requirement is to choose a subset of a front such that the hypervolume of that subset is maximised. We describe and evaluate three new algorithms based on incremental calculations of hypervolume using the new incremental hypervolume by slicing objectives (IHSO) algorithm: two greedy algorithms that respectively add or remove one point at a time from a front, and a local search that assesses entire subsets. Empirical evidence shows that using IHSO, the greedy algorithms are generally able to out-perform the local search and perform substantially better than previously published algorithms.Keywords
This publication has 6 references indexed in Scilit:
- Maximising Hypervolume for Selection in Multi-objective Evolutionary AlgorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- A faster algorithm for calculating hypervolumeIEEE Transactions on Evolutionary Computation, 2006
- Heuristics for Optimising the Calculation of Hypervolume for Multi-objective Optimisation ProblemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Scalable multi-objective optimization test problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Bounded archiving using the lebesgue measurePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A unified model for multi-objective evolutionary algorithms with elitismPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002