{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T20:19:14Z","timestamp":1783196354854,"version":"3.54.6"},"reference-count":52,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T00:00:00Z","timestamp":1776470400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100013061","name":"Jilin Scientific and Technological Development Program","doi-asserted-by":"publisher","award":["20250201080GX"],"award-info":[{"award-number":["20250201080GX"]}],"id":[{"id":"10.13039\/501100013061","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["42575159"],"award-info":[{"award-number":["42575159"]}],"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":["42275155"],"award-info":[{"award-number":["42275155"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Swarm and Evolutionary Computation"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.swevo.2026.102389","type":"journal-article","created":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:24:06Z","timestamp":1777595046000},"page":"102389","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Dynamic auxiliary reference vector-based many-objective evolutionary algorithm with adaptive multi-population collaboration"],"prefix":"10.1016","volume":"105","author":[{"given":"Zhanjie","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5932-7492","authenticated-orcid":false,"given":"Yifei","family":"Yao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Du","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Renyun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaojing","family":"Feng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenwei","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.swevo.2026.102389_b1","series-title":"2002 Annual Meeting of the North American Fuzzy Information Processing Society Proceedings. NAFIPS-FLINT 2002 (Cat. No. 02TH8622)","first-page":"233","article-title":"On the optimal solution definition for many-criteria optimization problems","author":"Farina","year":"2002"},{"key":"10.1016\/j.swevo.2026.102389_b2","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.ins.2018.07.012","article-title":"Entropy based evolutionary algorithm with adaptive reference points for many-objective optimization problems","volume":"465","author":"Zhou","year":"2018","journal-title":"Inform. Sci.","ISSN":"https:\/\/id.crossref.org\/issn\/0020-0255","issn-type":"print"},{"issue":"3","key":"10.1016\/j.swevo.2026.102389_b3","doi-asserted-by":"crossref","first-page":"732","DOI":"10.1016\/j.ejor.2015.06.071","article-title":"A novel multi-objective particle swarm optimization with multiple search strategies","volume":"247","author":"Lin","year":"2015","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.swevo.2026.102389_b4","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101601","article-title":"An adaptive reference vector guided many-objective optimization algorithm based on the pareto front density estimation","volume":"88","author":"Xu","year":"2024","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.swevo.2026.102389_b5","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2024.111369","article-title":"A many-objective evolutionary algorithm based on reference vector guided selection and two diversity and convergence enhancement strategies","volume":"154","author":"Yang","year":"2024","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.swevo.2026.102389_b6","first-page":"825","article-title":"Scalable multi-objective optimization test problems","volume":"vol. 1","author":"Deb","year":"2002"},{"issue":"6","key":"10.1016\/j.swevo.2026.102389_b7","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1109\/TEVC.2007.910138","article-title":"On the evolutionary optimization of many conflicting objectives","volume":"11","author":"Purshouse","year":"2007","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"10.1016\/j.swevo.2026.102389_b8","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/TEVC.2015.2420112","article-title":"A new dominance relation-based evolutionary algorithm for many-objective optimization","volume":"20","author":"Yuan","year":"2015","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"7","key":"10.1016\/j.swevo.2026.102389_b9","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1109\/TSMC.2017.2654301","article-title":"A new decomposition-based NSGA-II for many-objective optimization","volume":"48","author":"Elarbi","year":"2017","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."},{"key":"10.1016\/j.swevo.2026.102389_b10","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2024.111505","article-title":"A Pareto dominance relation based on reference vectors for evolutionary many-objective optimization","volume":"157","author":"Wang","year":"2024","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"10.1016\/j.swevo.2026.102389_b11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/TEVC.2005.851275","article-title":"A faster algorithm for calculating hypervolume","volume":"10","author":"While","year":"2006","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.swevo.2026.102389_b12","series-title":"International Conference on Evolutionary Multi-Criterion Optimization","first-page":"76","article-title":"Pareto cone \u025b-dominance: improving convergence and diversity in multiobjective evolutionary algorithms","author":"Batista","year":"2011"},{"issue":"1","key":"10.1016\/j.swevo.2026.102389_b13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1162\/EVCO_a_00009","article-title":"HypE: An algorithm for fast hypervolume-based many-objective optimization","volume":"19","author":"Bader","year":"2011","journal-title":"Evol. Comput."},{"issue":"1","key":"10.1016\/j.swevo.2026.102389_b14","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/TEVC.2020.2999100","article-title":"Investigating the properties of indicators and an evolutionary many-objective algorithm using promising regions","volume":"25","author":"Yuan","year":"2020","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.swevo.2026.102389_b15","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/j.ins.2021.03.008","article-title":"On the estimation of pareto front and dimensional similarity in many-objective evolutionary algorithm","volume":"563","author":"Li","year":"2021","journal-title":"Inform. Sci."},{"issue":"6","key":"10.1016\/j.swevo.2026.102389_b16","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","article-title":"MOEA\/D: A multiobjective evolutionary algorithm based on decomposition","volume":"11","author":"Zhang","year":"2007","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"10.1016\/j.swevo.2026.102389_b17","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1109\/TEVC.2013.2281533","article-title":"Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems","volume":"18","author":"Liu","year":"2013","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"10.1016\/j.swevo.2026.102389_b18","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1109\/TEVC.2016.2519378","article-title":"A reference vector guided evolutionary algorithm for many-objective optimization","volume":"20","author":"Cheng","year":"2016","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"10.1016\/j.swevo.2026.102389_b19","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1137\/S1052623496307510","article-title":"Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems","volume":"8","author":"Das","year":"1998","journal-title":"SIAM J. Optim."},{"issue":"2","key":"10.1016\/j.swevo.2026.102389_b20","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TEVC.2008.925798","article-title":"Multiobjective optimization problems with complicated Pareto sets, MOEA\/D and NSGA-II","volume":"13","author":"Li","year":"2008","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"10.1016\/j.swevo.2026.102389_b21","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","article-title":"An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints","volume":"18","author":"Deb","year":"2013","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"10.1016\/j.swevo.2026.102389_b22","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TEVC.2020.2992387","article-title":"Generating well-spaced points on a unit simplex for evolutionary many-objective optimization","volume":"25","author":"Blank","year":"2020","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"10.1016\/j.swevo.2026.102389_b23","doi-asserted-by":"crossref","first-page":"1648","DOI":"10.1016\/j.cor.2012.01.001","article-title":"MOEA\/D+ uniform design: A new version of MOEA\/D for optimization problems with many objectives","volume":"40","author":"Tan","year":"2013","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.swevo.2026.102389_b24","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1109\/TEVC.2016.2592479","article-title":"A strength Pareto evolutionary algorithm based on reference direction for multiobjective and many-objective optimization","volume":"21","author":"Jiang","year":"2017","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"12","key":"10.1016\/j.swevo.2026.102389_b25","doi-asserted-by":"crossref","first-page":"2541","DOI":"10.1007\/s00500-014-1234-8","article-title":"MOEA\/D with uniform decomposition measurement for many-objective problems","volume":"18","author":"Ma","year":"2014","journal-title":"Soft Comput."},{"issue":"4","key":"10.1016\/j.swevo.2026.102389_b26","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1109\/TEVC.2020.2978158","article-title":"A survey of weight vector adjustment methods for decomposition-based multiobjective evolutionary algorithms","volume":"24","author":"Ma","year":"2020","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"10.1016\/j.swevo.2026.102389_b27","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1109\/TEVC.2017.2725902","article-title":"Adaptively allocating search effort in challenging many-objective optimization problems","volume":"22","author":"Liu","year":"2017","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"10.1016\/j.swevo.2026.102389_b28","first-page":"439","article-title":"Adapting reference vectors and scalarizing functions by growing neural gas to handle irregular Pareto fronts","volume":"24","author":"Liu","year":"2020","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"10.1016\/j.swevo.2026.102389_b29","doi-asserted-by":"crossref","first-page":"2698","DOI":"10.1109\/TCYB.2020.3020630","article-title":"An adaptive reference vector-guided evolutionary algorithm using growing neural gas for many-objective optimization of irregular problems","volume":"52","author":"Liu","year":"2020","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.swevo.2026.102389_b30","series-title":"A weight adaptation trigger mechanism in decomposition-based evolutionary multi-objective optimisation","author":"Han","year":"2025"},{"issue":"2","key":"10.1016\/j.swevo.2026.102389_b31","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1162\/evco_a_00269","article-title":"What weights work for you? Adapting weights for any Pareto front shape in decomposition-based evolutionary multiobjective optimisation","volume":"28","author":"Li","year":"2020","journal-title":"Evol. Comput."},{"key":"10.1016\/j.swevo.2026.102389_b32","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101601","article-title":"An adaptive reference vector guided many-objective optimization algorithm based on the pareto front density estimation","volume":"88","author":"Xu","year":"2024","journal-title":"Swarm Evol. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/2210-6502","issn-type":"print"},{"issue":"2","key":"10.1016\/j.swevo.2026.102389_b33","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1109\/TCYB.2020.2971638","article-title":"A self-guided reference vector strategy for many-objective optimization","volume":"52","author":"Liu","year":"2022","journal-title":"IEEE Trans. Cybern.","ISSN":"https:\/\/id.crossref.org\/issn\/2168-2267","issn-type":"print"},{"key":"10.1016\/j.swevo.2026.102389_b34","series-title":"2019 IEEE Congress on Evolutionary Computation","first-page":"1726","article-title":"Adaptation of reference vectors for evolutionary many-objective optimization of problems with irregular Pareto fronts","author":"Liu","year":"2019"},{"key":"10.1016\/j.swevo.2026.102389_b35","doi-asserted-by":"crossref","first-page":"152169","DOI":"10.1109\/ACCESS.2021.3126292","article-title":"A new decomposition-based many-objective algorithm based on adaptive reference vectors and fractional dominance relation","volume":"9","author":"Zhang","year":"2021","journal-title":"IEEE Access"},{"issue":"1","key":"10.1016\/j.swevo.2026.102389_b36","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/TEVC.2023.3260306","article-title":"A multipopulation evolutionary algorithm using new cooperative mechanism for solving multiobjective problems with multiconstraint","volume":"28","author":"Zou","year":"2023","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"10.1016\/j.swevo.2026.102389_b37","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1007\/s10589-022-00348-0","article-title":"Clustering-based multipopulation approaches in MOEA\/D for many-objective problems","volume":"81","author":"von L\u00fccken","year":"2022","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"10.1016\/j.swevo.2026.102389_b38","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1109\/TCYB.2018.2871473","article-title":"A multipopulation-based multiobjective evolutionary algorithm","volume":"50","author":"Ma","year":"2018","journal-title":"IEEE Trans. Cybern."},{"issue":"2","key":"10.1016\/j.swevo.2026.102389_b39","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/s10489-018-1263-6","article-title":"An improved adaptive NSGA-II with multi-population algorithm","volume":"49","author":"Zhao","year":"2019","journal-title":"Appl. Intell."},{"key":"10.1016\/j.swevo.2026.102389_b40","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.120913","article-title":"An adaptive strategy based multi-population multi-objective optimization algorithm","volume":"686","author":"Zhao","year":"2025","journal-title":"Inform. Sci."},{"issue":"5","key":"10.1016\/j.swevo.2026.102389_b41","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1109\/TEVC.2018.2882166","article-title":"A new two-stage evolutionary algorithm for many-objective optimization","volume":"23","author":"Sun","year":"2018","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"7","key":"10.1016\/j.swevo.2026.102389_b42","doi-asserted-by":"crossref","first-page":"3367","DOI":"10.1109\/TCYB.2019.2899225","article-title":"Hyperplane assisted evolutionary algorithm for many-objective optimization problems","volume":"50","author":"Chen","year":"2019","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.swevo.2026.102389_b43","article-title":"A many-objective optimization evolutionary algorithm based on hyper-dominance degree","volume":"83","author":"Liu","year":"2023","journal-title":"Swarm Evol. Comput."},{"issue":"4","key":"10.1016\/j.swevo.2026.102389_b44","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/MCI.2017.2742868","article-title":"PlatEMO: A MATLAB platform for evolutionary multi-objective optimization [educational forum]","volume":"12","author":"Tian","year":"2017","journal-title":"IEEE Comput. Intell. Mag."},{"issue":"2","key":"10.1016\/j.swevo.2026.102389_b45","first-page":"115","article-title":"Simulated binary crossover for continuous search space","volume":"9","author":"Deb","year":"1995","journal-title":"Complex Systems"},{"key":"10.1016\/j.swevo.2026.102389_b46","series-title":"Multi-Objective Optimization Using Evolutionary Algorithms","author":"Deb","year":"2001"},{"issue":"2","key":"10.1016\/j.swevo.2026.102389_b47","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1109\/TEVC.2018.2866854","article-title":"A strengthened dominance relation considering convergence and diversity for evolutionary many-objective optimization","volume":"23","author":"Tian","year":"2018","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"10.1016\/j.swevo.2026.102389_b48","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/TEVC.2005.861417","article-title":"A review of multiobjective test problems and a scalable test problem toolkit","volume":"10","author":"Huband","year":"2006","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"10.1016\/j.swevo.2026.102389_b49","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s40747-017-0039-7","article-title":"A benchmark test suite for evolutionary many-objective optimization","volume":"3","author":"Cheng","year":"2017","journal-title":"Complex & Intell. Syst."},{"issue":"2","key":"10.1016\/j.swevo.2026.102389_b50","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/TEVC.2018.2791283","article-title":"IGD indicator-based evolutionary algorithm for many-objective optimization problems","volume":"23","author":"Sun","year":"2018","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.swevo.2026.102389_b51","series-title":"International Conference on Evolutionary Multi-Criterion Optimization","first-page":"110","article-title":"Modified distance calculation in generational distance and inverted generational distance","author":"Ishibuchi","year":"2015"},{"key":"10.1016\/j.swevo.2026.102389_b52","series-title":"Encyclopedia of Systems Biology","first-page":"2354","article-title":"Wilcoxon rank sum test","author":"Haynes","year":"2013"}],"container-title":["Swarm and Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2210650226001094?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2210650226001094?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T20:01:21Z","timestamp":1783195281000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2210650226001094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":52,"alternative-id":["S2210650226001094"],"URL":"https:\/\/doi.org\/10.1016\/j.swevo.2026.102389","relation":{},"ISSN":["2210-6502"],"issn-type":[{"value":"2210-6502","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Dynamic auxiliary reference vector-based many-objective evolutionary algorithm with adaptive multi-population collaboration","name":"articletitle","label":"Article Title"},{"value":"Swarm and Evolutionary Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.swevo.2026.102389","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"102389"}}