Illustration of fairness in evolutionary multi-objective optimization

It is widely assumed that evolutionary algorithms for multi-objective optimization problems should use certain mechanisms to achieve a good spread over the Pareto front. In this paper, we examine such mechanisms from a theoretical point of view and analyze simple algorithms incorporating the concept of fairness. This mechanism tries to balance the number of offspring of all individuals in the current population. We rigorously analyze the runtime behavior of different fairness mechanisms and present illustrative examples to point out situations, where the right mechanism can speed up the optimization process significantly. We also indicate drawbacks for the use of fairness by presenting instances, where the optimization process is slowed down drastically.

[1]  Tobias Friedrich,et al.  Don't be greedy when calculating hypervolume contributions , 2009, FOGA '09.

[2]  Oliver Giel,et al.  Expected runtimes of a simple multi-objective evolutionary algorithm , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[3]  Thomas Jansen,et al.  Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Evolutionary Algorithms-How to Cope With Plateaus of Constant Fitness and When to Reject Strings of the Same Fitness , 2001 .

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

[5]  Anne Auger,et al.  Theory of the hypervolume indicator: optimal μ-distributions and the choice of the reference point , 2009, FOGA '09.

[6]  Marco Laumanns,et al.  Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions , 2004, IEEE Transactions on Evolutionary Computation.

[7]  Frank Neumann,et al.  Minimum spanning trees made easier via multi-objective optimization , 2005, GECCO '05.

[8]  Frank Neumann,et al.  Plateaus can be harder in multi-objective optimization , 2007, 2007 IEEE Congress on Evolutionary Computation.

[9]  Frank Neumann,et al.  Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization , 2008, PPSN.

[10]  Stephen R. Marsland,et al.  Convergence Properties of (μ + λ) Evolutionary Algorithms , 2011, AAAI.

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

[12]  Frank Neumann,et al.  Computing minimum cuts by randomized search heuristics , 2008, GECCO.

[13]  Thomas Jansen,et al.  and Management , 1998 .

[14]  Frank Neumann,et al.  Multiplicative approximations and the hypervolume indicator , 2009, GECCO.

[15]  Frank Neumann,et al.  Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization , 2008, GECCO '08.

[16]  Frank Neumann,et al.  Analyzing Hypervolume Indicator Based Algorithms , 2008, PPSN.

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

[18]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[19]  Thomas Jansen,et al.  UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization , 2004 .

[20]  Frank Neumann,et al.  Computing Minimum Cuts by Randomized Search Heuristics , 2008, GECCO '08.

[21]  Carsten Witt,et al.  Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models , 2007, Evolutionary Computation.

[22]  Frank Neumann,et al.  Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms , 2009, FOGA '09.

[23]  Frank Neumann,et al.  Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem , 2004, Eur. J. Oper. Res..

[24]  Frank Neumann,et al.  Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms , 2008, PPSN.

[25]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .