A Fast Incremental Hypervolume Algorithm

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.

[1]  Luigi Barone,et al.  An evolution strategy with probabilistic mutation for multi-objective optimisation , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[2]  Joshua D. Knowles,et al.  Bounded archiving using the lebesgue measure , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[3]  Marco Laumanns,et al.  A unified model for multi-objective evolutionary algorithms with elitism , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[4]  Lucas Bradstreet,et al.  Heuristics for optimizing the calculation of hypervolume for multi-objective optimization problems , 2005, 2005 IEEE Congress on Evolutionary Computation.

[5]  Nicola Beume,et al.  S-Metric Calculation by Considering Dominated Hypervolume as Klee's Measure Problem , 2009, Evolutionary Computation.

[6]  Eckart Zitzler,et al.  Indicator-Based Selection in Multiobjective Search , 2004, PPSN.

[7]  Robin Charles Purshouse,et al.  On the evolutionary optimisation of many objectives , 2003 .

[8]  Joshua D. Knowles.  Local-search and hybrid evolutionary algorithms for Pareto optimization , 2002 .

[9]  Nicola Beume,et al.  An EMO Algorithm Using the Hypervolume Measure as Selection Criterion , 2005, EMO.

[10]  Eckart Zitzler,et al.  Evolutionary algorithms for multiobjective optimization: methods and applications , 1999 .

[11]  Carlos M. Fonseca,et al.  An Improved Dimension-Sweep Algorithm for the Hypervolume Indicator , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[12]  M. H. Overmars.  New upper bounds in Klees measure problem (extended abstract) , 1988, FOCS 1988.

[13]  Mark H. Overmars,et al.  New upper bounds in Klee's measure problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[14]  Mark Fleischer,et al.  The measure of pareto optima: Applications to multi-objective metaheuristics , 2003 .

[15]  Zbigniew Michalewicz,et al.  Handbook of Evolutionary Computation , 1997 .

[16]  Marco Laumanns,et al.  Scalable multi-objective optimization test problems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[17]  Lucas Bradstreet,et al.  Maximising Hypervolume for Selection in Multi-objective Evolutionary Algorithms , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[18]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

[19]  R. Lyndon While,et al.  A faster algorithm for calculating hypervolume , 2006, IEEE Transactions on Evolutionary Computation.

[20]  Lucas Bradstreet,et al.  Incrementally maximising hypervolume for selection in multi-objective evolutionary algorithms , 2007, 2007 IEEE Congress on Evolutionary Computation.