{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T18:46:22Z","timestamp":1772131582883,"version":"3.50.1"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T00:00:00Z","timestamp":1645488000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T00:00:00Z","timestamp":1645488000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100012165","name":"key technologies research and development program","doi-asserted-by":"publisher","award":["2019YFB2102102"],"award-info":[{"award-number":["2019YFB2102102"]}],"id":[{"id":"10.13039\/501100012165","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":[[2023,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Evolutionary multi-objective multi-task optimization is an emerging paradigm for solving multi-objective multi-task optimization problem (MO-MTOP) using evolutionary computation. However, most existing methods tend to directly treat the multiple multi-objective tasks as different problems and optimize them by different populations, which face the difficulty in designing good knowledge transferring strategy among the tasks\/populations. Different from existing methods that suffer from the difficult knowledge transfer, this paper proposes to treat the MO-MTOP as a multi-objective multi-criteria optimization problem (MO-MCOP), so that the knowledge of all the tasks can be inherited in a same population to be fully utilized for solving the MO-MTOP more efficiently. To be specific, the fitness evaluation function of each task in the MO-MTOP is treated as an evaluation criterion in the corresponding MO-MCOP, and therefore, the MO-MCOP has multiple relevant evaluation criteria to help the individual selection and evolution in different evolutionary stages. Furthermore, a probability-based criterion selection strategy and an adaptive parameter learning method are also proposed to better select the fitness evaluation function as the criterion. By doing so, the algorithm can use suitable evaluation criteria from different tasks at different evolutionary stages to guide the individual selection and population evolution, so as to find out the Pareto optimal solutions of all tasks. By integrating the above, this paper develops a multi-objective multi-criteria evolutionary algorithm framework for solving MO-MTOP. To investigate the proposed algorithm, extensive experiments are conducted on widely used MO-MTOPs to compare with some state-of-the-art and well-performing algorithms, which have verified the great effectiveness and efficiency of the proposed algorithm. Therefore, treating MO-MTOP as MO-MCOP is a potential and promising direction for solving MO-MTOP.<\/jats:p>","DOI":"10.1007\/s40747-022-00650-8","type":"journal-article","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T06:03:51Z","timestamp":1645509831000},"page":"1211-1228","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Multi-objective multi-criteria evolutionary algorithm for multi-objective multi-task optimization"],"prefix":"10.1007","volume":"9","author":[{"given":"Ke-Jing","family":"Du","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6143-9207","authenticated-orcid":false,"given":"Jian-Yu","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hua","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,22]]},"reference":[{"issue":"1","key":"650_CR1","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MCI.2020.3039066","volume":"16","author":"KC Tan","year":"2021","unstructured":"Tan KC, Feng L, Jiang M (2021) Evolutionary transfer optimization\u2014a new frontier in evolutionary computation research. IEEE Comput Intell Mag 16(1):22\u201333. https:\/\/doi.org\/10.1109\/MCI.2020.3039066","journal-title":"IEEE Comput Intell Mag"},{"issue":"5","key":"650_CR2","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1109\/TETCI.2019.2928344","volume":"3","author":"YS Ong","year":"2019","unstructured":"Ong YS, Gupta A (2019) AIR5: five pillars of artificial intelligence research. IEEE Trans Emerg Top Comput Intell 3(5):411\u2013415. https:\/\/doi.org\/10.1109\/TETCI.2019.2928344","journal-title":"IEEE Trans Emerg Top Comput Intell"},{"issue":"7","key":"650_CR3","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1109\/TCYB.2016.2554622","volume":"47","author":"A Gupta","year":"2017","unstructured":"Gupta A, Ong YS, Feng L, Tan KC (2017) Multiobjective multifactorial optimization in evolutionary multitasking. IEEE Trans Cybern 47(7):1652\u20131665. https:\/\/doi.org\/10.1109\/TCYB.2016.2554622","journal-title":"IEEE Trans Cybern"},{"issue":"3","key":"650_CR4","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1109\/TEVC.2015.2458037","volume":"20","author":"A Gupta","year":"2016","unstructured":"Gupta A, Ong YS, Feng L (2016) Multifactorial evolution: toward evolutionary multitasking. IEEE Trans Evol Comput 20(3):343\u2013357. https:\/\/doi.org\/10.1109\/TEVC.2015.2458037","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"650_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/TETCI.2017.2769104","volume":"2","author":"A Gupta","year":"2017","unstructured":"Gupta A, Ong YS, Feng L (2017) Insights on transfer optimization: because experience is the best teacher. IEEE Trans Emerg Top Comput Intell 2(1):51\u201364. https:\/\/doi.org\/10.1109\/TETCI.2017.2769104","journal-title":"IEEE Trans Emerg Top Comput Intell"},{"issue":"2","key":"650_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s12559-016-9395-7","volume":"8","author":"YS Ong","year":"2016","unstructured":"Ong YS, Gupta A (2016) Evolutionary multitasking: a computer science view of cognitive multitasking. Cogn Comput 8(2):125\u2013142. https:\/\/doi.org\/10.1007\/s12559-016-9395-7","journal-title":"Cogn Comput"},{"key":"650_CR7","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1016\/j.ins.2019.10.066","volume":"512","author":"G Li","year":"2020","unstructured":"Li G, Lin Q, Gao W (2020) Multifactorial optimization via explicit multipopulation evolutionary framework. Inf Sci 512:1555\u20131570. https:\/\/doi.org\/10.1016\/j.ins.2019.10.066","journal-title":"Inf Sci"},{"issue":"6","key":"650_CR8","doi-asserted-by":"publisher","first-page":"3171","DOI":"10.1109\/TCYB.2019.2955599","volume":"51","author":"L Feng","year":"2019","unstructured":"Feng L, Zhou L, Gupta A, Zhong J, Qin K (2019) Solving generalized vehicle routing problem with occasional drivers via evolutionary multitasking. IEEE Trans Cybern 51(6):3171\u20133184. https:\/\/doi.org\/10.1109\/TCYB.2019.2955599","journal-title":"IEEE Trans Cybern"},{"key":"650_CR9","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2020.3018903","author":"L Feng","year":"2020","unstructured":"Feng L et al (2020) Towards faster vehicle routing by transferring knowledge from customer representation. IEEE Trans Intell Transp Syst. https:\/\/doi.org\/10.1109\/TITS.2020.3018903","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"1","key":"650_CR10","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/MCI.2020.3039067","volume":"16","author":"H Wang","year":"2020","unstructured":"Wang H, Feng L, Jin Y, Doherty J (2020) Surrogate-assisted evolutionary multitasking for expensive minimax optimization in multiple scenarios. IEEE Comput Intell Mag 16(1):34\u201348. https:\/\/doi.org\/10.1109\/MCI.2020.3039067","journal-title":"IEEE Comput Intell Mag"},{"issue":"1","key":"650_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s11633-022-1317-4","volume":"19","author":"JY Li","year":"2022","unstructured":"Li JY, Zhan ZH, Zhang J (2022) Evolutionary computation for expensive optimization: a survey. Mach Intell Res 19(1):3\u201323. https:\/\/doi.org\/10.1007\/s11633-022-1317-4","journal-title":"Mach Intell Res"},{"key":"650_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.engappai.2017.05.008","volume":"64","author":"MY Cheng","year":"2017","unstructured":"Cheng MY, Gupta A, Ong YS, Ni ZW (2017) Coevolutionary multitasking for concurrent global optimization: With case studies in complex engineering design. Eng Appl Artif Intell 64:13\u201324. https:\/\/doi.org\/10.1016\/j.engappai.2017.05.008","journal-title":"Eng Appl Artif Intell"},{"issue":"4","key":"650_CR13","doi-asserted-by":"publisher","first-page":"1784","DOI":"10.1109\/TCYB.2020.2981733","volume":"51","author":"KK Bali","year":"2021","unstructured":"Bali KK, Gupta A, Ong YS, Tan PS (2021) Cognizant multitasking in multiobjective multifactorial evolution: MO-MFEA-II. IEEE Trans Cybern 51(4):1784\u20131796. https:\/\/doi.org\/10.1109\/TCYB.2020.2981733","journal-title":"IEEE Trans Cybern"},{"key":"650_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-021-10042-y","author":"ZH Zhan","year":"2021","unstructured":"Zhan ZH, Shi L, Tan KC, Zhang J (2021) A survey on evolutionary computation for complex continuous optimization. Artif Intell Rev. https:\/\/doi.org\/10.1007\/s10462-021-10042-y","journal-title":"Artif Intell Rev"},{"key":"650_CR15","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2020.3047410","author":"ZH Zhan","year":"2021","unstructured":"Zhan ZH et al (2021) Matrix-based evolutionary computation. IEEE Trans Emerg Top Comput Intell. https:\/\/doi.org\/10.1109\/TETCI.2020.3047410","journal-title":"IEEE Trans Emerg Top Comput Intell"},{"key":"650_CR16","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3131236","author":"JY Li","year":"2021","unstructured":"Li JY, Zhan ZH, Tan KC, Zhang J (2021) A meta-knowledge transfer-based differential evolution for multitask optimization. IEEE Trans Evol Comput. https:\/\/doi.org\/10.1109\/TEVC.2021.3131236","journal-title":"IEEE Trans Evol Comput"},{"key":"650_CR17","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3106399","author":"JY Li","year":"2021","unstructured":"Li JY, Zhan ZH, Xu J, Kwong S, Zhang J (2021) Surrogate-assisted hybrid-model estimation of distribution algorithm for mixed-variable hyperparameters optimization in convolutional neural networks. IEEE Trans Neural Netw Learn Syst. https:\/\/doi.org\/10.1109\/TNNLS.2021.3106399","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"5","key":"650_CR18","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1109\/TEVC.2020.2975381","volume":"24","author":"J Yi","year":"2020","unstructured":"Yi J, Bai J, He H, Zhou W, Yao L (2020) A multifactorial evolutionary algorithm for multitasking under interval uncertainties. IEEE Trans Evol Comput 24(5):908\u2013922. https:\/\/doi.org\/10.1109\/TEVC.2020.2975381","journal-title":"IEEE Trans Evol Comput"},{"issue":"8","key":"650_CR19","doi-asserted-by":"publisher","first-page":"3925","DOI":"10.1109\/tcyb.2020.3008280","volume":"51","author":"JY Li","year":"2021","unstructured":"Li JY, Zhan ZH, Wang H, Zhang J (2021) Data-driven evolutionary algorithm with perturbation-based ensemble surrogates. IEEE Trans Cybern 51(8):3925\u20133937. https:\/\/doi.org\/10.1109\/tcyb.2020.3008280","journal-title":"IEEE Trans Cybern"},{"issue":"5","key":"650_CR20","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1109\/TEVC.2020.2979740","volume":"24","author":"JY Li","year":"2020","unstructured":"Li JY, Zhan ZH, Wang C, Jin H, Zhang J (2020) Boosting data-driven evolutionary algorithm with localized data generation. IEEE Trans Evol Comput 24(5):923\u2013937. https:\/\/doi.org\/10.1109\/TEVC.2020.2979740","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"650_CR21","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/TEVC.2016.2631279","volume":"22","author":"Q Lin","year":"2018","unstructured":"Lin Q et al (2018) Particle swarm optimization with a balanceable fitness estimation for many-objective optimization problems. IEEE Trans Evol Comput 22(1):32\u201346. https:\/\/doi.org\/10.1109\/TEVC.2016.2631279","journal-title":"IEEE Trans Evol Comput"},{"issue":"10","key":"650_CR22","doi-asserted-by":"publisher","first-page":"4454","DOI":"10.1109\/TCYB.2019.2937565","volume":"50","author":"X Zhang","year":"2020","unstructured":"Zhang X, Du KJ, Zhan ZH, Kwong S, Gu TL, Zhang J (2020) Cooperative co-evolutionary bare-bones particle swarm optimization with function independent decomposition for large-scale supply chain network design with uncertainties. IEEE Trans Cybern 50(10):4454\u20134468. https:\/\/doi.org\/10.1109\/TCYB.2019.2937565","journal-title":"IEEE Trans Cybern"},{"issue":"10","key":"650_CR23","doi-asserted-by":"publisher","first-page":"4848","DOI":"10.1109\/TCYB.2020.3028070","volume":"51","author":"JY Li","year":"2021","unstructured":"Li JY, Zhan ZH, Liu RD, Wang C, Kwong S, Zhang J (2021) Generation-level parallelism for evolutionary computation: a pipeline-based parallel particle swarm optimization. IEEE Trans Cybern 51(10):4848\u20134859","journal-title":"IEEE Trans Cybern"},{"key":"650_CR24","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3060811","author":"J Sun","year":"2021","unstructured":"Sun J, Liu X, B\u00e4ck T, Xu Z (2021) Learning adaptive differential evolution algorithm from optimization experiences by policy gradient. IEEE Trans Evol Comput. https:\/\/doi.org\/10.1109\/TEVC.2021.3060811","journal-title":"IEEE Trans Evol Comput"},{"issue":"11","key":"650_CR25","doi-asserted-by":"publisher","first-page":"4633","DOI":"10.1109\/TCYB.2019.2944873","volume":"50","author":"ZH Zhan","year":"2020","unstructured":"Zhan ZH, Wang ZJ, Jin H, Zhang J (2020) Adaptive distributed differential evolution. IEEE Trans Cybern 50(11):4633\u20134647. https:\/\/doi.org\/10.1109\/TCYB.2019.2944873","journal-title":"IEEE Trans Cybern"},{"key":"650_CR26","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3075205","author":"XF Liu","year":"2021","unstructured":"Liu XF, Zhan ZH, Zhang J (2021) Resource-aware distributed differential evolution for training expensive neural-network-based controller in power electronic circuit. IEEE Trans Neural Netw Learn Syst. https:\/\/doi.org\/10.1109\/TNNLS.2021.3075205","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"1","key":"650_CR27","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1109\/TEVC.2020.3009390","volume":"25","author":"M Yang","year":"2021","unstructured":"Yang M, Zhou A, Li C, Yao X (2021) An efficient recursive differential grouping for large-scale continuous problems. IEEE Trans Evol Comput 25(1):159\u2013171. https:\/\/doi.org\/10.1109\/TEVC.2020.3009390","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"650_CR28","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1109\/TEVC.2019.2932624","volume":"24","author":"F Wang","year":"2019","unstructured":"Wang F, Li Y, Zhou A, Tang K (2019) An estimation of distribution algorithm for mixed-variable newsvendor problems. IEEE Trans Evol Comput 24(3):479\u2013493. https:\/\/doi.org\/10.1109\/TEVC.2019.2932624","journal-title":"IEEE Trans Evol Comput"},{"key":"650_CR29","doi-asserted-by":"publisher","first-page":"5433","DOI":"10.1109\/TCYB.2020.2977858","volume":"51","author":"ZG Chen","year":"2021","unstructured":"Chen ZG, Lin Y, Gong YJ et al (2021) Maximizing lifetime of range-adjustable wireless sensor networks: a neighborhood-based estimation of distribution algorithm. IEEE Trans Cybern 51:5433\u20135444. https:\/\/doi.org\/10.1109\/TCYB.2020.2977858","journal-title":"IEEE Trans Cybern"},{"issue":"5","key":"650_CR30","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/TEVC.2018.2794319","volume":"22","author":"Y Sun","year":"2018","unstructured":"Sun Y, Yen GG, Yi Z (2018) Improved regularity model-based eda for many-objective optimization. IEEE Trans Evol Comput 22(5):662\u2013678. https:\/\/doi.org\/10.1109\/TEVC.2018.2794319","journal-title":"IEEE Trans Evol Comput"},{"key":"650_CR31","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3097339","author":"X Zhang","year":"2021","unstructured":"Zhang X, Zhan ZH, Fang W, Qian P, Zhang J (2021) Multi population ant colony system with knowledge based local searches for multiobjective supply chain configuration. IEEE Trans Evol Comput. https:\/\/doi.org\/10.1109\/TEVC.2021.3097339","journal-title":"IEEE Trans Evol Comput"},{"key":"650_CR32","doi-asserted-by":"publisher","first-page":"6784","DOI":"10.1109\/tits.2020.2994779","volume":"22","author":"S-Z Zhou","year":"2020","unstructured":"Zhou S-Z, Zhan Z-H, Chen Z-G et al (2020) A multi-objective ant colony system algorithm for airline crew rostering problem with fairness and satisfaction. IEEE Trans Intell Transp Syst 22:6784\u20136798. https:\/\/doi.org\/10.1109\/tits.2020.2994779","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"11","key":"650_CR33","doi-asserted-by":"publisher","first-page":"4784","DOI":"10.1109\/TITS.2019.2946711","volume":"21","author":"D Liang","year":"2020","unstructured":"Liang D, Zhan ZH, Zhang Y, Zhang J (2020) An efficient ant colony system approach for new energy vehicle dispatch problem. IEEE Trans Intell Transp Syst 21(11):4784\u20134797. https:\/\/doi.org\/10.1109\/TITS.2019.2946711","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"3","key":"650_CR34","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1109\/TEVC.2021.3056514","volume":"25","author":"L Zhou","year":"2021","unstructured":"Zhou L, Feng L, Gupta A, Ong YS (2021) Learnable evolutionary search across heterogeneous problems via kernelized autoencoding. IEEE Trans Evol Comput 25(3):567\u2013581. https:\/\/doi.org\/10.1109\/TEVC.2021.3056514","journal-title":"IEEE Trans Evol Comput"},{"key":"650_CR35","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.3017017","author":"L Feng","year":"2020","unstructured":"Feng L, Zhou W, Liu W, Ong YS, Tan KC (2020) Solving dynamic multiobjective problem via autoencoding evolutionary search. IEEE Trans Cybern. https:\/\/doi.org\/10.1109\/TCYB.2020.3017017","journal-title":"IEEE Trans Cybern"},{"key":"650_CR36","doi-asserted-by":"publisher","unstructured":"Zheng Y, Zhu Z, Qi Y, Wang L, Ma X (2020) Multi-objective multifactorial evolutionary algorithm enhanced with the weighting helper-task. In: 2nd Int. Conf. Ind. Artif. Intell. IAI. https:\/\/doi.org\/10.1109\/IAI50351.2020.9262200.","DOI":"10.1109\/IAI50351.2020.9262200"},{"key":"650_CR37","doi-asserted-by":"publisher","unstructured":"Yang C, Ding J, Tan KC, Jin Y (2017) Two-stage assortative mating for multi-objective multifactorial evolutionary optimization. In: 2017 IEEE 56th annu. conf. decis. control.https:\/\/doi.org\/10.1109\/CDC.2017.8263646","DOI":"10.1109\/CDC.2017.8263646"},{"key":"650_CR38","doi-asserted-by":"publisher","unstructured":"Binh HTT, Tuan NQ, Long DCT (2019) A multi-objective multi-factorial evolutionary algorithm with reference-point-based approach. In: Proc. IEEE Congr. Evol. Comput. https:\/\/doi.org\/10.1109\/CEC.2019.8790034","DOI":"10.1109\/CEC.2019.8790034"},{"issue":"5","key":"650_CR39","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TEVC.2019.2962747","volume":"24","author":"J Lin","year":"2019","unstructured":"Lin J, Liu HL, Xue B, Zhang M, Gu F (2019) Multiobjective multi-tasking optimization based on incremental learning. IEEE Trans Evol Comput 24(5):824\u2013838. https:\/\/doi.org\/10.1109\/TEVC.2019.2962747","journal-title":"IEEE Trans Evol Comput"},{"key":"650_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.07.015","author":"Z Liang","year":"2019","unstructured":"Liang Z, Zhang J, Feng L, Zhu Z (2019) A hybrid of genetic transform and hyper-rectangle search strategies for evolutionary multi-tasking. Expert Syst Appl. https:\/\/doi.org\/10.1016\/j.eswa.2019.07.015","journal-title":"Expert Syst Appl"},{"issue":"9","key":"650_CR41","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1109\/TCYB.2018.2845361","volume":"49","author":"L Feng","year":"2019","unstructured":"Feng L, Zhou L, Zhong JH et al (2019) Evolutionary multitasking via explicit autoencoding. IEEE Trans Cybern 49(9):3457\u20133470. https:\/\/doi.org\/10.1109\/TCYB.2018.2845361","journal-title":"IEEE Trans Cybern"},{"key":"650_CR42","doi-asserted-by":"publisher","unstructured":"Li JY, Du KJ, Zhan ZH, Wang H, Zhang J (2021) Multi-criteria differential evolution: treating multitask optimization as multi-criteria optimization. In: Proc. genet. evol. comput. conf. https:\/\/doi.org\/10.1145\/3449726.3459456.","DOI":"10.1145\/3449726.3459456"},{"issue":"2","key":"650_CR43","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 HS, Shi Y (2013) Multiple populations for multiple objectives: a coevolutionary technique for solving multiobjective optimization problems. IEEE Trans Cybern 43(2):445\u2013463. https:\/\/doi.org\/10.1109\/TSMCB.2012.2209115","journal-title":"IEEE Trans Cybern"},{"issue":"2","key":"650_CR44","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"},{"issue":"6","key":"650_CR45","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1109\/TEVC.2017.2758360","volume":"22","author":"H Wang","year":"2018","unstructured":"Wang H, Jin Y, Doherty J (2018) A generic test suite for evolutionary multifidelity optimization. IEEE Trans Evol Comput 22(6):836\u2013850. https:\/\/doi.org\/10.1109\/TEVC.2017.2758360","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"650_CR46","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1109\/TEVC.2021.3051608","volume":"25","author":"SH Wu","year":"2021","unstructured":"Wu SH, Zhan ZH, Zhang J (2021) SAFE: scale-adaptive fitness evaluation method for expensive optimization problems. IEEE Trans Evol Comput 25(3):478\u2013491. https:\/\/doi.org\/10.1109\/TEVC.2021.3051608","journal-title":"IEEE Trans Evol Comput"},{"key":"650_CR47","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-5956-9","volume-title":"Evolutionary learning: advances in theories and algorithms","author":"ZH Zhou","year":"2019","unstructured":"Zhou ZH, Yang Y, Chao Q (2019) Evolutionary learning: advances in theories and algorithms. Springer, Singapore"},{"issue":"2","key":"650_CR48","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1109\/TEVC.2019.2921547","volume":"24","author":"H Huang","year":"2020","unstructured":"Huang H, Su J, Zhang Y, Hao Z (2020) An experimental method to estimate running time of evolutionary algorithms for continuous optimization. IEEE Trans Evol Comput 24(2):275\u2013289. https:\/\/doi.org\/10.1109\/TEVC.2019.2921547","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"650_CR49","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TEVC.2020.3008822","volume":"25","author":"Q Lin","year":"2020","unstructured":"Lin Q, Lin W, Zhu Z, Gong M, Li J, Coello CAC (2020) Multimodal multiobjective evolutionary optimization with dual clustering in decision and objective spaces. IEEE Trans Evol Comput 25(1):130\u2013144. https:\/\/doi.org\/10.1109\/TEVC.2020.3008822","journal-title":"IEEE Trans Evol Comput"},{"key":"650_CR50","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.3008697","author":"S Liu","year":"2020","unstructured":"Liu S, Lin Q, Tan KC, Gong M, Coello CAC (2020) A fuzzy decomposition-based multi\/many-objective evolutionary algorithm. IEEE Trans Cybern. https:\/\/doi.org\/10.1109\/TCYB.2020.3008697","journal-title":"IEEE Trans Cybern"},{"key":"650_CR51","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2971638","author":"S Liu","year":"2020","unstructured":"Liu S, Lin Q, Wong KC et al (2020) A self-guided reference vector strategy for many-objective optimization. IEEE Trans Cybern. https:\/\/doi.org\/10.1109\/TCYB.2020.2971638","journal-title":"IEEE Trans Cybern."},{"issue":"4","key":"650_CR52","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evol Comput"},{"key":"650_CR53","unstructured":"Yuan Y, Ong YS, Feng L et al (2017) Evolutionary multitasking for multi-objective continuous optimization: benchmark problems, performance metrics and baseline results. In: Technical Report. DIALOG. https:\/\/arxiv.org\/abs\/1706.02766"},{"key":"650_CR54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-74640-7","volume-title":"Data-driven evolutionary optimization","author":"Y Jin","year":"2021","unstructured":"Jin Y, Wang H, Sun C (2021) Data-driven evolutionary optimization. Springer, Cham"},{"issue":"3","key":"650_CR55","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1109\/TEVC.2018.2869247","volume":"23","author":"J Tian","year":"2019","unstructured":"Tian J, Tan Y, Zeng J, Sun C, Jin Y (2019) Multiobjective infill criterion driven gaussian process-assisted particle swarm optimization of high-dimensional expensive problems. IEEE Trans Evol Comput 23(3):459\u2013472. https:\/\/doi.org\/10.1109\/TEVC.2018.2869247","journal-title":"IEEE Trans Evol Comput"},{"key":"650_CR56","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3103936","author":"Q Lin","year":"2021","unstructured":"Lin Q, Wu X, Ma L, Li J, Gong M, Coello CAC (2021) An ensemble surrogate-based framework for expensive multiobjective evolutionary optimization. IEEE Trans Evol Comput. https:\/\/doi.org\/10.1109\/TEVC.2021.3103936","journal-title":"IEEE Trans Evol Comput"},{"key":"650_CR57","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3073648","author":"Z Song","year":"2021","unstructured":"Song Z, Wang H, He C, Jin Y (2021) A Kriging-assisted two-archive evolutionary algorithm for expensive many-objective optimization. IEEE Trans Evol Comput. https:\/\/doi.org\/10.1109\/TEVC.2021.3073648","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"650_CR58","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/MCI.2020.3039067","volume":"16","author":"H Wang","year":"2021","unstructured":"Wang H, Feng L, Jin Y, Doherty J (2021) Surrogate-assisted evolutionary multitasking for expensive minimax optimization in multiple scenarios. IEEE Comput Intell Mag 16(1):34\u201348. https:\/\/doi.org\/10.1109\/MCI.2020.3039067","journal-title":"IEEE Comput Intell Mag"},{"issue":"1","key":"650_CR59","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TEVC.2020.3008822","volume":"25","author":"Q Lin","year":"2021","unstructured":"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\u2013144. https:\/\/doi.org\/10.1109\/TEVC.2020.3008822","journal-title":"IEEE Trans Evol Comput"},{"key":"650_CR60","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3098186","author":"S Liu","year":"2021","unstructured":"Liu S, Lin Q, Tian Y, Tan KC (2021) A variable importance-based differential evolution for large-scale multiobjective optimization. IEEE Trans Cybern. https:\/\/doi.org\/10.1109\/TCYB.2021.3098186","journal-title":"IEEE Trans Cybern"},{"issue":"3","key":"650_CR61","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1109\/TCYB.2020.2977956","volume":"51","author":"ZJ Wang","year":"2021","unstructured":"Wang ZJ, Zhan ZH, Kwong S, Jin H, Zhang J (2021) Adaptive granularity learning distributed particle swarm optimization for large-scale optimization. IEEE Trans Cybern 51(3):1175\u20131188. https:\/\/doi.org\/10.1109\/TCYB.2020.2977956","journal-title":"IEEE Trans Cybern"},{"key":"650_CR62","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2021.3082200","author":"SC Liu","year":"2021","unstructured":"Liu SC, Zhan ZH, Tan KC, Zhang J (2021) A multiobjective framework for many-objective optimization. IEEE Trans Cybern. https:\/\/doi.org\/10.1109\/tcyb.2021.3082200","journal-title":"IEEE Trans Cybern"},{"issue":"4","key":"650_CR63","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"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00650-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-022-00650-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00650-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T09:18:55Z","timestamp":1681809535000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-022-00650-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,22]]},"references-count":63,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["650"],"URL":"https:\/\/doi.org\/10.1007\/s40747-022-00650-8","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,22]]},"assertion":[{"value":"13 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}