Heuristic orientation adjustment for better exploration in multi-objective optimization
- 29 Downloads
Decomposition strategy which employs predefined subproblem framework and reference vectors has significant contribution in multi-objective optimization, and it can enhance local convergence as well as global diversity. However, the fixed exploring directions sacrifice flexibility and adaptability; therefore, extra reference adaptations should be considered under different shapes of the Pareto front. In this paper, a population-based heuristic orientation generating approach is presented to build a dynamic decomposition. The novel approach replaces the exhaustive reference distribution with reduced and partial orientations clustered within potential areas and provides flexible and scalable instructions for better exploration. Numerical experiment results demonstrate that the proposed method is compatible with both regular Pareto fronts and irregular cases and maintains outperformance or competitive performance compared to some state-of-the-art multi-objective approaches and adaptive-based algorithms. Moreover, the novel strategy presents more independence on subproblem aggregations and provides an autonomous evolving branch in decomposition-based researches.
KeywordsDecomposition Multi-objective Adaptive reference vector Evolutionary algorithm
This work is supported by the China Scholarship Council, 201706260064, National Natural Science Foundation of China under Grant Nos. 61503287 & 71771176, NUSRI China Jiangsu Provincial Grant BK20150386 & BE2016077, and Zhejiang Provincial Natural Science Foundation of China under Grant No. LY18F030010. The authors would like to thank Abigail Martin for the proofreading.
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
- 4.Cai X, Yang Z, Fan Z, Zhang Q (2016) Decomposition-based-sorting and angle-based-selection for evolutionary multiobjective and many-objective optimization. IEEE Trans Cybern PP(99):1–14Google Scholar
- 9.Deb K, Thiele L, Laumanns M, Zitzler E (2002) Scalable multi-objective optimization test problems. In: Cec’02: proceedings of the 2002 congress on evolutionary computation, vol 1–2, pp 825–830Google Scholar
- 16.Ishibuchi H, Sakane Y, Tsukamoto N, Nojima Y (2010) Simultaneous use of different scalarizing functions in MOEA/D. In: Proceedings of the 12th annual conference on genetic and evolutionary computation, ACM, pp 519–526Google Scholar
- 22.Liu B, Fernandez FV, Zhang Q, Pak M, Sipahi S, Gielen G (2010) An enhanced MOEA/D-DE and its application to multiobjective analog cell sizing. In: 2010 IEEE congress on evolutionary computation (CEC), IEEE, pp 1–7Google Scholar
- 26.Pilat M, Neruda R (2015) Incorporating user preferences in moead through the coevolution of weights. In: Proceedings of the 2015 annual conference on genetic and evolutionary computation, ACM, pp 727–734Google Scholar
- 30.Sato H (2014) Inverted PBI in MOEA/D and its impact on the search performance on multi and many-objective optimization. In: Proceedings of the 2014 annual conference on genetic and evolutionary computation, ACM, pp 645–652Google Scholar
- 32.Tian Y, Cheng R, Zhang X, Jin Y (2017) Platemo: a matlab platform for evolutionary multi-objective optimization. Neural Evol Comput 12(4):73–87Google Scholar
- 34.Wang H, Jin Y, Yao X (2016) Diversity assessment in many-objective optimization. IEEE Trans Cybern PP(99):1–13Google Scholar
- 37.Wang Z, Zhang Q, Li H (2015) Balancing convergence and diversity by using two different reproduction operators in MOEA/D: some preliminary work. In: 2015 IEEE international conference on systems, man, and cybernetics (SMC), IEEE, pp 2849–2854Google Scholar
- 43.Zhang H, Song S, Zhou A, Gao XZ (2014) A clustering based multiobjective evolutionary algorithm. In: 2014 IEEE congress on evolutionary computation, pp 723–730Google Scholar
- 45.Zhang Q, Zhou A, Zhao S, Suganthan PN, Liu W, Tiwari S (2008) Multiobjective optimization test instances for the CEC 2009 special session and competition. University of Essex, Colchester, UK and Nanyang technological University, Singapore, special session on performance assessment of multi-objective optimization algorithms, technical report, pp 1–30Google Scholar