{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T21:06:57Z","timestamp":1761599217687,"version":"3.37.3"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,4,21]],"date-time":"2021-04-21T00:00:00Z","timestamp":1618963200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,21]],"date-time":"2021-04-21T00:00:00Z","timestamp":1618963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61525302,61590922"],"award-info":[{"award-number":["61525302,61590922"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006579","name":"Ministry of Industry and Information Technology of the People's Republic of China","doi-asserted-by":"publisher","award":["20171122-6"],"award-info":[{"award-number":["20171122-6"]}],"id":[{"id":"10.13039\/501100006579","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shenyang","award":["Y17-0-004"],"award-info":[{"award-number":["Y17-0-004"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["N160801001,N161608001"],"award-info":[{"award-number":["N160801001,N161608001"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s12293-021-00330-z","type":"journal-article","created":{"date-parts":[[2021,4,21]],"date-time":"2021-04-21T06:02:49Z","timestamp":1618984969000},"page":"413-432","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A decomposition-based evolutionary algorithm for scalable multi\/many-objective optimization"],"prefix":"10.1007","volume":"13","author":[{"given":"Jiaxin","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3735-0672","authenticated-orcid":false,"given":"Jinliang","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Kay Chen","family":"Tan","sequence":"additional","affiliation":[]},{"given":"Qingda","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,21]]},"reference":[{"issue":"3","key":"330_CR1","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1109\/TEVC.2012.2196800","volume":"17","author":"A Ponsich","year":"2012","unstructured":"Ponsich A, Jaimes AL, Coello CAC (2012) A survey on multiobjective evolutionary algorithms for the solution of the portfolio optimization problem and other finance and economics applications. IEEE Trans Evol Comput 17(3):321\u2013344","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"330_CR2","doi-asserted-by":"publisher","first-page":"246","DOI":"10.2307\/254267","volume":"51","author":"S Mardle","year":"1999","unstructured":"Mardle S, Miettinen K (1999) Nonlinear multiobjective optimization. J Oper Res Soc 51(2):246","journal-title":"J Oper Res Soc"},{"issue":"2","key":"330_CR3","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","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"330_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TEVC.2015.2395073","volume":"19","author":"R Cheng","year":"2015","unstructured":"Cheng R, Jin Y, Narukawa K, Sendhoff B (2015) A multiobjective evolutionary algorithm using gaussian process-based inverse modeling. IEEE Trans Evol Comput 19(6):1\u20131","journal-title":"IEEE Trans Evol Comput"},{"key":"330_CR5","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength Pareto evolutionary algorithm for multiobjective optimization. Evolutionary methods for design. In: Optimization and control with applications to industrial problems, Athens, pp 95\u2013100"},{"issue":"6","key":"330_CR6","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2008","unstructured":"Zhang Q, Li H (2008) 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":"330_CR7","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":"330_CR8","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"},{"issue":"4","key":"330_CR9","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"},{"issue":"2","key":"330_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler E, Thiele L, Laumanns M, Fonseca CM, da Fonseca VG (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans Evol Comput 7(2):117\u2013132","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"330_CR11","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1162\/EVCO_a_00135","volume":"23","author":"D Brockhoff","year":"2015","unstructured":"Brockhoff D, Wagner T, Trautmann H (2015) R2 indicator-based multiobjective search. Evol Comput 23(3):369\u2013395","journal-title":"Evol Comput"},{"key":"330_CR12","first-page":"82","volume":"1993","author":"T Murata","year":"2001","unstructured":"Murata T (2001) Specification of genetic search directions in cellular multi-objective genetic algorithm. Evol Multi Criter Opt EMO 1993:82\u201395","journal-title":"Evol Multi Criter Opt EMO"},{"issue":"6","key":"330_CR13","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1007\/s10732-015-9301-6","volume":"21","author":"H Sato","year":"2015","unstructured":"Sato H (2015) Analysis of inverted PBI and comparison with other scalarizing functions in decomposition based MOEAs. J Heuristics 21(6):819\u2013849","journal-title":"J Heuristics"},{"issue":"16","key":"330_CR14","doi-asserted-by":"publisher","first-page":"4677","DOI":"10.1007\/s00500-016-2076-3","volume":"21","author":"S Yang","year":"2017","unstructured":"Yang S, Jiang S, Jiang Y (2017) Improving the multiobjective evolutionary algorithm based on decomposition with new penalty schemes. Soft Comput 21(16):4677\u20134691","journal-title":"Soft Comput"},{"issue":"2","key":"330_CR15","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1109\/TEVC.2017.2704118","volume":"22","author":"X Ma","year":"2017","unstructured":"Ma X, Zhang Q, Yang J, Zhu Z (2017) On Tchebycheff decomposition approaches for multi-objective evolutionary optimization. IEEE Trans Evol Comput 22(2):226\u2013224","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"330_CR16","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1137\/S1052623496307510","volume":"8","author":"I Das","year":"1998","unstructured":"Das I, Dennis J (1998) Normal-boundary intersection: a new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM J Optim 8(3):631\u2013657","journal-title":"SIAM J Optim"},{"key":"330_CR17","doi-asserted-by":"crossref","unstructured":"Zhang Q, Li H, Maringer D, Tsang E (2010) MOEA\/D with NBI-style Tchebycheff approach for portfolio management. In: 2010 IEEE congress on evolutionary computation (CEC). IEEE, pp 1\u20138","DOI":"10.1109\/CEC.2010.5586185"},{"issue":"10","key":"330_CR18","doi-asserted-by":"publisher","first-page":"3839","DOI":"10.1007\/s10489-018-1183-5","volume":"48","author":"W Zheng","year":"2018","unstructured":"Zheng W, Tan Y, Meng L, Zhang H (2018) An improved MOEA\/D design for many-objective optimization problems. Appl Intell 48(10):3839\u20133861","journal-title":"Appl Intell"},{"key":"330_CR19","doi-asserted-by":"crossref","unstructured":"Ishibuchi H, Sakane Y, Tsukamoto N, Nojima Y (2009) Adaptation of scalarizing functions in MOEA\/D: an adaptive scalarizing function-based multiobjective evolutionary algorithm. In: International conference on evolutionary multi-criterion optimization. Springer, pp 1\u20138","DOI":"10.1007\/978-3-642-01020-0_35"},{"issue":"3","key":"330_CR20","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1109\/TEVC.2018.2865931","volume":"23","author":"M Wu","year":"2019","unstructured":"Wu M, Li K, Kwong S, Zhang Q, Zhang J (2019) Learning to decompose: a paradigm for decomposition-based multiobjective optimization. IEEE Trans Evol Comput 23(3):376\u2013390","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"330_CR21","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1109\/TEVC.2016.2521175","volume":"20","author":"R Wang","year":"2016","unstructured":"Wang R, Zhang Q, Zhang T (2016) Decomposition-based algorithms using Pareto adaptive scalarizing methods. IEEE Trans Evol Comput 20(6):821\u2013837","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"330_CR22","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1109\/TEVC.2013.2281533","volume":"18","author":"H Liu","year":"2014","unstructured":"Liu H, Gu F, Zhang Q (2014) Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems. IEEE Trans Evol Comput 18(3):450\u2013455","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"330_CR23","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1109\/JSEE.2015.00110","volume":"26","author":"Y Zhang","year":"2015","unstructured":"Zhang Y, Yang R, Zuo J, Jing X (2015) Enhancing MOEA\/D with uniform population initialization, weight vector design and adjustment using uniform design. J Syst Eng Elect 26(5):1010\u20131022","journal-title":"J Syst Eng Elect"},{"issue":"4","key":"330_CR24","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1109\/TEVC.2013.2281534","volume":"18","author":"H Jain","year":"2013","unstructured":"Jain H, Deb K (2013) 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","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"330_CR25","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1162\/EVCO_a_00109","volume":"22","author":"Y Qi","year":"2014","unstructured":"Qi Y, Ma X, Liu F, Jiao L, Sun J, Wu J (2014) MOEA\/D with adaptive weight adjustment. Evol Comput 22(2):231","journal-title":"Evol Comput"},{"issue":"12","key":"330_CR26","doi-asserted-by":"publisher","first-page":"4999","DOI":"10.1007\/s00500-015-1789-z","volume":"20","author":"X Ma","year":"2016","unstructured":"Ma X, Liu F, Qi Y, Li L, Jiao L, Deng X, Wu J (2016) MOEA\/D with biased weight adjustment inspired by user preference and its application on multi-objective reservoir flood control problem. Soft Comput 20(12):4999\u20135023","journal-title":"Soft Comput"},{"key":"330_CR27","doi-asserted-by":"crossref","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 (CEC). IEEE, pp 203\u2013208","DOI":"10.1109\/CEC.2009.4982949"},{"issue":"12","key":"330_CR28","doi-asserted-by":"publisher","first-page":"2416","DOI":"10.1109\/TSMC.2018.2818175","volume":"49","author":"Q Kang","year":"2018","unstructured":"Kang Q, Song X, Zhou M (2018) A collaborative resource allocation strategy for decomposition-based multiobjective evolutionary algorithms. IEEE Trans Syst Man Cybern Syst 49(12):2416\u20132423","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"1","key":"330_CR29","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/TEVC.2015.2424251","volume":"20","author":"A Zhou","year":"2015","unstructured":"Zhou A, Zhang Q (2015) Are all the subproblems equally important? Resource allocation in decomposition-based multiobjective evolutionary algorithms. IEEE Trans Evol Comput 20(1):52\u201364","journal-title":"IEEE Trans Evol Comput"},{"key":"330_CR30","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.ins.2019.06.001","volume":"501","author":"P Wang","year":"2019","unstructured":"Wang P, Zhu W, Liu H (2019) A new resource allocation strategy based on the relationship between subproblems for MOEA\/D. Inf Sci 501:337\u2013362","journal-title":"Inf Sci"},{"issue":"2","key":"330_CR31","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TEVC.2008.925798","volume":"13","author":"H Li","year":"2008","unstructured":"Li H, Zhang Q (2008) Multiobjective optimization problems with complicated Pareto sets, MOEA\/D and NSGA-II. IEEE Trans Evol Comput 13(2):284\u2013302","journal-title":"IEEE Trans Evol Comput"},{"key":"330_CR32","doi-asserted-by":"crossref","unstructured":"Chiang T, Lai Y (2011) MOEA\/D-AMS: improving MOEA\/D by an adaptive mating selection mechanism. In: 2011 IEEE congress on evolutionary computation (CEC). IEEE, pp 1473\u20131480","DOI":"10.1109\/CEC.2011.5949789"},{"issue":"2","key":"330_CR33","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1109\/TCYB.2015.2403131","volume":"46","author":"S Jiang","year":"2015","unstructured":"Jiang S, Yang S (2015) An improved multiobjective optimization evolutionary algorithm based on decomposition for complex Pareto fronts. IEEE Trans Cybern 46(2):421\u2013437","journal-title":"IEEE Trans Cybern"},{"key":"330_CR34","doi-asserted-by":"crossref","unstructured":"Wang Z, Zhang Q, Gong M, Zhou A (2014) A replacement strategy for balancing convergence and diversity in MOEA\/D. In: 2014 IEEE congress on evolutionary computation (CEC). IEEE, pp 2132\u20132139","DOI":"10.1109\/CEC.2014.6900319"},{"issue":"2","key":"330_CR35","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1109\/TCYB.2015.2403849","volume":"46","author":"Z Wang","year":"2015","unstructured":"Wang Z, Zhang Q, Zhou A, Gong M, Jiao L (2015) Adaptive replacement strategies for MOEA\/D. IEEE Trans Cybern 46(2):474\u2013486","journal-title":"IEEE Trans Cybern"},{"key":"330_CR36","doi-asserted-by":"crossref","unstructured":"Huang W, Li H (2010). On the differential evolution schemes in MOEA\/D. In: 2010 sixth international conference on natural computation. IEEE, pp 2788\u20132792","DOI":"10.1109\/ICNC.2010.5583335"},{"issue":"1","key":"330_CR37","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/TCYB.2015.2507366","volume":"47","author":"H Li","year":"2016","unstructured":"Li H, Zhang Q, Deng J (2016) Biased multiobjective optimization and decomposition algorithm. IEEE Trans Cybern 47(1):52\u201366","journal-title":"IEEE Trans Cybern"},{"key":"330_CR38","doi-asserted-by":"crossref","unstructured":"Huang W, Li H (2010) On the differential evolution schemes in MOEA\/D. In: Sixth international conference on natural computation, vol 6. IEEE, pp 2788\u20132792","DOI":"10.1109\/ICNC.2010.5583335"},{"issue":"2","key":"330_CR39","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s12293-015-0170-1","volume":"8","author":"JK Chong","year":"2016","unstructured":"Chong JK (2016) A novel multi-objective memetic algorithm based on opposition-based self-adaptive differential evolution. Memet Comput 8(2):147\u2013165","journal-title":"Memet Comput"},{"issue":"127","key":"330_CR40","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.neucom.2013.06.043","volume":"127","author":"SM Venske","year":"2014","unstructured":"Venske SM, Gon\u00e7alves RA, Delgado MR (2014) ADEMO\/D: multiobjective optimization by an adaptive differential evolution algorithm. Neurocomputing 127(127):65\u201377","journal-title":"Neurocomputing"},{"key":"330_CR41","doi-asserted-by":"crossref","unstructured":"Shim V A, Tan. KC, Tan K (2012) A hybrid adaptive evolutionary algorithm in the domination-based and decomposition-based frameworks of multi-objective optimization. Evol Comput 1\u20138","DOI":"10.1109\/CEC.2012.6256485"},{"issue":"6","key":"330_CR42","doi-asserted-by":"publisher","first-page":"1845","DOI":"10.1109\/TSMCB.2012.2231860","volume":"43","author":"L Ke","year":"2013","unstructured":"Ke L, Zhang Q, Battiti R (2013) MOEA\/D-ACO: a multiobjective evolutionary algorithm using decomposition and AntColony. IEEE Trans Cybern 43(6):1845\u20131859","journal-title":"IEEE Trans Cybern"},{"issue":"5","key":"330_CR43","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1109\/TSMC.2016.2616347","volume":"48","author":"X Zheng","year":"2016","unstructured":"Zheng X, Wang L (2016) A collaborative multiobjective fruit fly optimization algorithm for the resource constrained unrelated parallel machine green scheduling problem. IEEE Trans Syst Man Cybern Syst 48(5):790\u2013800","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"4","key":"330_CR44","doi-asserted-by":"publisher","first-page":"3940","DOI":"10.1109\/TPWRS.2017.2785266","volume":"33","author":"N Paterakis","year":"2017","unstructured":"Paterakis N, Gibescu M, Bakirtzis AG, Catal\u00e3o JPS (2017) A multi-objective optimization approach to risk-constrained energy and reserve procurement using demand response. IEEE Trans Power Syst 33(4):3940\u20133954","journal-title":"IEEE Trans Power Syst"},{"key":"330_CR45","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1016\/j.asoc.2018.10.027","volume":"74","author":"Z Fan","year":"2019","unstructured":"Fan Z, Fang Y, Li W, Cai X, Wei C (2019) MOEA\/D with angle-based constrained dominance principle for constrained multi-objective optimization problems. Appl Soft Comput 74:621\u2013633","journal-title":"Appl Soft Comput"},{"issue":"6","key":"330_CR46","doi-asserted-by":"publisher","first-page":"2450","DOI":"10.1109\/TNNLS.2017.2695223","volume":"29","author":"J Liu","year":"2017","unstructured":"Liu J, Gong M, Miao Q, Wang X, Li H (2017) Structure learning for deep neural networks based on multiobjective optimization. IEEE Trans Neural Net Learn Syst 29(6):2450\u20132463","journal-title":"IEEE Trans Neural Net Learn Syst"},{"key":"330_CR47","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.asoc.2018.03.053","volume":"68","author":"Y Xu","year":"2018","unstructured":"Xu Y, Ding O, Qu R, Li K (2018) Hybrid multi-objective evolutionary algorithms based on decomposition for wireless sensor network coverage optimization. Appl Soft Comput 68:268\u2013282","journal-title":"Appl Soft Comput"},{"issue":"4","key":"330_CR48","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2013","unstructured":"Deb K, Jain H (2013) 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","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"330_CR49","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1109\/TEVC.2014.2373386","volume":"19","author":"K Li","year":"2014","unstructured":"Li K, Deb K, Zhang Q, Kwong S (2014) An evolutionary many-objective optimization algorithm based on dominance and decomposition. IEEE Trans Evol Comput 19(5):694\u2013716","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"330_CR50","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1109\/TEVC.2018.2791283","volume":"23","author":"Y Sun","year":"2018","unstructured":"Sun Y, Yen GG, Yi Z (2018) IGD indicator-based evolutionary algorithm for many-objective optimization problems. IEEE Trans Evol Comput 23(2):173\u2013187","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"330_CR51","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1109\/TEVC.2015.2443001","volume":"20","author":"Y Yuan","year":"2015","unstructured":"Yuan Y, Xu H, Wang B, Zhang B, Yao X (2015) Balancing convergence and diversity in decomposition-based many-objective optimizers. IEEE Trans Evol Comput 20(2):180\u2013198","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"330_CR52","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1109\/TEVC.2017.2695579","volume":"22","author":"F Gu","year":"2017","unstructured":"Gu F, Cheung Y (2017) Self-organizing map-based weight design for decomposition-based many-objective evolutionary algorithm. IEEE Trans Evol Comput 22(2):211\u2013225","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"330_CR53","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1109\/TEVC.2016.2519378","volume":"20","author":"R Cheng","year":"2016","unstructured":"Cheng R, Jin Y, Olhofer M, Sendhoff B (2016) A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 20(5):773\u2013791","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"330_CR54","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s12293-013-0119-1","volume":"5","author":"G Jeyakumar","year":"2013","unstructured":"Jeyakumar G, Velayutham CS (2013) Distributed mixed variant differential evolution algorithms for unconstrained global optimization. Memet Comput 5(4):275\u2013293","journal-title":"Memet Comput"},{"issue":"1","key":"330_CR55","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/TEVC.2010.2087271","volume":"15","author":"Y Wang","year":"2011","unstructured":"Wang Y, Cai Z, Zhang Q (2011) Differential evolution with composite trial vector generation strategies and control parameters. IEEE Trans Evol Comput 15(1):55\u201366","journal-title":"IEEE Trans Evol Comput"},{"key":"330_CR56","doi-asserted-by":"crossref","unstructured":"Mallipeddi R, Suganthan PN (2010) Differential evolution algorithm with ensemble of parameters and mutation and crossover strategies. In: International conference on swarm, evolutionary, and memetic computing. Springer, pp 71\u201378","DOI":"10.1007\/978-3-642-17563-3_9"},{"issue":"2","key":"330_CR57","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1109\/TEVC.2018.2844286","volume":"23","author":"Z Wang","year":"2018","unstructured":"Wang Z, Ong Y-S, Ishibuchi H (2018) On scalable multiobjective test problems with hardly dominated boundaries. IEEE Trans Evol Comput 23(2):217\u2013231","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"330_CR58","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1109\/TEVC.2018.2872453","volume":"23","author":"Z Wang","year":"2018","unstructured":"Wang Z, Ong Y-S, Sun J, Gupta A, Zhang Q (2018) A generator for multiobjective test problems with difficult-to-approximate pareto front boundaries. IEEE Trans Evol Comput 23(4):556\u2013571","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"330_CR59","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: empirical results. Evol Comput 8(2):173\u2013195","journal-title":"Evol Comput"},{"key":"330_CR60","unstructured":"Zhang Q, Zhou A, Zhao SZ, Suganthan PN, Liu W, Tiwari S (2008) Multiobjective optimization test instances for the CEC-2009 special session and competition. Technical report, Nanyang Technological University, Singapore"},{"key":"330_CR61","doi-asserted-by":"crossref","unstructured":"Deb K, Thiele L, Laumanns M (2005) Scalable test problems for evolutionary multiobjective optimization. In: Evolutionary multiobjective optimization. Springer, pp 105\u2013145","DOI":"10.1007\/1-84628-137-7_6"},{"issue":"5","key":"330_CR62","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":"1","key":"330_CR63","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s40747-017-0039-7","volume":"3","author":"R Cheng","year":"2017","unstructured":"Cheng R, Li M, Tian Y, Zhang X, Yang S, Jin Y, Yao X (2017) A benchmark test suite for evolutionary many-objective optimization. Comp Intell Syst 3(1):67\u201381","journal-title":"Comp Intell Syst"},{"key":"330_CR64","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.swevo.2019.02.003","volume":"46","author":"H Li","year":"2019","unstructured":"Li H, Deb K, Zhang Q, Suganthan PN, Chen L (2019) Comparison between MOEA\/D and NSGA-III on a set of novel many and multi-objective benchmark problems with challenging difficulties. Swarm Evol Comput 46:104\u2013117","journal-title":"Swarm Evol Comput"},{"issue":"4","key":"330_CR65","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(4):73\u201387","journal-title":"IEEE Comput Intell Mag"},{"issue":"1","key":"330_CR66","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1109\/TEVC.2019.2912204","volume":"24","author":"D Gong","year":"2019","unstructured":"Gong D, Xu B, Zhang Y, Guo Y, Yang S (2019) A similarity-based cooperative co-evolutionary algorithm for dynamic interval multi-objective optimization problems. IEEE Trans Evol Comput 24(1):142\u2013156","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"330_CR67","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon F (1945) Individual comparisons by ranking methods. Biomet Bull 1(6):80\u201383","journal-title":"Biomet Bull"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-021-00330-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-021-00330-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-021-00330-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T17:30:15Z","timestamp":1629135015000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-021-00330-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,21]]},"references-count":67,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["330"],"URL":"https:\/\/doi.org\/10.1007\/s12293-021-00330-z","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"type":"print","value":"1865-9284"},{"type":"electronic","value":"1865-9292"}],"subject":[],"published":{"date-parts":[[2021,4,21]]},"assertion":[{"value":"13 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2021","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 they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}