Hypervolume Subset Selection in Two Dimensions: Formulations and Algorithms

The hypervolume subset selection problem consists of finding a subset, with a given cardinality k, of a set of nondominated points that maximizes the hypervolume indicator. This problem arises in selection procedures of evolutionary algorithms for multiobjective optimization, for which practically efficient algorithms are required. In this article, two new formulations are provided for the two-dimensional variant of this problem. The first is a (linear) integer programming formulation that can be solved by solving its linear programming relaxation. The second formulation is a k-link shortest path formulation on a special digraph with the Monge property that can be solved by dynamic programming in time. This improves upon the result of in Bader (2009), and slightly improves upon the result of in Bringmann et al. (2014b), which was developed independently from this work using different techniques. Numerical results are shown for several values of n and k.

[1]  Carlos M. Fonseca,et al.  Artificial Evolution , 2011, Lecture Notes in Computer Science.

[2]  Lothar Thiele,et al.  Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study , 1998, PPSN.

[3]  Nicola Beume,et al.  SMS-EMOA: Multiobjective selection based on dominated hypervolume , 2007, Eur. J. Oper. Res..

[4]  Luís Paquete,et al.  On Beam Search for Multicriteria Combinatorial Optimization Problems , 2012, CPAIOR.

[5]  Joshua D. Knowles,et al.  On metrics for comparing nondominated sets , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[6]  Johannes Bader,et al.  Hypervolume-based search for multiobjective optimization: Theory and methods , 2010 .

[7]  Luís Paquete,et al.  A note on the ϵ-indicator subset selection , 2013, Theor. Comput. Sci..

[8]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[9]  Tobias Friedrich,et al.  Approximating the least hypervolume contributor: NP-hard in general, but fast in practice , 2008, Theor. Comput. Sci..

[10]  Tobias Friedrich,et al.  An Efficient Algorithm for Computing Hypervolume Contributions , 2010, Evolutionary Computation.

[11]  Alok Aggarwal,et al.  Finding a minimum-weightk-link path in graphs with the concave Monge property and applications , 1994, Discret. Comput. Geom..

[12]  Tobias Friedrich,et al.  Generic Postprocessing via Subset Selection for Hypervolume and Epsilon-Indicator , 2014, PPSN.

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

[14]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[15]  Alok Aggarwal,et al.  Sequential Searching in Multidimensional Monotone Arrays , 1989 .

[16]  Thomas Bartz-Beielstein,et al.  Parallel Problem Solving from Nature – PPSN XIII , 2014, Lecture Notes in Computer Science.

[17]  Alok Aggarwal,et al.  Geometric Applications of a Matrix Searching Algorithm , 1986, Symposium on Computational Geometry.

[18]  Stefan Roth,et al.  Covariance Matrix Adaptation for Multi-objective Optimization , 2007, Evolutionary Computation.

[19]  Subhash Suri,et al.  Matrix Searching with the Shortest-Path Metric , 1997, SIAM J. Comput..

[20]  Karl Bringmann,et al.  Two-dimensional subset selection for hypervolume and epsilon-indicator , 2014, GECCO.

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

[22]  Lothar Thiele,et al.  Quality Assessment of Pareto Set Approximations , 2008, Multiobjective Optimization.

[23]  Serpil Sayin,et al.  Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming , 2000, Math. Program..

[24]  Baruch Schieber,et al.  Computing a minimum-weight k-link path in graphs with the concave Monge property , 1995, SODA '95.

[25]  David W. Corne,et al.  Properties of an adaptive archiving algorithm for storing nondominated vectors , 2003, IEEE Trans. Evol. Comput..

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

[27]  Alok Aggarwal,et al.  Notes on searching in multidimensional monotone arrays , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

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

[29]  Eckart Zitzler,et al.  HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization , 2011, Evolutionary Computation.

[30]  Carlos M. Fonseca,et al.  Computing Hypervolume Contributions in Low Dimensions: Asymptotically Optimal Algorithm and Complexity Results , 2011, EMO.

[31]  Martin J. Oates,et al.  On the Assessment of Multiobjective Approaches to the Adaptive Distributed Database Management Problem , 2000, PPSN.

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

[33]  S. Ruzika,et al.  Approximation Methods in Multiobjective Programming , 2005 .

[34]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .