Decomposition-Based Multi-Objective Evolutionary Algorithm Design Under Two Algorithm Frameworks

The development of efficient and effective evolutionary multi-objective optimization (EMO) algorithms has been an active research topic in the evolutionary computation community. Over the years, many EMO algorithms have been proposed. The existing EMO algorithms are mainly developed based on the final population framework. In the final population framework, the final population of an EMO algorithm is presented to the decision maker. Thus, it is required that the final population produced by an EMO algorithm is a good solution set. Recently, the use of solution selection framework was suggested for the design of EMO algorithms. This framework has an unbounded external archive to store all the examined solutions. A pre-specified number of solutions are selected from the archive as the final solutions presented to the decision maker. When the solution selection framework is used, EMO algorithms can be designed in a more flexible manner since the final population is not necessarily to be a good solution set. In this paper, we examine the design of MOEA/D under these two frameworks. We use an offline genetic algorithm-based hyper-heuristic method to find the optimal configuration of MOEA/D in each framework. The DTLZ and WFG test suites and their minus versions are used in our experiments. The experimental results suggest the possibility that a more flexible, robust and high-performance MOEA/D algorithm can be obtained when the solution selection framework is used.

[1]  Shaobo Liu,et al.  A multi-objective optimization approach for health-care facility location-allocation problems in highly developed cities such as Hong Kong , 2016, Comput. Environ. Urban Syst..

[2]  C. A. Coello Coello,et al.  Evolutionary multi-objective optimization: a historical view of the field , 2006, IEEE Computational Intelligence Magazine.

[3]  David Corne,et al.  The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

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

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

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

[7]  Tao Zhang,et al.  On the effect of reference point in MOEA/D for multi-objective optimization , 2017, Appl. Soft Comput..

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

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

[10]  Hisao Ishibuchi,et al.  An analysis of control parameters of MOEA/D under two different optimization scenarios , 2018, Appl. Soft Comput..

[11]  Hisao Ishibuchi,et al.  Lazy Greedy Hypervolume Subset Selection from Large Candidate Solution Sets , 2020, 2020 IEEE Congress on Evolutionary Computation (CEC).

[12]  Hisao Ishibuchi,et al.  Pareto Fronts of Many-Objective Degenerate Test Problems , 2016, IEEE Transactions on Evolutionary Computation.

[13]  Ye Tian,et al.  PlatEMO: A MATLAB Platform for Evolutionary Multi-Objective Optimization [Educational Forum] , 2017, IEEE Computational Intelligence Magazine.

[14]  Keith L. Downing,et al.  Introduction to Evolutionary Algorithms , 2006 .

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

[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]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[18]  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..

[19]  Turan Paksoy,et al.  A genetic algorithm approach for multi-objective optimization of supply chain networks , 2006, Comput. Ind. Eng..

[20]  Hisao Ishibuchi,et al.  A New Framework of Evolutionary Multi-Objective Algorithms with an Unbounded External Archive , 2020 .

[21]  Hisao Ishibuchi,et al.  Algorithm Configurations of MOEA/D with an Unbounded External Archive , 2020, 2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[22]  Hiroyuki Sato,et al.  Inverted PBI in MOEA/D and its impact on the search performance on multi and many-objective optimization , 2014, GECCO.

[23]  Bo Zhang,et al.  Balancing Convergence and Diversity in Decomposition-Based Many-Objective Optimizers , 2016, IEEE Transactions on Evolutionary Computation.

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

[25]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

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

[27]  Ajay K. Ray,et al.  Multi-objective optimization of industrial hydrogen plants , 2001 .

[28]  Gerald W. Evans,et al.  Multi-objective optimization models for patient allocation during a pandemic influenza outbreak , 2014, Comput. Oper. Res..

[29]  Hisao Ishibuchi,et al.  Relation between Neighborhood Size and MOEA/D Performance on Many-Objective Problems , 2013, EMO.

[30]  R. Lyndon While,et al.  A review of multiobjective test problems and a scalable test problem toolkit , 2006, IEEE Transactions on Evolutionary Computation.

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

[32]  Peter J. Fleming,et al.  Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.

[33]  Carlos A. Coello Coello,et al.  Evolutionary multiobjective optimization: open research areas and some challenges lying ahead , 2019, Complex & Intelligent Systems.

[34]  Carlos M. Fonseca,et al.  Computing and Updating Hypervolume Contributions in Up to Four Dimensions , 2018, IEEE Transactions on Evolutionary Computation.

[35]  H. Ishibuchi,et al.  On the effect of normalization in MOEA/D for multi-objective and many-objective optimization , 2017 .

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

[37]  Kalyanmoy Deb,et al.  Analysing mutation schemes for real-parameter genetic algorithms , 2014, Int. J. Artif. Intell. Soft Comput..

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

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

[40]  Carlos M. Fonseca,et al.  Hypervolume Subset Selection in Two Dimensions: Formulations and Algorithms , 2016, Evolutionary Computation.