A Fast Incremental Hypervolume Algorithm
- 3 April 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 12 (6), 714-723
- https://doi.org/10.1109/tevc.2008.919001
Abstract
When hypervolume is used as part of the selection or archiving process in a multiobjective evolutionary algorithm, it is necessary to determine which solutions contribute the least hypervolume to a front. Little focus has been placed on algorithms that quickly determine these solutions and there are no fast algorithms designed specifically for this purpose. We describe an algorithm, IHSO, that quickly determines a solution's contribution. Furthermore, we describe and analyse heuristics that reorder objectives to minimize the work required for IHSO to calculate a solution's contribution. Lastly, we describe and analyze search techniques that reduce the amount of work required for solutions other than the least contributing one. Combined, these techniques allow multiobjective evolutionary algorithms to calculate hypervolume inline in increasingly complex and large fronts in many objectives.Keywords
This publication has 11 references indexed in Scilit:
- Incrementally maximising hypervolume for selection in multi-objective evolutionary algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- 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
- An Improved Dimension-Sweep Algorithm for the Hypervolume IndicatorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Scalable multi-objective optimization test problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Performance assessment of multiobjective optimizers: an analysis and reviewIEEE Transactions on Evolutionary Computation, 2003
- An evolution strategy with probabilistic mutation for multi-objective optimisationPublished 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
- The Measure of Pareto Optima: Applications to Multiobjective MetaheuristicsPublished by Defense Technical Information Center (DTIC) ,2002