{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T13:23:06Z","timestamp":1784812986803,"version":"3.55.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T00:00:00Z","timestamp":1621900800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T00:00:00Z","timestamp":1621900800000},"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":["61876164"],"award-info":[{"award-number":["61876164"]}],"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":["61673331"],"award-info":[{"award-number":["61673331"]}],"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":["61772178"],"award-info":[{"award-number":["61772178"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009377","name":"Education Department of Hunan Province","doi-asserted-by":"crossref","award":["17A212"],"award-info":[{"award-number":["17A212"]}],"id":[{"id":"10.13039\/100009377","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012245","name":"Science and Technology Planning Project of Guangdong Province","doi-asserted-by":"crossref","award":["2017B010111005"],"award-info":[{"award-number":["2017B010111005"]}],"id":[{"id":"10.13039\/501100012245","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002767","name":"Hunan Provincial Science and Technology Department","doi-asserted-by":"crossref","award":["2018 TP1036"],"award-info":[{"award-number":["2018 TP1036"]}],"id":[{"id":"10.13039\/501100002767","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s00500-021-05880-5","type":"journal-article","created":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T16:03:07Z","timestamp":1621958587000},"page":"8051-8062","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":42,"title":["An infeasible solutions diversity maintenance epsilon constraint handling method for evolutionary constrained multiobjective optimization"],"prefix":"10.1007","volume":"25","author":[{"given":"Jinlong","family":"Zhou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juan","family":"Zou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinhua","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shengxiang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dunwei","family":"Gong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tingrui","family":"Pei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,5,25]]},"reference":[{"issue":"17","key":"5880_CR1","doi-asserted-by":"publisher","first-page":"5159","DOI":"10.1007\/s00500-016-2112-3","volume":"21","author":"V Agrawal","year":"2017","unstructured":"Agrawal V, Lightner C, Lightner-Laws C, Wagner N (2017) A bi-criteria evolutionary algorithm for a constrained multi-depot vehicle routing problem. Soft Comput 21(17):5159\u20135178","journal-title":"Soft Comput"},{"issue":"5","key":"5880_CR2","doi-asserted-by":"publisher","first-page":"1723","DOI":"10.1007\/s00500-017-2895-x","volume":"23","author":"M Arzamendia","year":"2019","unstructured":"Arzamendia M, Gregor D, Reina DG, Toral SL (2019) An evolutionary approach to constrained path planning of an autonomous surface vehicle for maximizing the covered area of ypacarai lake. Soft Comput 23(5):1723\u20131734","journal-title":"Soft Comput"},{"issue":"10","key":"5880_CR3","doi-asserted-by":"publisher","first-page":"1893","DOI":"10.1007\/s00500-013-1028-4","volume":"17","author":"X Cai","year":"2013","unstructured":"Cai X, Hu Z, Fan Z (2013) A novel memetic algorithm based on invasive weed optimization and differential evolution for constrained optimization. Soft Comput 17(10):1893\u20131910","journal-title":"Soft Comput"},{"key":"5880_CR4","volume-title":"Evolutionary algorithms for solving multi-objective problems,","author":"CAC Coello","year":"2007","unstructured":"Coello CAC, Lamont GB, Van Veldhuizen DA et al (2007) Evolutionary algorithms for solving multi-objective problems, vol 5. Springer, Berlin"},{"key":"5880_CR5","volume-title":"Multi-objective optimization using evolutionary algorithms,","author":"K Deb","year":"2001","unstructured":"Deb K (2001) Multi-objective optimization using evolutionary algorithms, vol 16. John Wiley & Sons, New York"},{"issue":"2","key":"5880_CR6","first-page":"115","volume":"9","author":"K Deb","year":"1995","unstructured":"Deb K, Agrawal RB et al (1995) Simulated binary crossover for continuous search space. Complex Syst 9(2):115\u2013148","journal-title":"Complex Syst"},{"issue":"2","key":"5880_CR7","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":"5880_CR8","doi-asserted-by":"crossref","unstructured":"Fan Z, Fang Y, Li W, Lu J, Cai X, Wei C (2017) A comparative study of constrained multi-objective evolutionary algorithms on constrained multi-objective optimization problems. In: 2017 IEEE congress on evolutionary computation (CEC), IEEE, pp 209\u2013216","DOI":"10.1109\/CEC.2017.7969315"},{"key":"5880_CR9","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 (2019a) 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":"23","key":"5880_CR10","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 (2019b) An improved epsilon constraint-handling method in MOEA\/D for CMOPs with large infeasible regions. Soft Comput 23(23):12491\u201312510","journal-title":"Soft Comput"},{"issue":"4","key":"5880_CR11","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":"5880_CR12","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"},{"issue":"6","key":"5880_CR13","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":"5880_CR14","doi-asserted-by":"crossref","unstructured":"Ma Z, Wang Y, Song W (2019) A new fitness function with two rankings for evolutionary constrained multiobjective optimization. IEEE Trans Syst Man Cybernet Syst","DOI":"10.1109\/TSMC.2019.2943973"},{"key":"5880_CR15","volume-title":"Nonlinear multiobjective optimization","author":"K Miettinen","year":"2012","unstructured":"Miettinen K (2012) Nonlinear multiobjective optimization, vol 12. Springer Science & Business Media, Berlin"},{"key":"5880_CR16","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","volume":"96","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S (2016) SCA: a sine cosine algorithm for solving optimization problems. Knowl-Based Syst 96:120\u2013133","journal-title":"Knowl-Based Syst"},{"key":"5880_CR17","unstructured":"Takahama T, Sakai S (2006) Constrained optimization by the $$\\epsilon $$ constrained differential evolution with gradient-based mutation and feasible elites. In: 2006 IEEE international conference on evolutionary computation, pp 1\u20138"},{"issue":"4","key":"5880_CR18","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 [educational forum]. IEEE Comput Intell Mag 12(4):73\u201387","journal-title":"IEEE Comput Intell Mag"},{"issue":"7","key":"5880_CR19","doi-asserted-by":"publisher","first-page":"1482","DOI":"10.1109\/TSMC.2018.2807785","volume":"49","author":"BC Wang","year":"2018","unstructured":"Wang BC, Li HX, Li JP, Wang Y (2018) Composite differential evolution for constrained evolutionary optimization. IEEE Trans Syst Man Cybernet Syst 49(7):1482\u20131495","journal-title":"IEEE Trans Syst Man Cybernet Syst"},{"issue":"1","key":"5880_CR20","doi-asserted-by":"publisher","first-page":"11","DOI":"10.3724\/SP.J.1001.2009.00011","volume":"20","author":"Y Wang","year":"2009","unstructured":"Wang Y, Cai ZX, Zhou YR, Xiao CX (2009) Constrained optimization evolutionary algorithms. J Softw 20(1):11\u201329","journal-title":"J Softw"},{"issue":"1","key":"5880_CR21","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","journal-title":"IEEE Trans Evol Comput"},{"key":"5880_CR22","doi-asserted-by":"crossref","unstructured":"Yang Z, Cai X, Fan Z (2014) Epsilon constrained method for constrained multiobjective optimization problems: some preliminary results. In: Proceedings of the companion publication of the 2014 annual conference on genetic and evolutionary computation, pp 1181\u20131186","DOI":"10.1145\/2598394.2610012"},{"key":"5880_CR23","doi-asserted-by":"publisher","first-page":"99740","DOI":"10.1109\/ACCESS.2020.2997783","volume":"8","author":"J Zhang","year":"2020","unstructured":"Zhang J, Wang J (2020) Improved salp swarm algorithm based on levy flight and sine cosine operator. IEEE Access 8:99740\u201399771","journal-title":"IEEE Access"},{"issue":"6","key":"5880_CR24","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"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05880-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-05880-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05880-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,14]],"date-time":"2021-06-14T13:28:33Z","timestamp":1623677313000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-05880-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,25]]},"references-count":24,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["5880"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-05880-5","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,25]]},"assertion":[{"value":"10 May 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2021","order":2,"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 conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"This article does not contain any studies involving animals performed by any of the authors. This article does not contain any studies involving human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical standard"}}]}}