{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T17:19:17Z","timestamp":1763572757766},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,4,15]],"date-time":"2024-04-15T00:00:00Z","timestamp":1713139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,15]],"date-time":"2024-04-15T00:00:00Z","timestamp":1713139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2024,8]]},"abstract":"<jats:sec>\n                <jats:title>Abstract<\/jats:title>\n                <jats:p>Constrained multiobjective optimization problems (CMOPs) are widespread in reality. The presence of constraints complicates the feasible region of the original problem and increases the difficulty of problem solving. There are not only feasible regions, but also large areas of infeasible regions in the objective space of CMOPs. Inspired by this, this paper proposes a bidirectional coevolution method with reverse search (BCRS) combined with a two-stage approach. In the first stage of evolution, constraints are ignored and the population is pushed toward promising regions. In the second stage, evolution is divided into two parts, i.e., the main population evolves toward the constrained Pareto front (CPF) within the feasible region, while the reverse population approaches the CPF from the infeasible region. Then a solution exchange strategy similar to weak cooperation is used between the two populations. The experimental results on benchmark functions and real-world problems show that the proposed algorithm exhibits superior or at least competitive performance compared to other state-of-the-art algorithms. It demonstrates BCRS is an effective algorithm for addressing CMOPs.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Graphical Abstract<\/jats:title>\n                \n              <\/jats:sec>","DOI":"10.1007\/s40747-024-01418-y","type":"journal-article","created":{"date-parts":[[2024,4,15]],"date-time":"2024-04-15T10:02:07Z","timestamp":1713175327000},"page":"4973-4988","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A two-stage bidirectional coevolution algorithm with reverse search for constrained multiobjective optimization"],"prefix":"10.1007","volume":"10","author":[{"given":"Cancan","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yujia","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yunfeng","family":"Xue","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,15]]},"reference":[{"key":"1418_CR1","doi-asserted-by":"publisher","first-page":"84263","DOI":"10.1109\/ACCESS.2021.3085529","volume":"9","author":"M Premkumar","year":"2021","unstructured":"Premkumar M, Jangir P, Kumar BS, Sowmya R, Alhelou HH, Abualigah L, Yildiz AR, Mirjalili S (2021) A new arithmetic optimization algorithm for solving real-world multiobjective cec-2021 constrained optimization problems: Diversity analysis and validations. IEEE Access 9:84263\u201384295. https:\/\/doi.org\/10.1109\/ACCESS.2021.3085529","journal-title":"IEEE Access"},{"key":"1418_CR2","doi-asserted-by":"publisher","first-page":"8151","DOI":"10.1007\/s00500-017-2759-4","volume":"22","author":"A Mohammadi","year":"2018","unstructured":"Mohammadi A, Mohammadi M, Zahiri SH (2018) Design of optimal cmos ring oscillator using an intelligent optimization tool. Soft Comput 22:8151\u20138166","journal-title":"Soft Comput"},{"key":"1418_CR3","doi-asserted-by":"crossref","unstructured":"Deb K (2011) In: Wang L, Ng AHC, Deb K (eds.) Multi-objective optimisation using evolutionary algorithms: an introduction, Springer, London, pp 3\u201334","DOI":"10.1007\/978-0-85729-652-8_1"},{"issue":"2","key":"1418_CR4","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/j.cam.2006.03.048","volume":"215","author":"V Kelner","year":"2008","unstructured":"Kelner V, Capitanescu F, L\u00e9onard O, Wehenkel L (2008) A hybrid optimization technique coupling an evolutionary and a local search algorithm. J Comput Appl Math 215(2):448\u2013456. https:\/\/doi.org\/10.1016\/j.cam.2006.03.048","journal-title":"J Comput Appl Math"},{"issue":"2","key":"1418_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, 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":"1418_CR6","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Qingfu Zhang","year":"2007","unstructured":"Zhang Qingfu, Li Hui (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"},{"issue":"3","key":"1418_CR7","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. https:\/\/doi.org\/10.1016\/j.ejor.2006.08.008","journal-title":"Eur J Oper Res"},{"issue":"8","key":"1418_CR8","doi-asserted-by":"publisher","first-page":"3444","DOI":"10.1109\/TCYB.2019.2908485","volume":"50","author":"J Sun","year":"2020","unstructured":"Sun J, Miao Z, Gong D, Zeng X-J, Li J, Wang G (2020) Interval multiobjective optimization with memetic algorithms. IEEE Trans Cybern 50(8):3444\u20133457. https:\/\/doi.org\/10.1109\/TCYB.2019.2908485","journal-title":"IEEE Trans Cybern"},{"key":"1418_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2020.02.066","volume":"522","author":"Y Zhang","year":"2020","unstructured":"Zhang Y, Wang G-G, Li K, Yeh W-C, Jian M, Dong J (2020) Enhancing moea\/d with information feedback models for large-scale many-objective optimization. Inf Sci 522:1\u201316. https:\/\/doi.org\/10.1016\/j.ins.2020.02.066","journal-title":"Inf Sci"},{"key":"1418_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TEVC.2022.3155533","volume":"27","author":"J Liang","year":"2022","unstructured":"Liang J, Ban X, Yu K, Qu B, Qiao K, Yue C, Chen K, Tan KC (2022) A survey on evolutionary constrained multi-objective optimization. IEEE Trans Evol Comput 27:1\u20131. https:\/\/doi.org\/10.1109\/TEVC.2022.3155533","journal-title":"IEEE Trans Evol Comput"},{"key":"1418_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCYB.2021.3056176","volume":"52","author":"Z-Z Liu","year":"2021","unstructured":"Liu Z-Z, Wang B-C, Tang K (2021) Handling constrained multiobjective optimization problems via bidirectional coevolution. IEEE Trans Cybern 52:1\u201314. https:\/\/doi.org\/10.1109\/TCYB.2021.3056176","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"1418_CR12","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/TEVC.2020.3004012","volume":"25","author":"Y Tian","year":"2021","unstructured":"Tian Y, Zhang T, Xiao J, Zhang X, Jin Y (2021) A coevolutionary framework for constrained multiobjective optimization problems. IEEE Trans Evol Comput 25(1):102\u2013116. https:\/\/doi.org\/10.1109\/TEVC.2020.3004012","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"1418_CR13","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1109\/TEVC.2022.3175065","volume":"27","author":"K Qiao","year":"2023","unstructured":"Qiao K, Yu K, Qu B, Liang J, Song H, Yue C, Lin H, Tan KC (2023) Dynamic auxiliary task-based evolutionary multitasking for constrained multiobjective optimization. IEEE Trans Evol Comput 27(3):642\u2013656. https:\/\/doi.org\/10.1109\/TEVC.2022.3175065","journal-title":"IEEE Trans Evol Comput"},{"issue":"8","key":"1418_CR14","doi-asserted-by":"publisher","first-page":"5005","DOI":"10.1109\/TSMC.2019.2943973","volume":"51","author":"Z Ma","year":"2021","unstructured":"Ma Z, Wang Y, Song W (2021) A new fitness function with two rankings for evolutionary constrained multiobjective optimization. IEEE Trans Syst Man Cybern Syst 51(8):5005\u20135016. https:\/\/doi.org\/10.1109\/TSMC.2019.2943973","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"1418_CR15","doi-asserted-by":"crossref","unstructured":"Maldonado HM, Zapotecas-Mart\u00ednez S (2021) A dynamic penalty function within moea\/d for constrained multi-objective optimization problems. In: 2021 IEEE Congress on Evolutionary Computation (CEC), pp 1470\u20131477","DOI":"10.1109\/CEC45853.2021.9504940"},{"issue":"5","key":"1418_CR16","doi-asserted-by":"publisher","first-page":"2954","DOI":"10.1109\/TSMC.2021.3061698","volume":"52","author":"K Yu","year":"2022","unstructured":"Yu K, Liang J, Qu B, Luo Y, Yue C (2022) Dynamic selection preference-assisted constrained multiobjective differential evolution. IEEE Trans Syst Man Cybern Syst 52(5):2954\u20132965. https:\/\/doi.org\/10.1109\/TSMC.2021.3061698","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"1418_CR17","unstructured":"Takahama T, Sakai S (2006) Constrained optimization by the $$\\varepsilon $$ constrained differential evolution with gradient-based mutation and feasible elites. In: 2006 IEEE International Conference on Evolutionary Computation, pp 1\u20138"},{"key":"1418_CR18","doi-asserted-by":"crossref","unstructured":"Wang Z, Wei J, Zhang Y (2020) A multi-constraint handling techniquebased niching evolutionary algorithm for constrained multi-objective optimization problems. In: 2020 IEEE Congress on Evolutionary Computation (CEC), pp 1\u20136","DOI":"10.1109\/CEC48606.2020.9185519"},{"issue":"3","key":"1418_CR19","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/4235.873238","volume":"4","author":"TP Runarsson","year":"2000","unstructured":"Runarsson TP, Xin Y (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput 4(3):284\u2013294. https:\/\/doi.org\/10.1109\/4235.873238","journal-title":"IEEE Trans Evol Comput"},{"key":"1418_CR20","doi-asserted-by":"crossref","unstructured":"Ying W-Q, He W-P, Huang Y-X, Li D-T, Wu Y (2016) An adaptive stochastic ranking mechanism in moea\/d for constrained multi-objective optimization. In: 2016 International Conference on Information System and Artificial Intelligence (ISAI), pp 514\u2013518","DOI":"10.1109\/ISAI.2016.0115"},{"key":"1418_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2016.09.062","volume":"377","author":"S Datta","year":"2017","unstructured":"Datta S, Ghosh A, Sanyal K, Das S (2017) A Radial Boundary Intersection aided interior point method for multi-objective optimization. Inf Sci 377:1\u201316. https:\/\/doi.org\/10.1016\/j.ins.2016.09.062","journal-title":"Inf Sci"},{"key":"1418_CR22","doi-asserted-by":"crossref","unstructured":"Sch\u00fctze O, Uribe L, Lara A (2020) The gradient subspace approximation and its application to bi-objective optimization problems. In: advances in dynamics, optimization and computation: a volume dedicated to Michael Dellnitz on the Occasion of His 60th Birthday, Springer, pp 355\u2013390","DOI":"10.1007\/978-3-030-51264-4_15"},{"issue":"1","key":"1418_CR23","doi-asserted-by":"publisher","first-page":"7","DOI":"10.3390\/math8010007","volume":"8","author":"O Cuate","year":"2020","unstructured":"Cuate O, Ponsich A, Uribe L, Zapotecas-Mart\u00ednez S, Lara A, Sch\u00fctze O (2020) A new hybrid evolutionary algorithm for the treatment of equality constrained mops. Mathematics 8(1):7. https:\/\/doi.org\/10.3390\/math8010007","journal-title":"Mathematics"},{"key":"1418_CR24","doi-asserted-by":"crossref","unstructured":"Cant\u00fa VH, Ponsich A, Azzaro\u2013Pantel C (2021) On the use of gradient-based repair method for solving constrained multiobjective optimization problems-a comparative study. https:\/\/api.semanticscholar.org\/CorpusID:234894813","DOI":"10.1007\/978-981-33-6710-4_6"},{"key":"1418_CR25","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/j.swevo.2018.08.017","volume":"44","author":"Z Fan","year":"2019","unstructured":"Fan Z, Li W, Cai X, Li H, Wei C, Zhang Q, Deb K, Goodman E (2019) Push and pull search for solving constrained multi-objective optimization problems. Swarm Evol Comput 44:665\u2013679. https:\/\/doi.org\/10.1016\/j.swevo.2018.08.017","journal-title":"Swarm Evol Comput"},{"issue":"2","key":"1418_CR26","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/TEVC.2018.2855411","volume":"23","author":"K Li","year":"2019","unstructured":"Li K, Chen R, Fu G, Yao X (2019) Two-archive evolutionary algorithm for constrained multiobjective optimization. IEEE Trans Evol Comput 23(2):303\u2013315. https:\/\/doi.org\/10.1109\/TEVC.2018.2855411","journal-title":"IEEE Trans Evol Comput"},{"key":"1418_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100799","volume":"60","author":"K Yu","year":"2021","unstructured":"Yu K, Liang J, Qu B, Yue C (2021) Purpose-directed two-phase multiobjective differential evolution for constrained multiobjective optimization. Swarm Evol Comput 60:100799. https:\/\/doi.org\/10.1016\/j.swevo.2020.100799","journal-title":"Swarm Evol Comput"},{"key":"1418_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101161","volume":"75","author":"Q Bao","year":"2022","unstructured":"Bao Q, Wang M, Dai G, Chen X, Song Z, Li S (2022) An archive-based two-stage evolutionary algorithm for constrained multi-objective optimization problems. Swarm Evol Comput 75:101161. https:\/\/doi.org\/10.1016\/j.swevo.2022.101161","journal-title":"Swarm Evol Comput"},{"key":"1418_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.116499","volume":"195","author":"J Dong","year":"2022","unstructured":"Dong J, Gong W, Ming F, Wang L (2022) A two-stage evolutionary algorithm based on three indicators for constrained multi-objective optimization. Expert Syst Appl 195:116499. https:\/\/doi.org\/10.1016\/j.eswa.2022.116499","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1418_CR30","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1109\/TEVC.2022.3145582","volume":"26","author":"K Qiao","year":"2022","unstructured":"Qiao K, Yu K, Qu B, Liang J, Song H, Yue C (2022) An evolutionary multitasking optimization framework for constrained multiobjective optimization problems. IEEE Trans Evol Comput 26(2):263\u2013277. https:\/\/doi.org\/10.1109\/TEVC.2022.3145582","journal-title":"IEEE Trans Evol Comput"},{"key":"1418_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101247","volume":"77","author":"K Yang","year":"2023","unstructured":"Yang K, Zheng J, Zou J, Yu F, Yang S (2023) A dual-population evolutionary algorithm based on adaptive constraint strength for constrained multi-objective optimization. Swarm Evol Comput 77:101247. https:\/\/doi.org\/10.1016\/j.swevo.2023.101247","journal-title":"Swarm Evol Comput"},{"key":"1418_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119547","volume":"648","author":"Y Zhang","year":"2023","unstructured":"Zhang Y, Tian Y, Jiang H, Zhang X, Jin Y (2023) Design and analysis of helper-problem-assisted evolutionary algorithm for constrained multiobjective optimization. Inf Sci 648:119547. https:\/\/doi.org\/10.1016\/j.ins.2023.119547","journal-title":"Inf Sci"},{"key":"1418_CR33","doi-asserted-by":"crossref","unstructured":"Zou J, Sun R, Liu Y, Hu Y, Yang S, Zheng J, Li K (2023) A multi-population evolutionary algorithm using new cooperative mechanism for solving multi-objective problems with multi-constraint. In: IEEE Transactions on Evolutionary Computation, pp 1\u20131","DOI":"10.1109\/TEVC.2023.3260306"},{"issue":"2","key":"1418_CR34","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TEVC.2008.925798","volume":"13","author":"Hui Li","year":"2009","unstructured":"Li Hui, Zhang Qingfu (2009) Multiobjective optimization problems with complicated pareto sets, MOEA\/D and NSGA-II. IEEE Trans Evol Comput 13(2):284\u2013302. https:\/\/doi.org\/10.1109\/TEVC.2008.925798","journal-title":"IEEE Trans Evol Comput"},{"key":"1418_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101055","volume":"70","author":"F Ming","year":"2022","unstructured":"Ming F, Gong W, Wang L, Lu C (2022) A tri-population based co-evolutionary framework for constrained multi-objective optimization problems. Swarm Evol Comput 70:101055","journal-title":"Swarm Evol Comput"},{"key":"1418_CR36","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ins.2021.01.029","volume":"560","author":"H Ma","year":"2021","unstructured":"Ma H, Wei H, Tian Y, Cheng R, Zhang X (2021) A multi-stage evolutionary algorithm for multi-objective optimization with complex constraints. Inf Sci 560:68\u201391. https:\/\/doi.org\/10.1016\/j.ins.2021.01.029","journal-title":"Inf Sci"},{"key":"1418_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCYB.2020.3021138","volume":"52","author":"Y Tian","year":"2021","unstructured":"Tian Y, Zhang Y, Su Y, Zhang X, Tan KC, Jin Y (2021) Balancing objective optimization and constraint satisfaction in constrained evolutionary multiobjective optimization. IEEE Trans Cybern 52:1\u201314. https:\/\/doi.org\/10.1109\/TCYB.2020.3021138","journal-title":"IEEE Trans Cybern"},{"issue":"23","key":"1418_CR38","doi-asserted-by":"publisher","first-page":"12491","DOI":"10.1007\/s00500-019-03794-x","volume":"23","author":"Z Fan","year":"2019","unstructured":"Fan Z, Li W, Cai X, Huang H, Fang Y, You Y, Mo J, Wei C, Goodman E (2019) An improved epsilon constraint-handling method in MOEA\/D for CMOPs with large infeasible regions. Soft Comput 23(23):12491\u201312510. https:\/\/doi.org\/10.1007\/s00500-019-03794-x","journal-title":"Soft Comput"},{"issue":"6","key":"1418_CR39","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1109\/TEVC.2019.2896967","volume":"23","author":"Z Ma","year":"2019","unstructured":"Ma Z, Wang Y (2019) Evolutionary constrained multiobjective optimization: test suite construction and performance comparisons. IEEE Trans Evol Comput 23(6):972\u2013986. https:\/\/doi.org\/10.1109\/TEVC.2019.2896967","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"1418_CR40","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1162\/evco_a_00259","volume":"28","author":"Z Fan","year":"2020","unstructured":"Fan Z, Li W, Cai X, Li H, Wei C, Zhang Q, Deb K, Goodman E (2020) Difficulty adjustable and scalable constrained multiobjective test problem toolkit. Evol Comput 28(3):339\u2013378. https:\/\/doi.org\/10.1162\/evco_a_00259","journal-title":"Evol Comput"},{"key":"1418_CR41","unstructured":"Zhang Q, Zhou A, Zhao S, Suganthan PN, Liu W, Tiwari S (2009) Multiobjective optimization test instances for the CEC 2009 special session and competition"},{"key":"1418_CR42","doi-asserted-by":"crossref","unstructured":"Kannan B, Kramer SN (1994) An augmented lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design","DOI":"10.1115\/DETC1993-0382"},{"key":"1418_CR43","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01195989","volume":"18","author":"S Narayanan","year":"1999","unstructured":"Narayanan S, Azarm S (1999) On improving multiobjective genetic algorithms for design optimization. Struct Optim 18:146\u2013155","journal-title":"Struct Optim"},{"issue":"5","key":"1418_CR44","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1016\/j.camwa.2011.11.057","volume":"63","author":"G Chiandussi","year":"2012","unstructured":"Chiandussi G, Codegone M, Ferrero S, Varesio FE (2012) Comparison of multi-objective optimization methodologies for engineering applications. Comput Math Appl 63(5):912\u2013942. https:\/\/doi.org\/10.1016\/j.camwa.2011.11.057","journal-title":"Comput Math Appl"},{"key":"1418_CR45","first-page":"135","volume":"2","author":"K Deb","year":"1999","unstructured":"Deb K et al (1999) Evolutionary algorithms for multi-criterion optimization in engineering design. Evol Algorithms Eng Comput Sci 2:135\u2013161","journal-title":"Evol Algorithms Eng Comput Sci"},{"key":"1418_CR46","unstructured":"Osyczka A, Kundu S (1995) A genetic algorithm-based multicriteria optimization method. In: Proceedings of the 1st World Congress on Structural and Multidisciplinary Optimization, pp 909\u2013914"},{"key":"1418_CR47","unstructured":"Azarm S, Tits A, Fan M (1999) Tradeoff-driven optimization-based design of mechanical systems. In: 4th Symposium on Multidisciplinary Analysis and Optimization, p 4758"},{"issue":"2","key":"1418_CR48","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1080\/03052150210915","volume":"34","author":"T Ray","year":"2002","unstructured":"Ray T, Liew K (2002) A swarm metaphor for multiobjective design optimization. Eng Optim 34(2):141\u2013153","journal-title":"Eng Optim"},{"issue":"4","key":"1418_CR49","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":"5","key":"1418_CR50","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1080\/03052159908941390","volume":"31","author":"F Cheng","year":"1999","unstructured":"Cheng F, Li X (1999) Generalized center method for multiobjective engineering optimization. Eng Optim 31(5):641\u2013661","journal-title":"Eng Optim"},{"issue":"5","key":"1418_CR51","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/j.engappai.2005.12.001","volume":"19","author":"H-Z Huang","year":"2006","unstructured":"Huang H-Z, Gu Y-K, Du X (2006) An interactive fuzzy multi-objective optimization method for engineering design. Eng Appl Artif Intell 19(5):451\u2013460","journal-title":"Eng Appl Artif Intell"},{"key":"1418_CR52","unstructured":"Osyczka A, Osyczka A (2002) Evolutionary algorithms for single and multicriteria design optimization"},{"issue":"7","key":"1418_CR53","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1016\/0098-1354(89)85053-7","volume":"13","author":"GR Kocis","year":"1989","unstructured":"Kocis GR, Grossmann IE (1989) A modelling and decomposition strategy for the minlp optimization of process flowsheets. Comput Chem Eng 13(7):797\u2013819","journal-title":"Comput Chem Eng"},{"issue":"1","key":"1418_CR54","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1109\/TIE.2016.2586678","volume":"64","author":"A Edpuganti","year":"2016","unstructured":"Edpuganti A, Rathore AK (2016) Optimal pulsewidth modulation for common-mode voltage elimination scheme of medium-voltage modular multilevel converter-fed open-end stator winding induction motor drives. IEEE Trans Ind Electron 64(1):848\u2013856","journal-title":"IEEE Trans Ind Electron"},{"key":"1418_CR55","doi-asserted-by":"crossref","unstructured":"Rivas-D\u00e1valos F, Irving MR (2005) An approach based on the strength pareto evolutionary algorithm 2 for power distribution system planning. In: International Conference on Evolutionary Multi-Criterion Optimization, Springer, pp 707\u2013720","DOI":"10.1007\/978-3-540-31880-4_49"},{"issue":"1","key":"1418_CR56","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s12065-021-00649-z","volume":"16","author":"P Jangir","year":"2023","unstructured":"Jangir P, Buch H, Mirjalili S, Manoharan P (2023) Mompa: multi-objective marine predator algorithm for solving multi-objective optimization problems. Evol Intell 16(1):169\u2013195","journal-title":"Evol Intell"},{"key":"1418_CR57","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100961","volume":"67","author":"A Kumar","year":"2021","unstructured":"Kumar A, Wu G, Ali MZ, Luo Q, Mallipeddi R, Suganthan PN, Das S (2021) A benchmark-suite of real-world constrained multi-objective optimization problems and some baseline results. Swarm Evol Comput 67:100961","journal-title":"Swarm Evol Comput"},{"issue":"3","key":"1418_CR58","first-page":"115","volume":"9","author":"RB Agrawal","year":"1994","unstructured":"Agrawal RB, Deb K, Agrawal RB (1994) Simulated binary crossover for continuous search space. Complex Syst 9(3):115\u2013148","journal-title":"Complex Syst"},{"key":"1418_CR59","unstructured":"Deb K, Goyal M (1996) A combined genetic adaptive search (geneas) for engineering design"},{"issue":"2","key":"1418_CR60","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/TEVC.2003.810761","volume":"7","author":"PAN Bosman","year":"2003","unstructured":"Bosman PAN, 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"},{"issue":"1","key":"1418_CR61","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TEVC.2005.851275","volume":"10","author":"L While","year":"2006","unstructured":"While L, Hingston P, Barone L, Huband S (2006) A faster algorithm for calculating hypervolume. IEEE Trans Evol Comput 10(1):29\u201338. https:\/\/doi.org\/10.1109\/TEVC.2005.851275","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"1418_CR62","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. https:\/\/doi.org\/10.1109\/MCI.2017.2742868","journal-title":"IEEE Comput Intell Mag"},{"key":"1418_CR63","doi-asserted-by":"crossref","unstructured":"Triguero I, Gonz\u00e1lez S, Moyano JM, Garc\u00eda S, Alcal\u00e1-Fdez J, Luengo J, Fern\u00e1ndez A, Del\u00a0Jes\u00fas MJ, S\u00e1nchez L, Herrera F (2017) KEEL 3.0: an open source software for multi-stage analysis in data mining. Int J Comput Intell Syst 10(1):1238","DOI":"10.2991\/ijcis.10.1.82"},{"issue":"1","key":"1418_CR64","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67\u201382","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-024-01418-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-024-01418-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01418-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T17:21:22Z","timestamp":1721236882000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-024-01418-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,15]]},"references-count":64,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["1418"],"URL":"https:\/\/doi.org\/10.1007\/s40747-024-01418-y","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,15]]},"assertion":[{"value":"10 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2024","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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}