{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:09:09Z","timestamp":1740136149873,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T00:00:00Z","timestamp":1662595200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T00:00:00Z","timestamp":1662595200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100012320","name":"Otto-von-Guericke-Universit\u00e4t Magdeburg","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012320","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2023,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Many real-world multi-objective optimization problems inherently have multiple multi-modal solutions and it is in fact very important to capture as many of these solutions as possible. Several crowding distance methods have been developed in the past few years to approximate the optimal solution in the search space. In this paper, we discuss some of the shortcomings of the crowding distance-based methods such as inaccurate estimates of the density of neighboring solutions in the search space. We propose a new classification for the selection operations of Pareto-based multi-modal multi-objective optimization algorithms. This classification is based on utilizing nearby solutions from other fronts to calculate the crowding values. Moreover, to address some of the drawbacks of existing crowding methods, we propose two algorithms whose selection mechanisms are based on each of the introduced types of selection operations. These algorithms are called NxEMMO and ES-EMMO. Our proposed algorithms are evaluated on 14 test problems of various complexity levels. According to our results, in most cases, the NxEMMO algorithm with the proposed selection mechanism produces more diverse solutions in the search space in comparison to other competitive algorithms.<\/jats:p>","DOI":"10.1007\/s11047-022-09921-2","type":"journal-article","created":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T14:03:07Z","timestamp":1662645787000},"page":"341-356","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Analysis of inter and intra-front operations in multi-modal multi-objective optimization problems"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4787-8035","authenticated-orcid":false,"given":"Mahrokh","family":"Javadi","sequence":"first","affiliation":[]},{"given":"Sanaz","family":"Mostaghim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,8]]},"reference":[{"issue":"1","key":"9921_CR1","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1162\/EVCO_a_00009","volume":"19","author":"J Bader","year":"2011","unstructured":"Bader J, Zitzler E (2011) Hype: An algorithm for fast hypervolume-based many-objective optimization. Evol Comput 19(1):45\u201376","journal-title":"Evol Comput"},{"issue":"3","key":"9921_CR2","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1016\/j.ejor.2006.08.008","volume":"181","author":"N Beume","year":"2007","unstructured":"Beume N, Naujoks B, Emmerich M (2007) Sms-emoa: Multiobjective selection based on dominated hypervolume. Eur J Oper Res 181(3):1653\u20131669","journal-title":"Eur J Oper Res"},{"key":"9921_CR3","doi-asserted-by":"crossref","unstructured":"Deb K, Tiwari S (2005) Omni-optimizer: a procedure for single and multi-objective optimization. In: International conference on evolutionary multi-criterion optimization, pp 47\u201361. Springer, Berlin","DOI":"10.1007\/978-3-540-31880-4_4"},{"issue":"3","key":"9921_CR4","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1016\/j.ejor.2006.06.042","volume":"185","author":"K Deb","year":"2008","unstructured":"Deb K, Tiwari S (2008) Omni-optimizer: a generic evolutionary algorithm for single and multi-objective optimization. Eur J Oper Res 185(3):1062\u20131087","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9921_CR5","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S et al (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"9921_CR6","doi-asserted-by":"crossref","unstructured":"Falc\u00f3n-Cardona JG, Coello\u00a0Coello CA, Emmerich M (2019) Cri-emoa: A pareto-front shape invariant evolutionary multi-objective algorithm. In: International conference on evolutionary multi-criterion optimization, pp 307\u2013318. Springer","DOI":"10.1007\/978-3-030-12598-1_25"},{"key":"9921_CR7","unstructured":"Goldberg DE, Richardson J, et\u00a0al (1987) Genetic algorithms with sharing for multimodal function optimization. In: Genetic algorithms and their applications: proceedings of the second international conference on genetic algorithms, pp 41\u201349. Lawrence Erlbaum, Hillsdale"},{"issue":"105","key":"9921_CR8","first-page":"489","volume":"136","author":"C Grimme","year":"2021","unstructured":"Grimme C, Kerschke P, Aspar P et al (2021) Peeking beyond peaks: challenges and research potentials of continuous multimodal multi-objective optimization. Comput Oper Res 136(105):489","journal-title":"Comput Oper Res"},{"key":"9921_CR9","doi-asserted-by":"crossref","unstructured":"Hiroyasu T, Nakayama S, Miki M (2005) Comparison study of SPEA2+, SPEA2, and NSGA-II in diesel engine emissions and fuel economy problem. In: 2005 IEEE congress on evolutionary computation, IEEE CEC 2005 Proceedings vol 1, pp 236\u2013242","DOI":"10.1109\/CEC.2005.1554690"},{"key":"9921_CR10","doi-asserted-by":"crossref","unstructured":"Hu C, Ishibuchi H (2018a) Incorporation of a decision space diversity maintenance mechanism into MOEA\/D for multi-modal multi-objective optimization. In: GECCO 2018 Companion - proceedings of the 2018 genetic and evolutionary computation conference companion, pp 1898\u20131901","DOI":"10.1145\/3205651.3208224"},{"key":"9921_CR11","doi-asserted-by":"crossref","unstructured":"Hu C, Ishibuchi H (2018b) Incorporation of a decision space diversity maintenance mechanism into MOEA\/D for multi-modal multi-objective optimization. In: Proceedings of the genetic and evolutionary computation conference companion, pp 1898\u20131901","DOI":"10.1145\/3205651.3208224"},{"key":"9921_CR12","doi-asserted-by":"crossref","unstructured":"Ishibuchi, (2015) Modified distance calculation in generational distance and inverted generational distance Hisao. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 9019:110\u2013125","DOI":"10.1007\/978-3-319-15892-1_8"},{"key":"9921_CR13","doi-asserted-by":"crossref","unstructured":"Javadi M, Mostaghim S (2021) A neighborhood-based density measure for multimodal multi-objective optimization. In: Ishibuchi H et al (eds) Evolutionary multi-criterion optimization. EMO 2021. Lecture notes in computer science, vol 12654. pp 335\u2013345. Springer, Cham","DOI":"10.1007\/978-3-030-72062-9_27"},{"key":"9921_CR14","doi-asserted-by":"crossref","unstructured":"Javadi M, Zille H, Mostaghim S (2019) Modified crowding distance and mutation for multimodal multi-objective optimization. In: Proceedings of the genetic and evolutionary computation conference companion, pp 211\u2013212","DOI":"10.1145\/3319619.3321970"},{"key":"9921_CR15","doi-asserted-by":"crossref","unstructured":"Javadi M, Ramirez-Atencia C, Mostaghim S (2020) A novel grid-based crowding distance for multimodal multi-objective optimization. In: 2020 IEEE congress on evolutionary computation (CEC), IEEE, pp 1\u20138","DOI":"10.1109\/CEC48606.2020.9185835"},{"key":"9921_CR16","doi-asserted-by":"crossref","unstructured":"Javadi M, Zille H, Mostaghim S (2021) The effects of crowding distance and mutation in multimodal and multi-objective optimization problems. In: Advances in evolutionary and deterministic methods for design, optimization and control in engineering and sciences. pp 115\u2013130. Springer","DOI":"10.1007\/978-3-030-57422-2_8"},{"key":"9921_CR17","first-page":"742","volume":"3242","author":"M Kim","year":"2004","unstructured":"Kim M, Hiroyasu T, Miki M et al (2004) SPEA2+: Improving the performance of the strength pareto evolutionary algorithm 2. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3242:742\u2013751","journal-title":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)"},{"key":"9921_CR18","doi-asserted-by":"crossref","unstructured":"Kramer O, Danielsiek H (2010) Dbscan-based multi-objective niching to approximate equivalent pareto-subsets. In: Proceedings of the 12th annual conference on Genetic and evolutionary computation, pp 503\u2013510","DOI":"10.1145\/1830483.1830575"},{"key":"9921_CR19","doi-asserted-by":"crossref","unstructured":"Kramer O, Koch P (2009) Rake selection: A novel evolutionary multi-objective optimization algorithm. In: Annual conference on artificial intelligence, pp 177\u2013184. Springer","DOI":"10.1007\/978-3-642-04617-9_23"},{"key":"9921_CR20","first-page":"431","volume":"9","author":"K Kumar","year":"1995","unstructured":"Kumar K, Deb K (1995) Real-coded genetic algorithms with simulated binary crossover: Studies on multimodal and multiobjective problems. Complex syst 9:431\u2013454","journal-title":"Complex syst"},{"issue":"3","key":"9921_CR21","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1162\/106365602760234081","volume":"10","author":"JP Li","year":"2002","unstructured":"Li JP, Balazs ME, Parks GT et al (2002) A species conserving genetic algorithm for multimodal function optimization. Evol Comput 10(3):207\u2013234","journal-title":"Evol Comput"},{"key":"9921_CR22","doi-asserted-by":"crossref","unstructured":"Liang J, Yue C, Qu BY (2016) Multimodal multi-objective optimization: a preliminary study. In: 2016 IEEE congress on evolutionary computation (CEC), IEEE, pp 2454\u20132461","DOI":"10.1109\/CEC.2016.7744093"},{"key":"9921_CR23","doi-asserted-by":"crossref","unstructured":"Liang J, Guo Q, Yue C, et\u00a0al (2018) A self-organizing multi-objective particle swarm optimization algorithm for multimodal multi-objective problems. In: International conference on swarm intelligence, pp 550\u2013560. Springer","DOI":"10.1007\/978-3-319-93815-8_52"},{"key":"9921_CR24","unstructured":"Liang J, Qu B, Gong D, et\u00a0al (2019) Problem definitions and evaluation criteria for the cec 2019 special session on multimodal multiobjective optimization. In: Computational intelligence laboratory, Zhengzhou University"},{"key":"9921_CR25","doi-asserted-by":"crossref","unstructured":"Liu Y, Ishibuchi H, Nojima Y, et\u00a0al (2018) A double-niched evolutionary algorithm and its behavior on polygon-based problems. In: International conference on parallel problem solving from nature, pp 262\u2013273. Springer","DOI":"10.1007\/978-3-319-99253-2_21"},{"issue":"3","key":"9921_CR26","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1109\/TEVC.2019.2914606","volume":"24","author":"EC Osuna","year":"2019","unstructured":"Osuna EC, Sudholt D (2019) Runtime analysis of crowding mechanisms for multimodal optimization. IEEE Trans Evol Comput 24(3):581\u2013592","journal-title":"IEEE Trans Evol Comput"},{"key":"9921_CR27","doi-asserted-by":"crossref","unstructured":"P\u00e9trowski A (1996) A clearing procedure as a niching method for genetic algorithms. In: Proceedings of IEEE international conference on evolutionary computation, IEEE, pp 798\u2013803","DOI":"10.1109\/ICEC.1996.542703"},{"issue":"1","key":"9921_CR28","first-page":"859","volume":"2","author":"M Sebag","year":"2005","unstructured":"Sebag M, Tarrisson N, Teytaud O et al (2005) A multi-objective multi-modal optimization approach for mining stable spatio-temporal patterns. IJCAI Int Joint Conf Artif Intell 2(1):859\u2013864","journal-title":"IJCAI Int Joint Conf Artif Intell"},{"key":"9921_CR29","doi-asserted-by":"crossref","unstructured":"Tanabe R, Ishibuchi H (2018) A decomposition-based evolutionary algorithm for multi-modal multi-objective optimization. In: International conference on parallel problem solving from nature, pp 249\u2013261. Springer","DOI":"10.1007\/978-3-319-99253-2_20"},{"issue":"1","key":"9921_CR30","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/TEVC.2019.2909744","volume":"24","author":"R Tanabe","year":"2019","unstructured":"Tanabe R, Ishibuchi H (2019) A review of evolutionary multimodal multiobjective optimization. IEEE Trans Evol Comput 24(1):193\u2013200","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"9921_CR31","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/TEVC.2012.2185702","volume":"17","author":"L Tang","year":"2012","unstructured":"Tang L, Wang X (2012) A hybrid multiobjective evolutionary algorithm for multiobjective optimization problems. IEEE Trans Evol Comput 17(1):20\u201345","journal-title":"IEEE Trans Evol Comput"},{"key":"9921_CR32","doi-asserted-by":"crossref","unstructured":"Thomsen R (2004) Multimodal optimization using crowding-based differential evolution. Proc 2004 Cong Evol Comput, CEC2004 2:1382\u20131389","DOI":"10.1109\/CEC.2004.1331058"},{"issue":"4","key":"9921_CR33","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/MCI.2017.2742868","volume":"12","author":"Y Tian","year":"2017","unstructured":"Tian Y, Cheng R, Zhang X et al (2017) Platemo: a matlab platform for evolutionary multi-objective optimization [educational forum]. IEEE Comput Intell Mag 12(4):73\u201387","journal-title":"IEEE Comput Intell Mag"},{"key":"9921_CR34","doi-asserted-by":"crossref","unstructured":"Wang Y, Emmerich M, Deutz A, et\u00a0al (2019) Diversity-indicator based multi-objective evolutionary algorithm: Di-moea. In: International conference on evolutionary multi-criterion optimization, pp 346\u2013358. Springer","DOI":"10.1007\/978-3-030-12598-1_28"},{"key":"9921_CR35","doi-asserted-by":"crossref","unstructured":"Weise J, Mostaghim S (2021) Many-objective pathfinding based on fr\u00e9chet similarity metric. In: Evolutionary multi-criterion optimization: 11th international conference, EMO 2021, Shenzhen, China, March 28\u201331, 2021, Proceedings 11, pp 375\u2013386. Springer International Publishing","DOI":"10.1007\/978-3-030-72062-9_30"},{"issue":"5","key":"9921_CR36","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1109\/TEVC.2017.2754271","volume":"22","author":"C Yue","year":"2018","unstructured":"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\u2013817","journal-title":"IEEE Trans Evol Comput"},{"key":"9921_CR37","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.swevo.2019.03.011","volume":"48","author":"C Yue","year":"2019","unstructured":"Yue C, Qu B, Yu K et al (2019) A novel scalable test problem suite for multimodal multiobjective optimization. Swarm Evol Comput 48:62\u201371","journal-title":"Swarm Evol Comput"},{"key":"9921_CR38","doi-asserted-by":"publisher","first-page":"3978","DOI":"10.1016\/j.proeng.2011.08.745","volume":"15","author":"Y Yusoff","year":"2011","unstructured":"Yusoff Y, Ngadiman MS, Zain AM (2011) Overview of nsga-ii for optimizing machining process parameters. Proc Eng 15:3978\u20133983","journal-title":"Proc Eng"},{"issue":"6","key":"9921_CR39","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"9921_CR40","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/TEVC.2007.894202","volume":"12","author":"Q Zhang","year":"2008","unstructured":"Zhang Q, Zhou A, Jin Y (2008) Rm-meda: a regularity model-based multiobjective estimation of distribution algorithm. IEEE Trans Evol Comput 12(1):41\u201363","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"9921_CR41","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1109\/TEVC.2009.2021467","volume":"13","author":"A Zhou","year":"2009","unstructured":"Zhou A, Zhang Q, Jin Y (2009) Approximating the set of pareto-optimal solutions in both the decision and objective spaces by an estimation of distribution algorithm. IEEE Trans Evol Comput 13(5):1167\u20131189","journal-title":"IEEE Trans Evol Comput"},{"key":"9921_CR42","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA2: Improving the strength pareto evolutionary algorithm. Evolutionary methods for design optimization and control with applications to industrial problems. pp 95\u2013100"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-022-09921-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-022-09921-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-022-09921-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T08:17:34Z","timestamp":1686125854000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-022-09921-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,8]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["9921"],"URL":"https:\/\/doi.org\/10.1007\/s11047-022-09921-2","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"type":"print","value":"1567-7818"},{"type":"electronic","value":"1572-9796"}],"subject":[],"published":{"date-parts":[[2022,9,8]]},"assertion":[{"value":"19 August 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors Mahrokh Javadi and Sanaz Mostaghim declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"All procedures performed in studies were in accordance with the ethical standards of the institutional and\/or national research committee and with the 1964 Helsinki declaration and its later amendments or comparable ethical standards.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"For this type of study, formal consent is not required.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}