{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T08:26:27Z","timestamp":1775118387252,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T00:00:00Z","timestamp":1652918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T00:00:00Z","timestamp":1652918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61866026"],"award-info":[{"award-number":["61866026"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772255"],"award-info":[{"award-number":["61772255"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61866025"],"award-info":[{"award-number":["61866025"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62066031"],"award-info":[{"award-number":["62066031"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004479","name":"Natural Science Foundation of Jiangxi Province","doi-asserted-by":"publisher","award":["20181BAB202025"],"award-info":[{"award-number":["20181BAB202025"]}],"id":[{"id":"10.13039\/501100004479","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Advantage Subject Team Project of Jiangxi Province","award":["20165BCB19007"],"award-info":[{"award-number":["20165BCB19007"]}]},{"DOI":"10.13039\/501100004750","name":"Aeronautical Science Foundation of China","doi-asserted-by":"publisher","award":["2018ZC56008"],"award-info":[{"award-number":["2018ZC56008"]}],"id":[{"id":"10.13039\/501100004750","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Outstanding Young Scientist Project of Jiangxi Province","award":["20192BCB23011"],"award-info":[{"award-number":["20192BCB23011"]}]},{"name":"National Key Research and Development Program of China","award":["2020YFC2003800"],"award-info":[{"award-number":["2020YFC2003800"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>There exist many multi-objective optimization problems (MOPs) containing several inequality and equality constraints in practical applications, which are known as CMOPs. CMOPs pose great challenges for existing multi-objective evolutionary algorithms (MOEAs) since the difficulty in balancing the objective minimization and constraint satisfaction. Without loss of generality, the distribution of the Pareto set for a continuous m-objective CMOP can be regarded as a piecewise continuous manifold of dimension (<jats:italic>m<\/jats:italic>\u2009\u2212\u20091). According to this property, a self-organizing map (SOM) approach for constrained multi-objective optimization problems is proposed in this article. In the proposed approach, we adopt the strategy of two population evolution, in which one population is evolved by considering all the constraints and the other population is used to assist in exploring the areas. In the evolutionary stage, each population is assigned a self-organizing map for discovering the population distribution structure in the decision space. After the topological mapping, we utilize the extracted neighborhood relationship information to generate promising offspring solutions. Afterwards, the neuron weight vectors of SOM are updated by the objective vectors of the surviving offsprings. Through the proposed approach, we can make the population efficiently converge to the feasible region with suitable levels of diversity. In the experiments, we compare the proposed method with several state-of-the-art approaches by using 48 benchmark problems. The evaluation results indicate that the overwhelmingly superior performance of the proposed method over the other peer algorithms on most of the tested problems. The source code is available at <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/hccccc92918\/CMOSMA\">https:\/\/github.com\/hccccc92918\/CMOSMA<\/jats:ext-link>.<\/jats:p>","DOI":"10.1007\/s40747-022-00761-2","type":"journal-article","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T13:03:41Z","timestamp":1652965421000},"page":"5355-5375","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["A self-organizing map approach for constrained multi-objective optimization problems"],"prefix":"10.1007","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0530-1163","authenticated-orcid":false,"given":"Chao","family":"He","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5899-9043","authenticated-orcid":false,"given":"Ming","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1356-1205","authenticated-orcid":false,"given":"Congxuan","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4542-8804","authenticated-orcid":false,"given":"Hao","family":"Chen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6483-232X","authenticated-orcid":false,"given":"Peilong","family":"Zhong","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6026-1067","authenticated-orcid":false,"given":"Zhengxiu","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5789-6125","authenticated-orcid":false,"given":"Junhua","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,19]]},"reference":[{"key":"761_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-021-00363-4","author":"Y Chen","year":"2021","unstructured":"Chen Y, Wang R, Ming M, Cheng S, Bao Y, Zhang W, Zhang C (2021) Constraint multi-objective optimal design of hybrid renewable energy system considering load characteristics. Complex Intell Syst. https:\/\/doi.org\/10.1007\/s40747-021-00363-4","journal-title":"Complex Intell Syst"},{"key":"761_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2021.107099","volume":"225","author":"L Zhu","year":"2021","unstructured":"Zhu L, Lin J, Li Y, Wang ZJ (2021) A decomposition-based multi-objective genetic programming hyper-heuristic approach for the multi-skill resource constrained project scheduling proble. Knowl-Based Syst 225:1\u201318","journal-title":"Knowl-Based Syst"},{"key":"761_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-020-00249-x","author":"Q Gu","year":"2021","unstructured":"Gu Q, Wang Q, Xiong NN, Jiang S, Chen L (2021) Surrogate-assisted evolutionary algorithm for expensive constrained multi-objective discrete optimization problems. Complex Intell Syst. https:\/\/doi.org\/10.1007\/s40747-020-00249-x","journal-title":"Complex Intell Syst"},{"issue":"8","key":"761_CR4","first-page":"3086","volume":"50","author":"Y Zhou","year":"2020","unstructured":"Zhou Y, Zhu M, Wang J, Zhang Z, Xiang Y, Zhang J (2020) Tri-goal evolution framework for constrained many-objective optimization. IEEE Trans Evol Comput 50(8):3086\u20133099","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"761_CR5","first-page":"1","volume":"165","author":"AA Ewees","year":"2021","unstructured":"Ewees AA, Elaziz MA, Oliva D (2021) A new multi-objective optimization algorithm combined with opposition-based learning. Expert Syst Appl 165(3):1\u201330","journal-title":"Expert Syst Appl"},{"key":"761_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-022-00650-8","author":"K Du","year":"2022","unstructured":"Du K, Li J, Wang H, Zhang J (2022) Multi-objective multi-criteria evolutionary algorithm for multi-objective multi-task optimization. Complex Intell Syst. https:\/\/doi.org\/10.1007\/s40747-022-00650-8","journal-title":"Complex Intell Syst"},{"key":"761_CR7","first-page":"1","volume":"174","author":"YK Wang","year":"2021","unstructured":"Wang YK, Wang SL, Lo D, Shen CF, Yang B (2021) An improved multi-objective whale optimization algorithm for the hybrid flow shop scheduling problem considering device dynamic reconfiguration processes. Expert Syst Appl 174:1\u201314","journal-title":"Expert Syst Appl"},{"issue":"2","key":"761_CR8","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/TEVC.2018.2855411","volume":"23","author":"K Li","year":"2018","unstructured":"Li K, Chen R, Fu G, Yao X (2018) Two-archive evolutionary algorithm for constrained multi-objective optimization. IEEE Trans Evol Comput 23(2):303\u2013315","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"761_CR9","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","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"761_CR10","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"},{"key":"761_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2021.107933","volume":"239","author":"C Peng","year":"2022","unstructured":"Peng C, Liu H, Goodman E, Tan KC (2022) A two-phase framework of locating the reference point for decomposition-based constrained multi-objective evolutionary algorithms. Knowl-Based Syst 239:1\u201312","journal-title":"Knowl-Based Syst"},{"key":"761_CR12","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, Goodman E (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"},{"key":"761_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.asoc.2020.106104","volume":"89","author":"Y Yang","year":"2020","unstructured":"Yang Y, Liu J, Tan S (2020) A constrained multi-objective evolutionary algorithm based on decomposition and dynamic constraint-handling mechanism. Appl Soft Comput 89:1\u201316","journal-title":"Appl Soft Comput"},{"key":"761_CR14","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.ins.2021.07.048","volume":"578","author":"R Jiao","year":"2021","unstructured":"Jiao R, Zeng S, Li C, Ong Y (2021) Two-type weight adjustments in MOEA\/D for highly constrained many-objective optimization. Inf Sci 578:592\u2013614","journal-title":"Inf Sci"},{"key":"761_CR15","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.artint.2015.06.007","volume":"228","author":"M Li","year":"2015","unstructured":"Li M, Yang S, Liu X (2015) Bi-goal evolution for manyobjective optimization problems. Artif Intell 228:45\u201365","journal-title":"Artif Intell"},{"issue":"4","key":"761_CR16","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1109\/TEVC.2014.2350987","volume":"19","author":"H Wang","year":"2015","unstructured":"Wang H, Jiao L, Yao X (2015) Two Arch2: an improved two-archive algorithm for many-objective optimization. IEEE Trans Evol Comput 19(4):524\u2013541","journal-title":"IEEE Trans Evol Comput"},{"key":"761_CR17","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, Hui L, Goodman ED (2019) Push and pull search for solving constrained multi-objective optimization problems. Swarm Evol Comput 44:665\u2013679","journal-title":"Swarm Evol Comput"},{"key":"761_CR18","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.3021138","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 Cybernet. https:\/\/doi.org\/10.1109\/TCYB.2020.3021138","journal-title":"IEEE Trans Cybernet"},{"key":"761_CR19","doi-asserted-by":"crossref","unstructured":"Harada K, Sakuma J, Ono I and Kobayashi S (2006) Constraint-handling method for multi-objective function optimization: pareto descent repair operator. In: Proceeding of 4th International Conference Evolution Multi Criterion Optim. (EMO), pp 156\u2013170","DOI":"10.1007\/978-3-540-70928-2_15"},{"issue":"13","key":"761_CR20","doi-asserted-by":"publisher","first-page":"2499","DOI":"10.1016\/j.ins.2010.03.021","volume":"180","author":"HK Singh","year":"2010","unstructured":"Singh HK, Ray T, Smith W (2010) C-PSA: constrained Pareto simulated annealing for constrained multi-objective optimization. Inf Sci 180(13):2499\u20132513. https:\/\/doi.org\/10.1016\/j.ins.2010.03.021","journal-title":"Inf Sci"},{"key":"761_CR21","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.asoc.2013.10.008","volume":"14","author":"L Jiao","year":"2014","unstructured":"Jiao L, Luo J, Shang R, Liu F (2014) A modified objective function method with feasible-guiding strategy to solve constrained multi-objective optimization problems. Appl Soft Comput 14:363\u2013380","journal-title":"Appl Soft Comput"},{"issue":"13","key":"761_CR22","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1109\/TEVC.2019.2894743","volume":"23","author":"Z Liu","year":"2019","unstructured":"Liu Z, Wang Y (2019) Handling constrained multiobjective optimization problems with constraints in both the decision and objective spaces. IEEE Trans Evol Comput 23(13):870\u2013884","journal-title":"IEEE Trans Evol Comput"},{"key":"761_CR23","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","journal-title":"Inf Sci"},{"key":"761_CR24","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.asoc.2014.11.039","volume":"28","author":"Y Li","year":"2015","unstructured":"Li Y, He H, Wang Y, Xu X, Jiao L (2015) An improved multiobjective estimation of distribution algorithm for environmental economic dispatch of hydrothermal power systems. Appl Soft Comput 28:559\u2013568","journal-title":"Appl Soft Comput"},{"issue":"3","key":"761_CR25","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s13042-014-0277-6","volume":"6","author":"H Zhang","year":"2015","unstructured":"Zhang H, Song S, Zhou A, Gao XZ (2015) A multiobjective cellular genetic algorithm based on 3D structure and cosine crowding measurement. Int J Mach Learn Cybern 6(3):487\u2013500","journal-title":"Int J Mach Learn Cybern"},{"issue":"6","key":"761_CR26","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"761_CR27","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1109\/TEVC.2016.2521868","volume":"20","author":"H Zhang","year":"2016","unstructured":"Zhang H, Zhou A, Song S, Zhang Q (2016) A self-organizing multiobjective evolutionary algorithm. IEEE Trans Evol Comput 20(5):792\u2013806","journal-title":"IEEE Trans Evol Comput"},{"issue":"1\u20133","key":"761_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0925-2312(98)00030-7","volume":"21","author":"T Kohonen","year":"1998","unstructured":"Kohonen T (1998) The self-organizing map. Neurocomputing 21(1\u20133):1\u20136","journal-title":"Neurocomputing"},{"key":"761_CR29","doi-asserted-by":"crossref","unstructured":"Obayashi S and Sasaki D (2003) Visualization and data mining of Pareto solutions using self-organizing map. In: Proceeding of evolution and multi-criterion optimization, Faro, Portugal, pp 796\u2013809","DOI":"10.1007\/3-540-36970-8_56"},{"issue":"2","key":"761_CR30","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1109\/tevc.2017.2695579","volume":"22","author":"F Gu","year":"2018","unstructured":"Gu F, Cheung YM (2018) Self-organizing map-based weight design for decomposition-based many-objective evolutionary algorithm. IEEE Trans Evol Comput 22(2):211\u2013225. https:\/\/doi.org\/10.1109\/tevc.2017.2695579","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"761_CR31","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1109\/TEVC.2015.2455812","volume":"20","author":"X Ma","year":"2016","unstructured":"Ma X et al (2016) A multiobjective evolutionary algorithm based on decision variable analyses for multiobjective optimization problems with largescale variables. IEEE Trans Evol Comput 20(2):275\u2013298","journal-title":"IEEE Trans Evol Comput"},{"key":"761_CR32","volume-title":"Nonlinear multiobjective optimization","author":"K Miettinen","year":"1999","unstructured":"Miettinen K (1999) Nonlinear multiobjective optimization. Kluwer Academic, Boston"},{"key":"761_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-8280-4","volume-title":"Nonlinear multiobjective optimization\u2014a generalized homotopy approach","author":"C Hillermeier","year":"2001","unstructured":"Hillermeier C (2001) Nonlinear multiobjective optimization\u2014a generalized homotopy approach. Birkhauser, Boston"},{"issue":"6","key":"761_CR34","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","journal-title":"IEEE Trans Evol Comput"},{"key":"761_CR35","doi-asserted-by":"publisher","first-page":"1609","DOI":"10.1007\/s13042-017-0668-6","volume":"9","author":"Y Zhang","year":"2018","unstructured":"Zhang Y, Li Z, Zhang H, Yu Z, Lu T (2018) Fuzzy c-means clustering-based mating restriction for multiobjective optimization. Int J Mach Learn Cybern 9:1609\u20131621","journal-title":"Int J Mach Learn Cybern"},{"key":"761_CR36","doi-asserted-by":"publisher","first-page":"131851","DOI":"10.1109\/ACCESS.2019.2941123","volume":"7","author":"S Wang","year":"2019","unstructured":"Wang S, Zhang H, Zhang Y, Zhou A, Wu P (2019) A spectral clustering-based multi-source mating selection strategy in evolutionary multi-objective optimization. IEEE Access 7:131851\u2013131864","journal-title":"IEEE Access"},{"key":"761_CR37","doi-asserted-by":"crossref","unstructured":"Zille H, Ishibuchi H, Mostaghim S and Nojima Y (2016) Mutation operators based on variable grouping for multi-objective large-scale optimization. In: 2016 IEEE Symposium Series on Computational Intelligence (SSCI)","DOI":"10.1109\/SSCI.2016.7850214"},{"key":"761_CR38","doi-asserted-by":"publisher","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength Pareto evolutionary algorithm for multiobjective optimization. In: Proceedings of the fifth conference on evolutionary methods for design, optimization and control with applications to industrial problems, pp 95\u2013100. https:\/\/doi.org\/10.3929\/ethz-a-004284029","DOI":"10.3929\/ethz-a-004284029"},{"issue":"3","key":"761_CR39","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1109\/tevc.2013.2262178","volume":"18","author":"M Li","year":"2014","unstructured":"Li M, Yang S, Liu X (2014) Shift-based density estimation for Pareto-based algorithms in many-objective optimization. IEEE Trans Evol Comput 18(3):348\u2013365. https:\/\/doi.org\/10.1109\/tevc.2013.2262178","journal-title":"IEEE Trans Evol Comput"},{"key":"761_CR40","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:12491\u201312510","journal-title":"Soft Comput"},{"issue":"1","key":"761_CR41","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 multi-objective optimization problems. IEEE Trans Evol Comput 25(1):102\u2013116","journal-title":"IEEE Trans Evol Comput"},{"key":"761_CR42","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:174\u2013188","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"761_CR43","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. Biometrics Bull 1(6):80\u201383","journal-title":"Biometrics Bull"},{"issue":"4","key":"761_CR44","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 Mag 12(4):73\u201387","journal-title":"IEEE Comput Intell Mag Mag"},{"key":"761_CR45","first-page":"2169","volume":"9","author":"W Yang","year":"2021","unstructured":"Yang W, Chen L, Li Y, Zhang J (2021) A constrained multi\/many-objective particle swarm optimization algorithm with a two-level balance scheme. IEEE Access 9:2169\u20133536","journal-title":"IEEE Access"},{"key":"761_CR46","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.3031642","author":"R Jiao","year":"2021","unstructured":"Jiao R, Zeng S, Li C, Yang S, Ong YS (2021) Handling constrained many-objective optimization problems via problem transformation. IEEE Trans Cybernet. https:\/\/doi.org\/10.1109\/TCYB.2020.3031642","journal-title":"IEEE Trans Cybernet"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00761-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-022-00761-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00761-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T12:21:56Z","timestamp":1666873316000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-022-00761-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,19]]},"references-count":46,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["761"],"URL":"https:\/\/doi.org\/10.1007\/s40747-022-00761-2","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,19]]},"assertion":[{"value":"24 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 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 they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}