{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T12:07:34Z","timestamp":1777637254898,"version":"3.51.4"},"reference-count":55,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61773410"],"award-info":[{"award-number":["61773410"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1016\/j.asoc.2019.105731","type":"journal-article","created":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T11:55:46Z","timestamp":1566820546000},"page":"105731","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":12,"special_numbering":"C","title":["Many-objective evolutionary algorithm based on adaptive weighted decomposition"],"prefix":"10.1016","volume":"84","author":[{"given":"Siyu","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyu","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuren","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.asoc.2019.105731_b1","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5563-6","article-title":"Nonlinear Multiobjective Optimization","author":"Miettinen","year":"1998"},{"key":"10.1016\/j.asoc.2019.105731_b2","series-title":"Wiley-Interscience series in systems and optimization","article-title":"Multi-Objective Optimization using Evolutionary Algorithms","author":"Deb","year":"2001"},{"key":"10.1016\/j.asoc.2019.105731_b3","series-title":"Proceedings of the 3rd Annual Conference on Genetic and Evolutionary Computation","first-page":"283","article-title":"PESA-II: Region-based selection in evolutionary multiobjective optimization","author":"Corne","year":"2001"},{"issue":"2","key":"10.1016\/j.asoc.2019.105731_b4","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.asoc.2019.105731_b5","series-title":"SPEA2: Improving the Strength Pareto Evolutionary Algorithm for Multiobjective Optimization","author":"Zitzler","year":"2002"},{"issue":"1","key":"10.1016\/j.asoc.2019.105731_b6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2792984","article-title":"Many-objective evolutionary algorithms: A survey","volume":"48","author":"Li","year":"2015","journal-title":"ACM Comput. Surv."},{"issue":"6","key":"10.1016\/j.asoc.2019.105731_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.asoc.2019.105731_b8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/TEVC.2016.2623770","article-title":"On the performance degradation of dominance-based evolutionary algorithms in many-objective optimization","volume":"22","author":"Santos","year":"2018","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"10.1016\/j.asoc.2019.105731_b9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1162\/106365602760234108","article-title":"Combining convergence and diversity in evolutionary multiobjective optimization","volume":"10","author":"Laumanns","year":"2002","journal-title":"Evol. Comput."},{"issue":"4","key":"10.1016\/j.asoc.2019.105731_b10","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1162\/evco.2007.15.4.493","article-title":"Pareto-adaptive \u03f5-dominance","volume":"15","author":"Hern\u00e1ndez-D\u00edaz","year":"2007","journal-title":"Evol. Comput."},{"key":"10.1016\/j.asoc.2019.105731_b11","series-title":"IEEE Congress on Evolutionary Computation, 2007","first-page":"3983","article-title":"Ranking-dominance and many-objective optimization","author":"Kukkonen","year":"2007"},{"issue":"5","key":"10.1016\/j.asoc.2019.105731_b12","doi-asserted-by":"crossref","first-page":"1402","DOI":"10.1109\/TSMCB.2008.926329","article-title":"A new evolutionary algorithm for solving many-objective optimization problems","volume":"38","author":"Zou","year":"2008","journal-title":"IEEE Trans. Syst. Man Cybern. B"},{"issue":"3","key":"10.1016\/j.asoc.2019.105731_b13","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1109\/TEVC.2013.2262178","article-title":"Shift-based density estimation for pareto-based algorithms in many-objective optimization","volume":"18","author":"Li","year":"2014","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"10.1016\/j.asoc.2019.105731_b14","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1109\/TEVC.2010.2058117","article-title":"Diversity management in evolutionary many-objective optimization","volume":"15","author":"Adra","year":"2011","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"10.1016\/j.asoc.2019.105731_b15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1109\/TEVC.2016.2587808","article-title":"A vector angle-based evolutionary algorithm for unconstrained many-objective optimization","volume":"21","author":"Xiang","year":"2017","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"10.1016\/j.asoc.2019.105731_b16","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1109\/TEVC.2013.2281525","article-title":"Quick hypervolume","volume":"18","author":"Russo","year":"2014","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"10.1016\/j.asoc.2019.105731_b17","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":"3","key":"10.1016\/j.asoc.2019.105731_b18","doi-asserted-by":"crossref","first-page":"1653","DOI":"10.1016\/j.ejor.2006.08.008","article-title":"SMS-EMOA: Multiobjective selection based on dominated hypervolume","volume":"181","author":"Beume","year":"2007","journal-title":"European J. Oper. Res."},{"issue":"6\u20137","key":"10.1016\/j.asoc.2019.105731_b19","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1016\/j.comgeo.2010.03.004","article-title":"Approximating the volume of unions and intersections of high-dimensional geometric objects","volume":"43","author":"Bringmann","year":"2010","journal-title":"Comput. Geom."},{"key":"10.1016\/j.asoc.2019.105731_b20","first-page":"62","article-title":"An EMO algorithm using the hypervolume measure as selection criterion","volume":"vol. 3410","author":"Emmerich","year":"2005"},{"key":"10.1016\/j.asoc.2019.105731_b21","series-title":"Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation","first-page":"465","article-title":"On the properties of the R2 indicator","author":"Brockhoff","year":"2012"},{"issue":"4","key":"10.1016\/j.asoc.2019.105731_b22","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TEVC.2011.2161872","article-title":"Using the averaged hausdorff distance as a performance measure in evolutionary multiobjective optimization","volume":"16","author":"Schutze","year":"2012","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"10.1016\/j.asoc.2019.105731_b23","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":"4","key":"10.1016\/j.asoc.2019.105731_b24","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":"2014","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"10.1016\/j.asoc.2019.105731_b25","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/TEVC.2014.2339823","article-title":"A decomposition-based evolutionary algorithm for many objective optimization","volume":"19","author":"Asafuddoula","year":"2015","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"10.1016\/j.asoc.2019.105731_b26","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1109\/TEVC.2014.2373386","article-title":"An evolutionary many-objective optimization algorithm based on dominance and decomposition","volume":"19","author":"Li","year":"2015","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"10.1016\/j.asoc.2019.105731_b27","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":"1","key":"10.1016\/j.asoc.2019.105731_b28","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":"2016","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"10.1016\/j.asoc.2019.105731_b29","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":"3","key":"10.1016\/j.asoc.2019.105731_b30","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.asoc.2019.105731_b31","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1109\/TEVC.2016.2587749","article-title":"Performance of decomposition-based many-objective algorithms strongly depends on Pareto front shapes","volume":"21","author":"Ishibuchi","year":"2017","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.asoc.2019.105731_b32","first-page":"1","article-title":"Global WASF-GA: An evolutionary algorithm in multiobjective optimization to approximate the whole Pareto optimal front","author":"Saborido","year":"2016","journal-title":"Evol. Comput."},{"issue":"2","key":"10.1016\/j.asoc.2019.105731_b33","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1109\/TCYB.2015.2403131","article-title":"An improved multiobjective optimization evolutionary algorithm based on decomposition for complex Pareto fronts","volume":"46","author":"Jiang","year":"2016","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.asoc.2019.105731_b34","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.swevo.2017.01.002","article-title":"On the use of two reference points in decomposition based multiobjective evolutionary algorithms","volume":"34","author":"Wang","year":"2017","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.asoc.2019.105731_b35","first-page":"1","article-title":"A decomposition-based many-objective evolutionary algorithm with two types of adjustments for direction vectors","author":"Cai","year":"2017","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.asoc.2019.105731_b36","first-page":"1260","article-title":"Multiobjective optimization by decomposition with pareto-adaptive weight vectors","volume":"vol. 3","author":"Jiang","year":"2011"},{"key":"10.1016\/j.asoc.2019.105731_b37","first-page":"1","article-title":"A decomposition-based multiobjective evolutionary algorithm with adaptive weight adjustment","volume":"2018","author":"Dai","year":"2018","journal-title":"Complexity"},{"issue":"4","key":"10.1016\/j.asoc.2019.105731_b38","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1109\/TEVC.2013.2281534","article-title":"An evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach, Part II: Handling constraints and extending to an adaptive approach","volume":"18","author":"Jain","year":"2014","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"10.1016\/j.asoc.2019.105731_b39","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1162\/EVCO_a_00109","article-title":"MOEA\/D with adaptive weight adjustment","volume":"22","author":"Qi","year":"2014","journal-title":"Evol. Comput."},{"key":"10.1016\/j.asoc.2019.105731_b40","series-title":"2016 IEEE Congress on Evolutionary Computation, CEC","first-page":"500","article-title":"Towards adaptive weight vectors for multiobjective evolutionary algorithm based on decomposition","author":"Jiang","year":"2016"},{"key":"10.1016\/j.asoc.2019.105731_b41","first-page":"1","article-title":"An enhanced decomposition-based evolutionary algorithm with adaptive reference vectors","author":"Asafuddoula","year":"2017","journal-title":"IEEE Trans. Cybern."},{"issue":"99","key":"10.1016\/j.asoc.2019.105731_b42","first-page":"1","article-title":"Adaptively allocating search effort in challenging many-objective optimization problems","volume":"PP","author":"Liu","year":"2017","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"10.1016\/j.asoc.2019.105731_b43","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1109\/TEVC.2018.2865590","article-title":"Evolutionary many-objective optimization based on dynamical decomposition","volume":"23","author":"He","year":"2019","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.asoc.2019.105731_b44","series-title":"Scalable Multi-Objective Optimization Test Problems, Vol. 1","first-page":"825","author":"Deb","year":"2002"},{"issue":"5","key":"10.1016\/j.asoc.2019.105731_b45","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":"4","key":"10.1016\/j.asoc.2019.105731_b46","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","article-title":"Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach","volume":"3","author":"Zitzler","year":"1999","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"10.1016\/j.asoc.2019.105731_b47","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/TEVC.2010.2077298","article-title":"A fast way of calculating exact hypervolumes","volume":"16","author":"While","year":"2012","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.asoc.2019.105731_b48","series-title":"Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation","first-page":"695","article-title":"A study on performance evaluation ability of a modified inverted generational distance indicator","author":"Ishibuchi","year":"2015"},{"key":"10.1016\/j.asoc.2019.105731_b49","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.asoc.2017.01.038","article-title":"The impact of quality indicators on the rating of multi-objective evolutionary algorithms","volume":"55","author":"Ravber","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2019.105731_b50","series-title":"Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation","first-page":"679","article-title":"Improved metaheuristic based on the R2 indicator for many-objective optimization","author":"Hern\u00e1ndez\u00a0G\u00f3mez","year":"2015"},{"issue":"4","key":"10.1016\/j.asoc.2019.105731_b51","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."},{"key":"10.1016\/j.asoc.2019.105731_b52","series-title":"Simulated Binary Crossover for Continuous Search Space","author":"Agrawal","year":"1994"},{"issue":"1","key":"10.1016\/j.asoc.2019.105731_b53","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/TEVC.2017.2785224","article-title":"An evolution path-based reproduction operator for many-objective optimization","volume":"23","author":"He","year":"2019","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"10.1016\/j.asoc.2019.105731_b54","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/3001968","article-title":"Individual comparisons by ranking methods","volume":"1","author":"Wilcoxon","year":"1945","journal-title":"Biom. Bull."},{"issue":"1","key":"10.1016\/j.asoc.2019.105731_b55","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","article-title":"A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms","volume":"1","author":"Derrac","year":"2011","journal-title":"Swarm Evol. Comput."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1568494619305125?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1568494619305125?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,10,17]],"date-time":"2019-10-17T07:19:03Z","timestamp":1571296743000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494619305125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":55,"alternative-id":["S1568494619305125"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.asoc.2019.105731","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2019,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Many-objective evolutionary algorithm based on adaptive weighted decomposition","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.asoc.2019.105731","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"105731"}}