Abstract
In real-world scenes involving multimodal multiobjective optimization, there may exist different Pareto optimal sets (PSs) for the same Pareto front (PF), and some PFs even need to reserve all PSs, including local and global PSs. Most existing multimodal multiobjective optimization algorithms often distinguish solutions according to their diversity and convergence performances in the objective space. However, they pay little attention to the potential of solutions in the decision space. To solve this issue, a novel multimodal multiobjective memetic algorithm based on a local detection mechanism and a clustering-based selection strategy is proposed in this paper. To reserve more global and local PSs in the decision space, a density-based clustering method is adopted in the local detection mechanism, assisting in collecting solutions in the local clusters. Furthermore, in the clustering-based selection strategy, two different clustering methods are applied to different situations according to the ratio of the local optimal solutions. Extensive experimental results and performance comparisons with state-of-the-art algorithms show the superiority of our proposed algorithm.
Similar content being viewed by others
Data availability statement
The datasets generated during and/or analyzed during the current study are available from the corresponding author on reasonable request.
References
Yue C, Qu B, Yu K, Liang J, Li X (2019) A novel scalable test problem suite for multimodal multiobjective optimization. Swarm Evol Comput 48(2018):62–71. https://doi.org/10.1016/j.swevo.2019.03.011
Ishibuchi H, Peng Y, and Shang K (2019) A scalable multimodal multiobjective test problem. In: 2019 IEEE Congress on Evolutionary Computation (CEC) 2019 (pp 310-317) https://doi.org/10.1109/CEC.2019.8789971
Liang JJ et al. (2019) Problem definitions and evaluation criteria for the CEC 2019 special session on multimodal multiobjective optimization J. Sch Electr Eng Zhengzhou Univ Zhengzhou China, https://doi.org/10.13140/RG.2.2.31746.02247.
Grimme C, Kerschke P, and Trautmann H (2019) Multimodality in multi-objective optimization – More boon than bane? Lect Notes Comput Sci (Including Subser Lect Notes Artif Intell Lect Notes Bioinformatics), vol. 11411 LNCS, pp 126–138, https://doi.org/10.1007/978-3-030-12598-1_11.
Yue C, Qu B, Liang J (2018) A multiobjective particle swarm optimizer using ring topology for solving multimodal multiobjective problems. IEEE Trans Evol Comput 22(5):805–817. https://doi.org/10.1109/TEVC.2017.2754271
Liang J, Guo Q, Yue C, and Qu B (2018) A self-organizing multi-objective particle swarm optimization algorithm for multimodal multi-objective problems chapter (vol. 10941). Springer International Publishing, Cham
Liu Y, Ishibuchi H, Nojima Y, Masuyama Y, and Shang K (2018) Multimodal multi-objective optimization: a preliminary study. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (vol. 11101) LNCS. pp 262–273, https://doi.org/10.1007/978-3-319-99253-2_21.
Liu Y, Ishibuchi H, Y. N. B, and Masuyama N (2018) A double-niched evolutionary algorithm and its behavior on polygon-based problems, (vol 1). Springer International Publishing, Belrin
Tanabe R, Ishibuchi, H and Optimization MM (2020) A decomposition-based evolutionary algorithm for multi-modal multi-objective optimization. Int Conf parallel Probl solving from Nat
Liang J et al (2019) Multimodal multiobjective optimization with differential evolution. Swarm Evol Comput 44(2018):1028–1059. https://doi.org/10.1016/j.swevo.2018.10.016
Liu Y, Yen GG, Gong D (2019) A Multimodal multiobjective evolutionary algorithm using two-archive and recombination strategies. IEEE Trans Evol Comput 23(4):660–674. https://doi.org/10.1109/TEVC.2018.2879406
Zhang K, Shen C, Yen GG, Xu Z, He J (2021) Two-stage double niched evolution strategy for multimodal multi-objective optimization. IEEE Trans Evol Comput 25(4):754–768. https://doi.org/10.1109/TEVC.2021.3064508
Aarts E and Korst J (1987) Simulated annealing. Simulated Annealing Theory Appl, 7
Yang Q, Wang Z, Luo J, He Q (2021) Balancing performance between the decision space and the objective space in multimodal multiobjective optimization. Memetic Comput 13(1):31–47. https://doi.org/10.1007/s12293-021-00325-w
Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197. https://doi.org/10.1109/4235.996017
Zhang Q, Li H (2007) MOEA/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712–731. https://doi.org/10.1109/TEVC.2007.892759
Digalakis J, Margaritis K (2004) Performance comparison of memetic algorithms. Complex Int 10:1–15
Mei Yi, Tang Ke, Yao X (2011) Decomposition-based memetic algorithm for multiobjective capacitated arc routing problem. IEEE Trans Evol Comput 15(2):151–165
Xiang S, Wang L, Xing L, Du Y (2021) An effective memetic algorithm for UAV routing and orientation under uncertain navigation environments. Memetic Comput 13(2):169–183. https://doi.org/10.1007/s12293-021-00334-9
Li G, Zhu Z, Ma L, Ma X (2021) Multi-objective memetic algorithm for core-periphery structure detection in complex network. Memetic Comput 13(3):285–306. https://doi.org/10.1007/s12293-021-00342-9
Wang L, Feng L (2021) Guest editorial: Special issue on memetic algorithms with learning strategy. Memetic Comput 13(2):147–148. https://doi.org/10.1007/s12293-021-00337-6
Xu R, Wunsch D (2005) Survey of clustering algorithms. IEEE Trans Neural Networks 16(3):645–678. https://doi.org/10.1109/TNN.2005.845141
James M and others (1967) Some methods for classification and analysis of multivariate observations. Proc fifth Berkeley Symp Math Stat Probab 1(14): 281–297
Daszykowski M, Walczak B (2009) A density-based algorithm for discovering clusters in large spatial databases with noise. Compr Chemom 2:635–654. https://doi.org/10.1016/B978-044452701-1.00067-3
Wang W, Yang J, and Muntz R (1997) STING : A statistical information grid approach to spatial data mining 1 introduction 2 related work. Proc 23rd Int Conf Very Large Data Bases, pp 186–195
Hua Y, Jin Y, Hao K (2019) A clustering-based adaptive evolutionary algorithm for multiobjective optimization with irregular pareto fronts. IEEE Trans Cybern 49(7):2758–2770. https://doi.org/10.1109/TCYB.2018.2834466
Lin Q, Lin W, Zhu Z, Gong M, Li J, Coello CAC (2021) Multimodal multiobjective evolutionary optimization with dual clustering in decision and objective spaces. IEEE Trans Evol Comput 25(1):130–144. https://doi.org/10.1109/TEVC.2020.3008822
Deb K, Jain H (2014) An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, Part I: Solving problems with box constraints. IEEE Trans Evol Comput 18(4):577–601. https://doi.org/10.1109/TEVC.2013.2281535
Das I, Dennis JE (1998) Normal-boundary intersection : a new method for generating the pareto surface in nonlinear. SIAM J Optim 8(3):631–657
Zitzler E, Laumanns M, and Thiele L (2014) SPEA2: Improving the strength pareto evolutionary algorithm Eckart. Brisk Bin. Robust Invariant Scalable Keypoints, pp 0–2
Luo N, Lin W, Huang P, Chen J (2021) An evolutionary algorithm with clustering-based assisted selection strategy for multimodal multiobjective optimization. Complexity. https://doi.org/10.1155/2021/4393818
Bosman PAN, Thierens D (2003) The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Trans Evol Comput 7(2):174–188. https://doi.org/10.1109/TEVC.2003.810761
Li M and Zheng J (2010) Spread assessment for evolutionary multi-objective optimization. Lect Notes Comput Sci (including Subser Lect Notes Artif Intell Lect Notes Bioinformatics) (vol. 5467). LNCS. pp 216–230 https://doi.org/10.1007/978-3-642-01020-0_20.
Acknowledgements
This work is supported by the National Natural Science Foundation of China (NSFC) under Grants 61876110 and 61806130, the Joint Funds of the NSFC under Key Program Grant U1713212, the Shenzhen Scientific Research and Development Funding Program under Grant JCYJ20190808164211203, the Guangdong “Pearl River Talent Recruitment Program” under Grant 2019ZT08X603, and Shenzhen Science and Technology Innovation Commission (R2020A045).
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
Conflict of Interest
The authors declare that they have no conflicts of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Luo, N., Ye, Y., Lin, W. et al. A novel multimodal multiobjective memetic algorithm with a local detection mechanism and a clustering-based selection strategy. Memetic Comp. 15, 31–43 (2023). https://doi.org/10.1007/s12293-022-00353-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12293-022-00353-0