A New Framework of Evolutionary Multi-Objective Algorithms with an Unbounded External Archive

This paper proposes a new framework for the design of evolutionary multi-objective optimization (EMO) algorithms. The main characteristic feature of the proposed framework is that the optimization result of an EMO algorithm is not the final population but a subset of the examined solutions during its execution. As a post-processing procedure, a pre-specified number of solutions are selected from an unbounded external archive where all the examined solutions are stored. In the proposed framework, the final population does not have to be a good solution set. The point of the algorithm design is to examine a wide variety of solutions over the entire Pareto front and to select well-distributed solutions from the archive. In this paper, first we explain difficulties in the design of EMO algorithms in the existing two frameworks: non-elitist and elitist. Next, we propose the new framework of EMO algorithms. Then we demonstrate advantages of the proposed framework over the existing ones through computational experiments. Finally we suggest some interesting and promising future research topics.

[1]  Hisao Ishibuchi,et al.  Performance of Decomposition-Based Many-Objective Algorithms Strongly Depends on Pareto Front Shapes , 2017, IEEE Transactions on Evolutionary Computation.

[2]  Carlos A. Coello Coello,et al.  A Study of the Parallelization of a Coevolutionary Multi-objective Evolutionary Algorithm , 2004, MICAI.

[3]  Hisao Ishibuchi,et al.  How to Specify a Reference Point in Hypervolume Calculation for Fair Performance Comparison , 2018, Evolutionary Computation.

[4]  Qingfu Zhang,et al.  An Evolutionary Many-Objective Optimization Algorithm Based on Dominance and Decomposition , 2015, IEEE Transactions on Evolutionary Computation.

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

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

[7]  Hemant Kumar Singh,et al.  Understanding Hypervolume Behavior Theoretically for Benchmarking in Evolutionary Multi/Many-Objective Optimization , 2020, IEEE Transactions on Evolutionary Computation.

[8]  Xin Yao,et al.  Many-Objective Evolutionary Algorithms , 2015, ACM Comput. Surv..

[9]  Xin Yao,et al.  An Empirical Investigation of the Optimality and Monotonicity Properties of Multiobjective Archiving Methods , 2019, EMO.

[10]  Michael T. M. Emmerich,et al.  Cone-Based Hypervolume Indicators: Construction, Properties, and Efficient Computation , 2013, EMO.

[11]  Mike Preuss,et al.  Measuring Multimodal Optimization Solution Sets with a View to Multiobjective Techniques , 2013 .

[12]  Hisao Ishibuchi,et al.  R2-Based Hypervolume Contribution Approximation , 2018, IEEE Transactions on Evolutionary Computation.

[13]  Luís M. S. Russo,et al.  Quick Hypervolume , 2012, IEEE Transactions on Evolutionary Computation.

[14]  Hisao Ishibuchi,et al.  Comparison of Hypervolume, IGD and IGD+ from the Viewpoint of Optimal Distributions of Solutions , 2019, EMO.

[15]  Yuren Zhou,et al.  A Many-Objective Evolutionary Algorithm With Pareto-Adaptive Reference Points , 2020, IEEE Transactions on Evolutionary Computation.

[16]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints , 2014, IEEE Transactions on Evolutionary Computation.

[17]  Hisao Ishibuchi,et al.  Adapting Reference Vectors and Scalarizing Functions by Growing Neural Gas to Handle Irregular Pareto Fronts , 2020, IEEE Transactions on Evolutionary Computation.

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

[19]  Sanaz Mostaghim,et al.  Distance Based Ranking in Many-Objective Particle Swarm Optimization , 2008, PPSN.

[20]  Jingda Deng,et al.  Approximating Hypervolume and Hypervolume Contributions Using Polar Coordinate , 2019, IEEE Transactions on Evolutionary Computation.

[21]  Tapabrata Ray,et al.  Distance-Based Subset Selection for Benchmarking in Evolutionary Multi/Many-Objective Optimization , 2019, IEEE Transactions on Evolutionary Computation.

[22]  David E. Goldberg,et al.  A niched Pareto genetic algorithm for multiobjective optimization , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[23]  John E. Dennis,et al.  Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems , 1998, SIAM J. Optim..

[24]  Hisao Ishibuchi,et al.  Evolutionary many-objective optimization: A short review , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

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

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

[27]  Lothar Thiele,et al.  The Hypervolume Indicator Revisited: On the Design of Pareto-compliant Indicators Via Weighted Integration , 2007, EMO.

[28]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[29]  Nicola Beume,et al.  Pareto-, Aggregation-, and Indicator-Based Methods in Many-Objective Optimization , 2007, EMO.

[30]  C. Fonseca,et al.  GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION , 1993 .

[31]  Hisao Ishibuchi,et al.  A multi-objective genetic local search algorithm and its application to flowshop scheduling , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[32]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[33]  Hisao Ishibuchi,et al.  Benchmarking Multi- and Many-Objective Evolutionary Algorithms Under Two Optimization Scenarios , 2017, IEEE Access.

[34]  Tapabrata Ray,et al.  An Enhanced Decomposition-Based Evolutionary Algorithm With Adaptive Reference Vectors , 2018, IEEE Transactions on Cybernetics.

[35]  Lucas Bradstreet,et al.  A Fast Way of Calculating Exact Hypervolumes , 2012, IEEE Transactions on Evolutionary Computation.

[36]  Xin Yao,et al.  of Birmingham Quality evaluation of solution sets in multiobjective optimisation , 2019 .

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

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

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

[40]  Hisao Ishibuchi,et al.  Dynamic Specification of a Reference Point for Hypervolume Calculation in SMS-EMOA , 2018, 2018 IEEE Congress on Evolutionary Computation (CEC).

[41]  Hisao Ishibuchi,et al.  Reference Point Specification in Inverted Generational Distance for Triangular Linear Pareto Front , 2018, IEEE Transactions on Evolutionary Computation.

[42]  Hisao Ishibuchi,et al.  How to compare many-objective algorithms under different settings of population and archive sizes , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).