{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T20:50:49Z","timestamp":1771275049477,"version":"3.50.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,2,20]],"date-time":"2022-02-20T00:00:00Z","timestamp":1645315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,2,20]],"date-time":"2022-02-20T00:00:00Z","timestamp":1645315200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LZ20F010008"],"award-info":[{"award-number":["LZ20F010008"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2022,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents an efficient cooperative multi-populations swarm intelligence algorithm based on the Harris Hawks optimization (HHO) algorithm, named CMPMO-HHO, to solve multi-\/many-objective optimization problems. Specifically, this paper firstly proposes a novel cooperative multi-populations framework with dual elite selection named CMPMO\/des. With four excellent strategies, namely the one-to-one correspondence framework between the optimization objectives and the subpopulations, the global archive for information exchange and cooperation among subpopulations, the logistic chaotic single-dimensional perturbation strategy, and the dual elite selection mechanism based on the fast non-dominated sorting and the reference point-based approach, CMPMO\/des achieves considerably high performance on solutions convergence and diversity. Thereafter, in each subpopulation, HHO is used as the single objective optimizer for its impressive high performance. Notably, however, the proposed CMPMO\/des framework can work with any other single objective optimizer without modification. We comprehensively evaluated the performance of CMPMO-HHO on 34 multi-objective and 19 many-objective benchmark problems and extensively compared it with 13 state-of-the-art multi\/many-objective optimization algorithms, three variants of CMPMO-HHO, and a CMPMO\/des based many-objective genetic algorithm named CMPMO-GA. The results show that by taking the advantages of the CMPMO\/des framework, CMPMO-HHO achieves promising performance in solving multi\/many-objective optimization problems.<\/jats:p>","DOI":"10.1007\/s40747-022-00670-4","type":"journal-article","created":{"date-parts":[[2022,2,20]],"date-time":"2022-02-20T06:08:26Z","timestamp":1645337306000},"page":"3299-3332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Cooperative multi-population Harris Hawks optimization for many-objective optimization"],"prefix":"10.1007","volume":"8","author":[{"given":"Na","family":"Yang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7997-6038","authenticated-orcid":false,"given":"Zhenzhou","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Xuebing","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Long","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Qian","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,20]]},"reference":[{"key":"670_CR1","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.future.2019.02.028","volume":"97","author":"B Aaha","year":"2019","unstructured":"Aaha B, Sm C, Hf D, Ia D, Mm E, Hc F (2019) Harris hawks optimization: algorithm and applications. Futur Gener Comput Syst 97:849\u2013872","journal-title":"Futur Gener Comput Syst"},{"key":"670_CR2","doi-asserted-by":"crossref","unstructured":"Asafuddoula M, Ray T, Sarker R, Alam K (2012) An adaptive constraint handling approach embedded MOEA\/D. In: Evolutionary computation","DOI":"10.1109\/CEC.2012.6252868"},{"key":"670_CR3","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1016\/j.asoc.2018.06.024","volume":"70","author":"I Ben Mansour","year":"2018","unstructured":"Ben Mansour I, Basseur M, Saubion F (2018) A multi-population algorithm for multi-objective knapsack problem. Appl Soft Comput 70:814\u2013825. https:\/\/doi.org\/10.1016\/j.asoc.2018.06.024","journal-title":"Appl Soft Comput"},{"issue":"2","key":"670_CR4","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/TEVC.2003.810761","volume":"7","author":"P Bosman","year":"2003","unstructured":"Bosman P, Thierens D (2003) The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Trans Evol Comput 7(2):174\u2013188. https:\/\/doi.org\/10.1109\/TEVC.2003.810761","journal-title":"IEEE Trans Evol Comput"},{"key":"670_CR5","doi-asserted-by":"publisher","unstructured":"Cao S, Lei D (2017) Multiple-population Jaya algorithm for continuous function optimization. In: 2017 International conference on industrial informatics\u2014computing technology, intelligent technology, industrial information integration (ICIICII), pp 258\u2013261. https:\/\/doi.org\/10.1109\/ICIICII.2017.45","DOI":"10.1109\/ICIICII.2017.45"},{"issue":"8","key":"670_CR6","doi-asserted-by":"publisher","first-page":"2912","DOI":"10.1109\/TCYB.2018.2832640","volume":"49","author":"ZG Chen","year":"2019","unstructured":"Chen ZG, Zhan ZH, Lin Y, Gong YJ, Gu TL, Zhao F, Yuan HQ, Chen X, Li Q, Zhang J (2019) Multiobjective cloud workflow scheduling: a multiple populations ant colony system approach. IEEE Trans Cybernet 49(8):2912\u20132926. https:\/\/doi.org\/10.1109\/TCYB.2018.2832640","journal-title":"IEEE Trans Cybernet"},{"issue":"7","key":"670_CR7","doi-asserted-by":"publisher","first-page":"3367","DOI":"10.1109\/TCYB.2019.2899225","volume":"50","author":"H Chen","year":"2020","unstructured":"Chen H, Tian Y, Pedrycz W, Wu G, Wang R, Wang L (2020) Hyperplane assisted evolutionary algorithm for many-objective optimization problems. IEEE Trans Cybernet 50(7):3367\u20133380. https:\/\/doi.org\/10.1109\/TCYB.2019.2899225","journal-title":"IEEE Trans Cybernet"},{"key":"670_CR8","doi-asserted-by":"publisher","unstructured":"Chen L, Cai X, Jin K, Tang Z (2021) MOMPA: a high performance multi-objective optimizer based on marine predator algorithm. In: Proceedings of the genetic and evolutionary computation conference companion, association for computing machinery, pp 177\u2013178. https:\/\/doi.org\/10.1145\/3449726.3459581","DOI":"10.1145\/3449726.3459581"},{"issue":"12","key":"670_CR9","doi-asserted-by":"publisher","first-page":"4108","DOI":"10.1109\/TCYB.2016.2600577","volume":"47","author":"R Cheng","year":"2017","unstructured":"Cheng R, Jin Y, Olhofer M, Sendhoff B (2017) Test problems for large-scale multiobjective and many-objective optimization. IEEE Trans Cybernet 47(12):4108\u20134121. https:\/\/doi.org\/10.1109\/TCYB.2016.2600577","journal-title":"IEEE Trans Cybernet"},{"issue":"2","key":"670_CR10","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1109\/JSTARS.2019.2893621","volume":"12","author":"Q Cheng","year":"2019","unstructured":"Cheng Q, Du B, Zhang L, Liu R (2019) ANSGA-III: a multiobjective endmember extraction algorithm for hyperspectral images. IEEE J Select Top Appl Earth Observ Remote Sens 12(2):700\u2013721. https:\/\/doi.org\/10.1109\/JSTARS.2019.2893621","journal-title":"IEEE J Select Top Appl Earth Observ Remote Sens"},{"key":"670_CR11","unstructured":"Coello C, Ing D, Lechuga M (2003) MOPSO: a proposal for multiple objective particle swarm"},{"key":"670_CR12","unstructured":"Corne DW, Jerram NR, Knowles JD, Oates MJ, JM (2001) PESA-II: region-based selection in evolutionary multiobjective optimization. In: Proceedings of the genetic and evolutionary computation conference (GECCO\u20192001, Morgan Kaufmann Publishers, pp 283\u2013290"},{"key":"670_CR13","doi-asserted-by":"publisher","unstructured":"Dai S, Liu H, Chen L (2015) Evolutionary many-objective optimization algorithm based on improved K-dominance and M2M population decomposition. In: 2015 11th international conference on computational intelligence and security (CIS), pp 286\u2013290, https:\/\/doi.org\/10.1109\/CIS.2015.77","DOI":"10.1109\/CIS.2015.77"},{"issue":"4","key":"670_CR14","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"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\u2013601. https:\/\/doi.org\/10.1109\/TEVC.2013.2281535","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"670_CR15","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, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans Evol Comput"},{"key":"670_CR16","unstructured":"Deb K, Thiele L, Laumanns M, Zitzler E (2006) Scalable test problems for evolutionary multi-objective optimization. Evol Multiobject Optim"},{"key":"670_CR17","doi-asserted-by":"publisher","unstructured":"Deng-Xu H, Gui-Qing L, Hua-Zheng Z (2013) Glowworm swarm optimization algorithm for solving multi-objective optimization problem. In: 2013 Ninth international conference on computational intelligence and security, pp 11\u201315. https:\/\/doi.org\/10.1109\/CIS.2013.10","DOI":"10.1109\/CIS.2013.10"},{"issue":"7","key":"670_CR18","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1109\/TSMC.2017.2654301","volume":"48","author":"M Elarbi","year":"2018","unstructured":"Elarbi M, Bechikh S, Gupta A, Ben Said L, Ong YS (2018) A new decomposition-based NSGA-II for many-objective optimization. IEEE Trans Syst Man Cybernet Syst 48(7):1191\u20131210. https:\/\/doi.org\/10.1109\/TSMC.2017.2654301","journal-title":"IEEE Trans Syst Man Cybernet Syst"},{"issue":"10","key":"670_CR19","doi-asserted-by":"publisher","first-page":"2044","DOI":"10.1016\/j.ins.2009.12.010","volume":"180","author":"S Garc\u00eda","year":"2010","unstructured":"Garc\u00eda S, Fern\u00e1ndez A, Luengo J, Herrera F (2010) Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of power. Inf Sci 180(10):2044\u20132064","journal-title":"Inf Sci"},{"key":"670_CR20","doi-asserted-by":"publisher","unstructured":"He J, Zhou B, Feng C, Jiao H, Liu J (2012) Electric vehicle charging station planning based on multiple-population hybrid genetic algorithm. In: 2012 International conference on control engineering and communication technology, pp 403\u2013406. https:\/\/doi.org\/10.1109\/ICCECT.2012.45","DOI":"10.1109\/ICCECT.2012.45"},{"issue":"2","key":"670_CR21","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s40747-020-00136-5","volume":"6","author":"Y Hua","year":"2020","unstructured":"Hua Y, Jin Y, Hao K, Cao Y (2020) Generating multiple reference vectors for a class of many-objective optimization problems with degenerate pareto fronts. Complex Intell Syst 6(2):275\u2013285. https:\/\/doi.org\/10.1007\/s40747-020-00136-5","journal-title":"Complex Intell Syst"},{"issue":"5","key":"670_CR22","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TEVC.2005.861417","volume":"10","author":"S Huband","year":"2006","unstructured":"Huband S, Hingston P, Barone L, While L (2006) A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans Evol Comput 10(5):477\u2013506","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"670_CR23","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1109\/TEVC.2015.2505784","volume":"20","author":"H Ishibuchi","year":"2016","unstructured":"Ishibuchi H, Masuda H, Nojima Y (2016) Pareto fronts of many-objective degenerate test problems. IEEE Trans Evol Comput 20(5):807\u2013813. https:\/\/doi.org\/10.1109\/TEVC.2015.2505784","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"670_CR24","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1109\/TEVC.2013.2281534","volume":"18","author":"H Jain","year":"2014","unstructured":"Jain H, Deb K (2014) An evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach, part II: handling constraints and extending to an adaptive approach. IEEE Trans Evol Comput 18(4):602\u2013622. https:\/\/doi.org\/10.1109\/TEVC.2013.2281534","journal-title":"IEEE Trans Evol Comput"},{"key":"670_CR25","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/978-3-540-70928-2_55","volume-title":"Evolutionary multi-criterion optimization","author":"M K\u00f6ppen","year":"2007","unstructured":"K\u00f6ppen M, Yoshida K (2007) Substitute distance assignments in NSGA-II for handling many-objective optimization problems. In: Obayashi S, Deb K, Poloni C, Hiroyasu T, Murata T (eds) Evolutionary multi-criterion optimization. Springer, Heidelberg, pp 727\u2013741"},{"issue":"5","key":"670_CR26","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.1109\/TSMCB.2008.925757","volume":"38","author":"WF Leong","year":"2008","unstructured":"Leong WF, Yen GG (2008) PSO-based multiobjective optimization with dynamic population size and adaptive local archives. IEEE Trans Syst Man Cybernet Part B (Cybernetics) 38(5):1270\u20131293. https:\/\/doi.org\/10.1109\/TSMCB.2008.925757","journal-title":"IEEE Trans Syst Man Cybernet Part B (Cybernetics)"},{"issue":"1","key":"670_CR27","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1109\/TEVC.2013.2239648","volume":"18","author":"K Li","year":"2014","unstructured":"Li K, Fialho \u00c1, Kwong S, Zhang Q (2014) Adaptive operator selection with bandits for a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 18(1):114\u2013130. https:\/\/doi.org\/10.1109\/TEVC.2013.2239648","journal-title":"IEEE Trans Evol Comput"},{"key":"670_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/ACCESS.2020.2987078","volume":"PP","author":"C Li","year":"2020","unstructured":"Li C, Li J, Chen H (2020) A Meta-Heuristic-Based approach for Qos-Aware service composition. IEEE Access PP:1\u20131. https:\/\/doi.org\/10.1109\/ACCESS.2020.2987078","journal-title":"IEEE Access"},{"key":"670_CR29","doi-asserted-by":"publisher","first-page":"100843","DOI":"10.1016\/j.swevo.2021.100843","volume":"62","author":"G Li","year":"2021","unstructured":"Li G, Wang W, Zhang W, Wang Z, Tu H, You W (2021) Grid search based multi-population particle swarm optimization algorithm for multimodal multi-objective optimization. Swarm Evol Comput 62:100843. https:\/\/doi.org\/10.1016\/j.swevo.2021.100843","journal-title":"Swarm Evol Comput"},{"key":"670_CR30","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ins.2019.06.051","volume":"503","author":"H Liu","year":"2019","unstructured":"Liu H, Du W, Guo Z (2019) A multi-population evolutionary algorithm with single-objective guide for many-objective optimization. Inf Sci 503:39\u201360. https:\/\/doi.org\/10.1016\/j.ins.2019.06.051","journal-title":"Inf Sci"},{"issue":"4","key":"670_CR31","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1109\/TEVC.2018.2875430","volume":"23","author":"XF Liu","year":"2019","unstructured":"Liu XF, Zhan ZH, Gao Y, Zhang J, Kwong S, Zhang J (2019) Coevolutionary particle swarm optimization with bottleneck objective learning strategy for many-objective optimization. IEEE Trans Evol Comput 23(4):587\u2013602. https:\/\/doi.org\/10.1109\/TEVC.2018.2875430","journal-title":"IEEE Trans Evol Comput"},{"key":"670_CR32","doi-asserted-by":"crossref","unstructured":"Liu P, Hu Q, Jin K, Yu G, Tang Z (2021) Toward the energy-saving optimization of WLAN deployment in real 3-D environment: a hybrid swarm intelligent method. IEEE Syst J Early access:1\u201312","DOI":"10.1109\/JSYST.2021.3065434"},{"key":"670_CR33","doi-asserted-by":"publisher","first-page":"44372","DOI":"10.1109\/ACCESS.2019.2906121","volume":"7","author":"XW Luo","year":"2019","unstructured":"Luo XW, Wang ZJ, Guan RC, Zhan ZH, Gao Y (2019) A distributed multiple populations framework for evolutionary algorithm in solving dynamic optimization problems. IEEE Access 7:44372\u201344390. https:\/\/doi.org\/10.1109\/ACCESS.2019.2906121","journal-title":"IEEE Access"},{"key":"670_CR34","doi-asserted-by":"publisher","unstructured":"Manzoor A, Judge MA, Almogren A, Akhunzada A, Fattah S, Gani A, Zareei M (2020) A priori multiobjective self-adaptive multi-population based jaya algorithm to optimize ders operations and electrical tasks. IEEE Access 8:181163\u2013181175. https:\/\/doi.org\/10.1109\/ACCESS.2020.3028274","DOI":"10.1109\/ACCESS.2020.3028274"},{"issue":"6","key":"670_CR35","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1109\/TSMC.2016.2631479","volume":"48","author":"YR Naidu","year":"2018","unstructured":"Naidu YR, Ojha AK (2018) Solving multiobjective optimization problems using hybrid cooperative invasive weed optimization with multiple populations. IEEE Trans Syst Man Cybernet Syst 48(6):821\u2013832. https:\/\/doi.org\/10.1109\/TSMC.2016.2631479","journal-title":"IEEE Trans Syst Man Cybernet Syst"},{"key":"670_CR36","doi-asserted-by":"publisher","unstructured":"Rakshit P, Chowdhury A, Konar A, Nagar AK (2020) Migration in multi-population differential evolution for many objective optimization. In: 2020 IEEE Congress on Evolutionary Computation (CEC), pp 1\u20138, https:\/\/doi.org\/10.1109\/CEC48606.2020.9185596","DOI":"10.1109\/CEC48606.2020.9185596"},{"key":"670_CR37","doi-asserted-by":"publisher","first-page":"141674","DOI":"10.1109\/ACCESS.2020.3013568","volume":"8","author":"R Said","year":"2020","unstructured":"Said R, Bechikh S, Louati A, Aldaej A, Said LB (2020) Solving combinatorial multi-objective Bi-Level optimization problems using multiple populations and migration schemes. IEEE Access 8:141674\u2013141695. https:\/\/doi.org\/10.1109\/ACCESS.2020.3013568","journal-title":"IEEE Access"},{"key":"670_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.pnucene.2021.103830","author":"RH Stewart","year":"2021","unstructured":"Stewart RH, Palmer TS, DuPont B (2021) A survey of multi-objective optimization methods and their applications for nuclear scientists and engineers. Progress Nucl Energy. https:\/\/doi.org\/10.1016\/j.pnucene.2021.103830","journal-title":"Progress Nucl Energy"},{"key":"670_CR39","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, Jin Y (2017) PlatEMO: a MATLAB platform for evolutionary multi-objective optimization. IEEE Comput Intell Mag 12:73\u201387. https:\/\/doi.org\/10.1109\/MCI.2017.2742868","journal-title":"IEEE Comput Intell Mag"},{"key":"670_CR40","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.ins.2020.11.030","volume":"549","author":"MK Tomczyk","year":"2021","unstructured":"Tomczyk MK, Kadzi\u0144ski M (2021) Decomposition-based co-evolutionary algorithm for interactive multiple objective optimization. Inf Sci 549:178\u2013199. https:\/\/doi.org\/10.1016\/j.ins.2020.11.030","journal-title":"Inf Sci"},{"key":"670_CR41","doi-asserted-by":"publisher","unstructured":"Tripathi PK, Bandyopadhyay S, Pal SK (2007) Adaptive mufti-objective particle swarm optimization algorithm. In: 2007 IEEE congress on evolutionary computation, pp 2281\u20132288. https:\/\/doi.org\/10.1109\/CEC.2007.4424755","DOI":"10.1109\/CEC.2007.4424755"},{"issue":"3","key":"670_CR42","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/s40747-020-00159-y","volume":"6","author":"AN \u00dcnal","year":"2020","unstructured":"\u00dcnal AN, Kayakutlu G (2020) Multi-objective particle swarm optimization with random immigrants. Complex Intell Syst 6(3):635\u2013650. https:\/\/doi.org\/10.1007\/s40747-020-00159-y","journal-title":"Complex Intell Syst"},{"issue":"4","key":"670_CR43","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1109\/TEVC.2012.2204264","volume":"17","author":"R Wang","year":"2013","unstructured":"Wang R, Purshouse RC, Fleming PJ (2013) Preference-inspired coevolutionary algorithms for many-objective optimization. IEEE Trans Evol Comput 17(4):474\u2013494. https:\/\/doi.org\/10.1109\/TEVC.2012.2204264","journal-title":"IEEE Trans Evol Comput"},{"key":"670_CR44","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2021.3071786","author":"C Wang","year":"2021","unstructured":"Wang C, Wang Z, Tian Y, Zhang X, Xiao J (2021) A dual-population based evolutionary algorithm for multi-objective location problem under uncertainty of facilities. IEEE Trans Intell Transp Syst. https:\/\/doi.org\/10.1109\/TITS.2021.3071786","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"1","key":"670_CR45","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D Wolpert","year":"1997","unstructured":"Wolpert D, Macready W (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67\u201382. https:\/\/doi.org\/10.1109\/4235.585893","journal-title":"IEEE Trans Evol Comput"},{"key":"670_CR46","doi-asserted-by":"crossref","unstructured":"Xingyi, Zhang, Xiutao, Zheng, Ran, Cheng, Jianfeng, Qiu, Yaochu, Jin (2018) A competitive mechanism based multi-objective particle swarm optimizer with fast convergence. Inf Sci Int J","DOI":"10.1016\/j.ins.2017.10.037"},{"issue":"4","key":"670_CR47","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1109\/TEVC.2015.2504420","volume":"20","author":"B Xue","year":"2016","unstructured":"Xue B, Zhang M, Browne WN, Yao X (2016) A survey on evolutionary computation approaches to feature selection. IEEE Trans Evol Comput 20(4):606\u2013626. https:\/\/doi.org\/10.1109\/TEVC.2015.2504420","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"670_CR48","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1109\/TEVC.2018.2884133","volume":"23","author":"J Yi","year":"2019","unstructured":"Yi J, Bai J, He H, Peng J, Tang D (2019) ar-MOEA: a novel preference-based dominance relation for evolutionary multiobjective optimization. IEEE Trans Evol Comput 23(5):788\u2013802. https:\/\/doi.org\/10.1109\/TEVC.2018.2884133","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"670_CR49","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TEVC.2020.2999100","volume":"25","author":"J Yuan","year":"2021","unstructured":"Yuan J, Liu HL, Gu F, Zhang Q, He Z (2021) Investigating the properties of indicators and an evolutionary many-objective algorithm using promising regions. IEEE Trans Evol Comput 25(1):75\u201386. https:\/\/doi.org\/10.1109\/TEVC.2020.2999100","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"670_CR50","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1109\/TSMCB.2012.2209115","volume":"43","author":"ZH Zhan","year":"2013","unstructured":"Zhan ZH, Li J, Cao J, Zhang J, Chung HSH, Shi YH (2013) Multiple populations for multiple objectives: a coevolutionary technique for solving multiobjective optimization problems. IEEE Trans Cybernet 43(2):445\u2013463. https:\/\/doi.org\/10.1109\/TSMCB.2012.2209115","journal-title":"IEEE Trans Cybernet"},{"issue":"6","key":"670_CR51","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. https:\/\/doi.org\/10.1109\/TEVC.2007.892759","journal-title":"IEEE Trans Evol Comput"},{"key":"670_CR52","doi-asserted-by":"publisher","unstructured":"Zhang Q, Liu W, Li H (2009) The performance of a new version of MOEA\/D on CEC09 unconstrained mop test instances. In: 2009 IEEE congress on evolutionary computation, pp 203\u2013208. https:\/\/doi.org\/10.1109\/CEC.2009.4982949","DOI":"10.1109\/CEC.2009.4982949"},{"issue":"5","key":"670_CR53","doi-asserted-by":"publisher","first-page":"1052","DOI":"10.1109\/TFUZZ.2018.2872125","volume":"27","author":"L Zhang","year":"2019","unstructured":"Zhang L, Wang S, Zhang K, Zhang X, Sun Z, Zhang H, Chipecane MT, Yao J (2019) Cooperative artificial bee colony algorithm with multiple populations for interval multiobjective optimization problems. IEEE Trans Fuzzy Syst 27(5):1052\u20131065. https:\/\/doi.org\/10.1109\/TFUZZ.2018.2872125","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"670_CR54","doi-asserted-by":"publisher","unstructured":"Zhang K, Liu F, Shen C, Xu Z (2021) Multi-population evolutionary algorithm for multimodal multobjective optimization. In: 2021 4th international conference on intelligent autonomous systems (ICoIAS), pp 199\u2013204. https:\/\/doi.org\/10.1109\/ICoIAS53694.2021.00043","DOI":"10.1109\/ICoIAS53694.2021.00043"},{"key":"670_CR55","doi-asserted-by":"publisher","unstructured":"Zheng Z, Liu HL, Chen L (2016) An evolutionary many-objective optimization algorithm based on population decomposition and reference distance. In: 2016 Sixth international conference on information science and technology (ICIST), pp 388\u2013393. https:\/\/doi.org\/10.1109\/ICIST.2016.7483444","DOI":"10.1109\/ICIST.2016.7483444"},{"key":"670_CR56","doi-asserted-by":"crossref","unstructured":"Zitzler E, Deb K, Thiele L (1999) Comparison of multiobjective evolutionary algorithms: empirical results (revised version)","DOI":"10.1162\/106365600568202"},{"key":"670_CR57","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength pareto evolutionary algorithm. TIK-Report 103"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00670-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-022-00670-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00670-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T10:29:35Z","timestamp":1659522575000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-022-00670-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,20]]},"references-count":57,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["670"],"URL":"https:\/\/doi.org\/10.1007\/s40747-022-00670-4","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,20]]},"assertion":[{"value":"22 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there are no conflicts of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The CMPMO-HHO implementation is available at: .","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}},{"value":"The authors declare that there is no ethics involved in this experiment.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Written informed consent for publication was obtained from all participants.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"The study received approval from all participants.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}