Approximation-Guided Evolutionary Multi-Objective Optimization

Multi-objective optimization problems arise frequently in applications but can often only be solved approximately by heuristic approaches. Evolutionary algorithms have been widely used to tackle multi-objective problems. These algorithms use different measures to ensure diversity in the objective space but are not guided by a formal notion of approximation. We present a new framework of an evolutionary algorithm for multi-objective optimization that allows to work with a formal notion of approximation. Our experimental results show that our approach outperforms state-of-the-art evolutionary algorithms in terms of the quality of the approximation that is obtained in particular for problems with many objectives.

[1]  Kalyanmoy Deb,et al.  Simulated Binary Crossover for Continuous Search Space , 1995, Complex Syst..

[2]  Marco Laumanns,et al.  SPEA2: Improving the Strength Pareto Evolutionary Algorithm For Multiobjective Optimization , 2002 .

[3]  Mihalis Yannakakis,et al.  Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems , 2009, SIAM J. Comput..

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

[5]  Tobias Friedrich,et al.  Approximating the volume of unions and intersections of high-dimensional geometric objects , 2008, Comput. Geom..

[6]  Mihalis Yannakakis,et al.  How good is the Chord algorithm? , 2010, SODA '10.

[7]  E. Polak,et al.  On Multicriteria Optimization , 1976 .

[8]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[9]  Mihalis Yannakakis,et al.  On the approximability of trade-offs and optimal access of Web sources , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

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

[11]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[12]  Tobias Friedrich,et al.  Tight Bounds for the Approximation Ratio of the Hypervolume Indicator , 2010, PPSN.

[13]  R. K. Ursem Multi-objective Optimization using Evolutionary Algorithms , 2009 .

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

[15]  Marco Laumanns,et al.  Scalable Test Problems for Evolutionary Multiobjective Optimization , 2005, Evolutionary Multiobjective Optimization.

[16]  Marco Laumanns,et al.  Combining Convergence and Diversity in Evolutionary Multiobjective Optimization , 2002, Evolutionary Computation.

[17]  Maoguo Gong,et al.  Multiobjective Immune Algorithm with Nondominated Neighbor-Based Selection , 2008, Evolutionary Computation.

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

[19]  Tobias Friedrich,et al.  The maximum hypervolume set yields near-optimal approximation , 2010, GECCO '10.

[20]  Enrique Alba,et al.  The jMetal framework for multi-objective optimization: Design and architecture , 2010, IEEE Congress on Evolutionary Computation.