{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T05:22:17Z","timestamp":1780636937923,"version":"3.54.1"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP130103850"],"award-info":[{"award-number":["DP130103850"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["FT120100228"],"award-info":[{"award-number":["FT120100228"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/tcyb.2017.2737519","type":"journal-article","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T18:24:12Z","timestamp":1503080652000},"page":"2321-2334","source":"Crossref","is-referenced-by-count":95,"title":["An Enhanced Decomposition-Based Evolutionary Algorithm With Adaptive Reference Vectors"],"prefix":"10.1109","volume":"48","author":[{"given":"Md.","family":"Asafuddoula","sequence":"first","affiliation":[{"name":"University of New South Wales, Canberra, ACT, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1653-232X","authenticated-orcid":false,"given":"Hemant Kumar","family":"Singh","sequence":"additional","affiliation":[{"name":"School Engineering and Information Technology, University of New South Wales, Canberra, ACT, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tapabrata","family":"Ray","sequence":"additional","affiliation":[{"name":"School Engineering and Information Technology, University of New South Wales, Canberra, ACT, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00009"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.851275"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.2307\/3001968"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2012.6252868"},{"key":"ref31","article-title":"Techniques to deal with many-objective optimization problems using evolutionary algorithms","author":"jaimes","year":"2011"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2001.934293"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810758"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2014.6900306"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2505784"},{"key":"ref34","first-page":"3352","article-title":"Searching for Pareto-optimal solutions through dimensionality reduction for certain large-dimensional multi-objective optimization problems","author":"deb","year":"2006","journal-title":"Proc World Congr Computa Intell"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.861417"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2059031"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281534"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2420112"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2504730"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2373386"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2013.110"},{"key":"ref16","first-page":"1260","article-title":"Multiobjective optimization by decomposition with Pareto-adaptive weight vectors","volume":"3","author":"jiang","year":"2011","journal-title":"Proc Int Conf Nat Comput"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00109"},{"key":"ref18","first-page":"307","author":"jain","year":"2013","journal-title":"An Improved Adaptive Approach for Elitist Nondominated Sorting Genetic Algorithm for Many-Objective Optimization (LNCS 7811)"},{"key":"ref19","first-page":"127","article-title":"Adaptive reference vector generation for inverse model based evolutionary multiobjective optimization with degenerate and disconnected Pareto fronts","author":"cheng","year":"2015","journal-title":"Proc IEEE Int Conf Evol Comp"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/NAFIPS.1996.534789"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2339823"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"ref3","first-page":"440","article-title":"A survey of multiobjective evolutionary algorithms based on decomposition","volume":"21","author":"trivedi","year":"2017","journal-title":"IEEE Trans Evol Comput"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281535"},{"key":"ref29","article-title":"A novel decomposition-based evolutionary algorithm for engineering design optimization","volume":"139","author":"bhattacharjee","year":"2017","journal-title":"J Mech Design"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2519378"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623496307510"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2587749"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281533"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1007032"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2204264"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37140-0_32"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.05.019"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2227145"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/5326.704576"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2239648"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2093579"},{"key":"ref26","first-page":"115","article-title":"Simulated binary crossover for continuous search space","volume":"9","author":"deb","year":"1995","journal-title":"Complex Syst"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-3-540-88908-3_3","article-title":"Introduction to evolutionary multiobjective optimization","author":"deb","year":"2008","journal-title":"Multiobjective optimization"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/8412163\/08013061.pdf?arnumber=8013061","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T17:35:23Z","timestamp":1715276123000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8013061\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":42,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2017.2737519","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"value":"2168-2267","type":"print"},{"value":"2168-2275","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8]]}}}