{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T16:28:03Z","timestamp":1778430483608,"version":"3.51.4"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:00:00Z","timestamp":1699833600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:00:00Z","timestamp":1699833600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072348"],"award-info":[{"award-number":["62072348"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Science and Technology Major Project of Hubei Province","award":["2019AEA170"],"award-info":[{"award-number":["2019AEA170"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s12293-023-00401-3","type":"journal-article","created":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T07:02:15Z","timestamp":1699858935000},"page":"91-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A decomposition-based many-objective evolutionary algorithm with weight grouping and adaptive adjustment"],"prefix":"10.1007","volume":"16","author":[{"given":"Xiaoxin","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7016-3698","authenticated-orcid":false,"given":"Fazhi","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinkun","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tongzhen","family":"Si","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,13]]},"reference":[{"issue":"3","key":"401_CR1","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s12293-021-00330-z","volume":"13","author":"J Chen","year":"2021","unstructured":"Chen J, Ding J, Tan KC, Chen Q (2021) A decomposition-based evolutionary algorithm for scalable multi\/many-objective optimization. Memet Comput 13(3):413\u2013432","journal-title":"Memet Comput"},{"issue":"4","key":"401_CR2","doi-asserted-by":"publisher","first-page":"420","DOI":"10.3390\/math9040420","volume":"9","author":"G Li","year":"2021","unstructured":"Li G, Wang G-G, Wang S (2021) Two-population coevolutionary algorithm with dynamic learning strategy for many-objective optimization. Mathematics 9(4):420","journal-title":"Mathematics"},{"key":"401_CR3","doi-asserted-by":"crossref","unstructured":"Han D, Du W, Du W, Jin Y, Wu C (2019) An adaptive decomposition-based evolutionary algorithm for many-objective optimization. Inf Sci 491:204\u2013222","DOI":"10.1016\/j.ins.2019.03.062"},{"key":"401_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2022.115223","volume":"398","author":"W Zhao","year":"2022","unstructured":"Zhao W, Zhang Z, Mirjalili S, Wang L, Khodadadi N, Mirjalili SM (2022) An effective multi-objective artificial hummingbird algorithm with dynamic elimination-based crowding distance for solving engineering design problems. Comput Methods Appl Mech Eng 398:115223","journal-title":"Comput Methods Appl Mech Eng"},{"key":"401_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108315","volume":"243","author":"L He","year":"2022","unstructured":"He L, Chiong R, Li W, Budhi GS, Zhang Y (2022) A multiobjective evolutionary algorithm for achieving energy efficiency in production environments integrated with multiple automated guided vehicles. Knowl Based Syst 243:108315","journal-title":"Knowl Based Syst"},{"issue":"23\u201324","key":"401_CR6","doi-asserted-by":"publisher","first-page":"7483","DOI":"10.1016\/j.apm.2015.03.022","volume":"39","author":"A Ghane-Kanafi","year":"2015","unstructured":"Ghane-Kanafi A, Khorram E (2015) A new scalarization method for finding the efficient frontier in non-convex multi-objective problems. Appl Math Model 39(23\u201324):7483\u20137498","journal-title":"Appl Math Model"},{"key":"401_CR7","doi-asserted-by":"crossref","unstructured":"Xue Y, Zhu H, Neri F (2022) A self-adaptive multi-objective feature selection approach for classification problems. Integr Comput Aided Eng (Preprint), 1\u201319","DOI":"10.3233\/ICA-210664"},{"key":"401_CR8","doi-asserted-by":"crossref","unstructured":"Zhang H, Wang G-G (2021) Improved NSGA-III using transfer learning and centroid distance for dynamic multi-objective optimization. Complex Intell Syst 1\u201322","DOI":"10.1007\/s40747-021-00570-z"},{"issue":"1","key":"401_CR9","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.swevo.2011.03.001","volume":"1","author":"A Zhou","year":"2011","unstructured":"Zhou A, Qu B-Y, Li H, Zhao S-Z, Suganthan PN, Zhang Q (2011) Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evol Comput 1(1):32\u201349","journal-title":"Swarm Evol Comput"},{"key":"401_CR10","doi-asserted-by":"crossref","unstructured":"Sirbiladze G, Garg H, Ghvaberidze B, Matsaberidze B, Khutsishvili I, Midodashvili B (2022) Uncertainty modeling in multi-objective vehicle routing problem under extreme environment. Artif Intell Rev 1\u201335","DOI":"10.1007\/s10462-022-10169-6"},{"issue":"2","key":"401_CR11","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s12293-021-00351-8","volume":"14","author":"Z Song","year":"2022","unstructured":"Song Z, Wang H, Xu H (2022) A framework for expensive many-objective optimization with Pareto-based bi-indicator infill sampling criterion. Memet Comput 14(2):179\u2013191","journal-title":"Memet Comput"},{"issue":"3","key":"401_CR12","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s12293-021-00331-y","volume":"13","author":"L Zhang","year":"2021","unstructured":"Zhang L, Xie Y, Chen J, Feng L, Chen C, Liu K (2021) A study on multiform multi-objective evolutionary optimization. Memet Comput 13(3):307\u2013318","journal-title":"Memet Comput"},{"issue":"6","key":"401_CR13","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":"1","key":"401_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s12293-021-00325-w","volume":"13","author":"Q Yang","year":"2021","unstructured":"Yang Q, Wang Z, Luo J, He Q (2021) Balancing performance between the decision space and the objective space in multimodal multiobjective optimization. Memet Comput 13(1):31\u201347","journal-title":"Memet Comput"},{"issue":"4","key":"401_CR15","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s12293-021-00349-2","volume":"13","author":"J Yuan","year":"2021","unstructured":"Yuan J (2021) Dynamic grid-based uniform search for solving constrained multiobjective optimization problems. Memet Comput 13(4):497\u2013508","journal-title":"Memet Comput"},{"issue":"4","key":"401_CR16","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1109\/TEVC.2020.2978158","volume":"24","author":"X Ma","year":"2020","unstructured":"Ma X, Yu Y, Li X, Qi Y, Zhu Z (2020) A survey of weight vector adjustment methods for decomposition-based multiobjective evolutionary algorithms. IEEE Trans Evol Comput 24(4):634\u2013649","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"401_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TEVC.2020.3013290","volume":"25","author":"K Shang","year":"2020","unstructured":"Shang K, Ishibuchi H, He L, Pang LM (2020) A survey on the hypervolume indicator in evolutionary multiobjective optimization. IEEE Trans Evol Comput 25(1):1\u201320","journal-title":"IEEE Trans Evol Comput"},{"key":"401_CR18","doi-asserted-by":"crossref","unstructured":"Camacho A, Toscano G, Landa R, Ishibuchi H (2019) Indicator-based weight adaptation for solving many-objective optimization problems. In: International conference on evolutionary multi-criterion optimization. Springer, pp 216\u2013228","DOI":"10.1007\/978-3-030-12598-1_18"},{"key":"401_CR19","doi-asserted-by":"crossref","unstructured":"Jain H, Deb K (2013) An improved adaptive approach for elitist nondominated sorting genetic algorithm for many-objective optimization. In: International conference on evolutionary multi-criterion optimization. Springer, pp. 307\u2013321","DOI":"10.1007\/978-3-642-37140-0_25"},{"key":"401_CR20","doi-asserted-by":"publisher","first-page":"11767","DOI":"10.1007\/s00521-019-04660-5","volume":"32","author":"R Fan","year":"2020","unstructured":"Fan R, Wei L, Sun H, Hu Z (2020) An enhanced reference vectors-based multi-objective evolutionary algorithm with neighborhood-based adaptive adjustment. Neural Comput Appl 32:11767\u201311789","journal-title":"Neural Comput Appl"},{"key":"401_CR21","doi-asserted-by":"crossref","unstructured":"Xue Y, Zhu H, Neri F (2023) A feature selection approach based on nsga-ii with relieff. Appl Soft Comput 109987","DOI":"10.1016\/j.asoc.2023.109987"},{"key":"401_CR22","doi-asserted-by":"crossref","unstructured":"Ma X, Sun H, Hu Z, Wei L, Yang J (2023) Multi-spatial information joint guidance evolutionary algorithm for dynamic multi-objective optimization with a changing number of objectives. Neural Comput Appl 1\u201333","DOI":"10.1007\/s00521-023-08369-4"},{"key":"401_CR23","doi-asserted-by":"crossref","unstructured":"Jin Y, Okabe T, Sendho B (2001) Adapting weighted aggregation for multiobjective evolution strategies. In: International conference on evolutionary multi-criterion optimization. Springer, pp 96\u2013110","DOI":"10.1007\/3-540-44719-9_7"},{"issue":"4","key":"401_CR24","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1109\/TEVC.2002.802873","volume":"6","author":"A Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz A (2002) On the performance of multiple-objective genetic local search on the 0\/1 knapsack problem-a comparative experiment. IEEE Trans Evol Comput 6(4):402\u2013412","journal-title":"IEEE Trans Evol Comput"},{"issue":"5(B)","key":"401_CR25","first-page":"3677","volume":"8","author":"F Gu","year":"2012","unstructured":"Gu F, Liu H-L, Tan KC (2012) A multiobjective evolutionary algorithm using dynamic weight design method. Int J Innov Comput Inf Control 8(5(B)):3677\u20133688","journal-title":"Int J Innov Comput Inf Control"},{"issue":"3","key":"401_CR26","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"},{"key":"401_CR27","doi-asserted-by":"crossref","unstructured":"Liu H-L, Gu F-Q, Cheung Y-M (2010) T-MOEA\/D: MOEA\/D with objective transform in multi-objective problems. In: 2010 international conference of information science and management engineering. IEEE, vol 2, pp 282\u2013285","DOI":"10.1109\/ISME.2010.274"},{"issue":"4","key":"401_CR28","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"},{"key":"401_CR29","doi-asserted-by":"crossref","unstructured":"Zhu C, Cai X, Fan Z, Sulaman M (2016) A two-phase many-objective evolutionary algorithm with penalty based adjustment for reference lines. In: 2016 IEEE congress on evolutionary computation (CEC). IEEE, pp 2161\u20132168","DOI":"10.1109\/CEC.2016.7744055"},{"issue":"2","key":"401_CR30","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\u2013264","journal-title":"Evol Comput"},{"key":"401_CR31","doi-asserted-by":"crossref","unstructured":"de Farias LR, Braga PH, Bassani HF, Ara\u00fajo AF (2018) MOEA\/D with uniformly randomly adaptive weights. In: Proceedings of the genetic and evolutionary computation conference, pp 641\u2013648","DOI":"10.1145\/3205455.3205648"},{"issue":"4","key":"401_CR32","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1162\/EVCO_a_00038","volume":"19","author":"H Li","year":"2011","unstructured":"Li H, Landa-Silva D (2011) An adaptive evolutionary multi-objective approach based on simulated annealing. Evol Comput 19(4):561\u2013595","journal-title":"Evol Comput"},{"issue":"2","key":"401_CR33","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1109\/TCYB.2017.2779450","volume":"49","author":"H Xu","year":"2017","unstructured":"Xu H, Zeng W, Zhang D, Zeng X (2017) MOEA\/HD: a multiobjective evolutionary algorithm based on hierarchical decomposition. IEEE Trans Cybern 49(2):517\u2013526","journal-title":"IEEE Trans Cybern"},{"issue":"4","key":"401_CR34","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1109\/TEVC.2012.2204264","volume":"17","author":"R Wang","year":"2012","unstructured":"Wang R, Purshouse RC, Fleming PJ (2012) Preference-inspired coevolutionary algorithms for many-objective optimization. IEEE Trans Evol Comput 17(4):474\u2013494","journal-title":"IEEE Trans Evol Comput"},{"key":"401_CR35","doi-asserted-by":"crossref","unstructured":"Wang R, Purshouse RC, Fleming PJ (2013) On finding well-spread Pareto optimal solutions by preference-inspired co-evolutionary algorithm. In: Proceedings of the 15th annual conference on genetic and evolutionary computation, pp 695\u2013702","DOI":"10.1145\/2463372.2463444"},{"issue":"2","key":"401_CR36","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":"401_CR37","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.swevo.2017.01.002","volume":"34","author":"Z Wang","year":"2017","unstructured":"Wang Z, Zhang Q, Li H, Ishibuchi H, Jiao L (2017) On the use of two reference points in decomposition based multiobjective evolutionary algorithms. Swarm Evol Comput 34:89\u2013102","journal-title":"Swarm Evol Comput"},{"key":"401_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100980","volume":"68","author":"LR de Farias","year":"2022","unstructured":"de Farias LR, Ara\u00fajo AF (2022) A decomposition-based many-objective evolutionary algorithm updating weights when required. Swarm Evol Comput 68:100980","journal-title":"Swarm Evol Comput"},{"key":"401_CR39","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.ins.2021.03.067","volume":"572","author":"Y Liu","year":"2021","unstructured":"Liu Y, Hu Y, Zhu N, Li K, Zou J, Li M (2021) A decomposition-based multiobjective evolutionary algorithm with weights updated adaptively. Inf Sci 572:343\u2013377","journal-title":"Inf Sci"},{"key":"401_CR40","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. IEEE, pp 203\u2013208","DOI":"10.1109\/CEC.2009.4982949"},{"issue":"4","key":"401_CR41","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":"1","key":"401_CR42","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TEVC.2020.2999100","volume":"25","author":"J Yuan","year":"2021","unstructured":"Yuan J, Liu H-L, Gu F, Zhang Q, He Z (2021) Investigating the properties of indicators and an evolutionary many-objective algorithm using promising regions. IEEE Trans Evol Comput 25(1):75\u201386","journal-title":"IEEE Trans Evol Comput"},{"key":"401_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106619","volume":"212","author":"M Abdel-Basset","year":"2021","unstructured":"Abdel-Basset M, Mohamed R, Mirjalili S (2021) A novel whale optimization algorithm integrated with Nelder\u2013Mead simplex for multi-objective optimization problems. Knowl Based Syst 212:106619","journal-title":"Knowl Based Syst"},{"issue":"5","key":"401_CR44","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":"401_CR45","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. Complex Intell Syst 3(1):67\u201381","journal-title":"Complex Intell Syst"},{"key":"401_CR46","doi-asserted-by":"crossref","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","DOI":"10.1109\/TEVC.2018.2844286"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-023-00401-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-023-00401-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-023-00401-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,16]],"date-time":"2024-03-16T11:17:39Z","timestamp":1710587859000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-023-00401-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,13]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["401"],"URL":"https:\/\/doi.org\/10.1007\/s12293-023-00401-3","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,13]]},"assertion":[{"value":"14 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2023","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"}}]}}