{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T21:51:18Z","timestamp":1767649878443,"version":"3.37.3"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1836216","61702310","61772322"],"award-info":[{"award-number":["U1836216","61702310","61772322"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Major Fundamental Research Project of Shandong, China","award":["ZR2019ZD03"],"award-info":[{"award-number":["ZR2019ZD03"]}]},{"DOI":"10.13039\/501100010040","name":"Taishan Scholar Project of Shandong, China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010040","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2999417","type":"journal-article","created":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T20:38:46Z","timestamp":1591130326000},"page":"103550-103564","source":"Crossref","is-referenced-by-count":4,"title":["A Decomposition Method Based on Random Objective Division for MOEA\/D in Many-Objective Optimization"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8084-4892","authenticated-orcid":false,"given":"Xue","family":"Lu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5056-6019","authenticated-orcid":false,"given":"Yanyan","family":"Tan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5471-7328","authenticated-orcid":false,"given":"Wei","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Lili","family":"Meng","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2420112"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2519378"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2339823"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2638902"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2549267"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.06.007"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2443001"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281535"},{"key":"ref35","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":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2017.2654301"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810758"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.06.073"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2656922"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1145\/2739480.2754776","article-title":"Improved Metaheuristic based on the R2 indicator for many-objective optimization","author":"g\u00f3mez","year":"2015","journal-title":"Proc Genet Evol Comput Conf (GECCO)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2161872"},{"key":"ref29","first-page":"505","article-title":"A new multi-objective evolutionary algorithm based on a performance assessment indicator","author":"villalobos","year":"2012","journal-title":"Proc 14th Annu Conf Genet Evol Comput"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2872803"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2373386"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2587808"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00009"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2378512"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2010.03.004"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.08.008"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330230"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31880-4_5"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.01.001"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37140-0_35"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.925798"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568202"},{"article-title":"Evolutionary search under partially ordered fitness sets","year":"1999","author":"rudolph","key":"ref57"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.861417"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1007032"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/1-84628-137-7_6"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.01.038"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.826069"},{"key":"ref10","article-title":"A hybrid multi-objective artificial bee colony algorithm for flexible task scheduling problems in cloud computing system","author":"han","year":"2019","journal-title":"Cluster Comput"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2019.8789966"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2592479"},{"key":"ref12","first-page":"37","article-title":"An enhanced multi-objective group search optimizer based on multi-producer and crossover operator","volume":"33","author":"zheng","year":"2017","journal-title":"J Inf Sci Eng"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-015-2476-x"},{"key":"ref14","first-page":"849","article-title":"A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II","author":"deb","year":"2000","journal-title":"Proc Int Conf Parallel Problem Solving Nature"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2908485"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2007.15.4.493"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424990"},{"key":"ref18","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 Cybern"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2262178"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.04.015"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2943606"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2018.2803758"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2676000"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.01.023"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2017.09.005"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00109"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100600"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2587749"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2848921"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2865590"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2016.7744399"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281533"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/CIS2018.2018.00015"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/SSCI.2017.8280867"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09106348.pdf?arnumber=9106348","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:52:26Z","timestamp":1639770746000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9106348\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":62,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2999417","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}