ABSTRACT
A Multi-objective optimization problem with several different Pareto optimal solution sets is defined as a multi-modal multi-objective optimization problem. Finding all the Pareto optimal solution sets for this type of problem can provide more options for the decision maker, which is important in some real-world situations. The Multi-objective evolutionary algorithm based on decomposition (MOEA/D) has been proved to perform well in various multi-objective problems but it does not perform well in finding all the Pareto optimal solution sets for multi-modal multi-objective optimization problems. In this paper, a MOEA/D variant is proposed to solve these problems. K solutions are assigned to each weight vector in the MOEA/D variant and the solutions are evaluated by not only the scalarizing function values but also the minimum distance from other solutions with the same weight vector and the average distance from the neighboring solutions in the same weight vector grid. Experimental results show that the MOEA/D variant performs much better than the original MOEA/D on the multi-modal distance minimization problems.
Supplemental Material
Available for Download
Supplemental files.
- P. C. Chang, S. H. Chen, Q. Zhang, and J. L. Lin. 2008. MOEA/D for flowshop scheduling problems. In 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence). 1433--1438.Google Scholar
- A. Della Cioppa, C. De Stefano, and A. Marcelli. 2007. Where Are the Niches? Dynamic Fitness Sharing. IEEE Transactions on Evolutionary Computation 11, 4 (Aug 2007), 453--465. Google ScholarDigital Library
- K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan. 2002. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6, 2 (Apr 2002), 182--197. Google ScholarDigital Library
- A. E. Eiben and J. E. Smith. 2003. Multimodal Problems and Spatial Distribution. Springer Berlin Heidelberg, Berlin, Heidelberg, 153--172.Google Scholar
- Hisao Ishibuchi, Naoya Akedo, and Yusuke Nojima. 2011. A Many-objective Test Problem for Visually Examining Diversity Maintenance Behavior in a Decision Space. In Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation (GECCO '11). ACM, New York, NY, USA, 649--656. Google ScholarDigital Library
- Hisao Ishibuchi, Yuji Sakane, Noritaka Tsukamoto, and Yusuke Nojima. 2010. Simultaneous Use of Different Scalarizing Functions in MOEA/D. In Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation (GECCO '10). ACM, New York, NY, USA, 519--526. Google ScholarDigital Library
- H. Li and Q. Zhang. 2009. Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II. IEEE Transactions on Evolutionary Computation 13, 2 (April 2009), 284--302. Google ScholarDigital Library
- Jian-Ping Li, Marton E. Balazs, Geoffrey T. Parks, and P. John Clarkson. 2002. A Species Conserving Genetic Algorithm for Multimodal Function Optimization. Evolutionary Computation 10, 3 (2002), 207--234. Google ScholarDigital Library
- J. J. Liang, C. T. Yue, and B. Y. Qu. 2016. Multimodal multi-objective optimization: A preliminary study. In 2016 IEEE Congress on Evolutionary Computation (CEC). 2454--2461.Google Scholar
- Wei Peng, Qingfu Zhang, and Hui Li. 2009. Comparison between MOEA/D and NSGA-II on the Multi-Objective Travelling Salesman Problem. Springer Berlin Heidelberg, Berlin, Heidelberg, 309--324.Google Scholar
- Mike Preuss. 2015. Niching Methods and Multimodal Optimization Performance. Springer International Publishing, Cham, 115--137.Google Scholar
- C. Stoean, M. Preuss, R. Stoean, and D. Dumitrescu. 2010. Multimodal Optimization by Means of a Topological Species Conservation Algorithm. IEEE Transactions on Evolutionary Computation 14, 6 (Dec 2010), 842--864. Google ScholarDigital Library
- R. Thomsen. 2004. Multimodal optimization using crowding-based differential evolution. In Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753), Vol. 2. 1382--1389 Vol.2.Google ScholarCross Ref
- R. K. Ursem. 1999. Multinational evolutionary algorithms. In Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), Vol. 3. 1640 Vol. 3.Google ScholarCross Ref
- Q. Zhang and H. Li. 2007. MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition. IEEE Transactions on Evolutionary Computation 11, 6 (Dec 2007), 712--731. Google ScholarDigital Library
Index Terms
Incorporation of a decision space diversity maintenance mechanism into MOEA/D for multi-modal multi-objective optimization
Recommendations
Adaptive Update Range of Solutions in MOEA/D for Multi and Many-Objective Optimization
SEAL 2014: Proceedings of the 10th International Conference on Simulated Evolution and Learning - Volume 8886MOEA/D, a representative multi-objective evolutionary algorithm, decomposes a multi-objective optimization problem into a number of single objective optimization problems and tries to approximate Pareto front by simultaneously optimizing each of these ...
MOEA/D for Multiple Multi-objective Optimization
Evolutionary Multi-Criterion OptimizationAbstractThis paper defines a new multi-objective optimization problem, called multiple multi-objective optimization problem (MMOP). An MMOP is composed of several multi-objective optimization problems (MOPs) with different decision spaces and the same ...
Effects of Objective Space Normalization in Multi-Objective Evolutionary Algorithms on Real-World Problems
GECCO '23: Proceedings of the Genetic and Evolutionary Computation ConferenceIn real-world multi-objective problems, each objective has a totally different scale. However, some frequently-used multi-objective evolutionary algorithms (MOEAs) have no objective space normalization mechanisms. The effect of objective space ...
Comments