{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:18:22Z","timestamp":1740169102147,"version":"3.37.3"},"reference-count":69,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872281"],"award-info":[{"award-number":["61872281"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007128","name":"Natural Science Foundation of Shaanxi Province","doi-asserted-by":"publisher","award":["2016JZ022"],"award-info":[{"award-number":["2016JZ022"]}],"id":[{"id":"10.13039\/501100007128","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2920698","type":"journal-article","created":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T19:56:39Z","timestamp":1559678199000},"page":"81701-81716","source":"Crossref","is-referenced-by-count":4,"title":["A Parameterless Penalty Rule-Based Fitness Estimation for Decomposition-Based Many-Objective Optimization Evolutionary Algorithm"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2791-9581","authenticated-orcid":false,"given":"Junhua","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yuping","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Shiwei","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Xiangjuan","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Wuning","family":"Tong","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830570"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2373386"},{"key":"ref33","first-page":"3352","article-title":"Searching for Pareto-optimal solutions through dimensionality reduction for certain large-dimensional multi-objective optimization problems","author":"kalyanmoy deb","year":"2006","journal-title":"Proc World Congr Computa Intell"},{"key":"ref32","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-39742-4_19","article-title":"Preference-based many-objective evolutionary testing generates harder test cases for autonomous agents","author":"kalboussi","year":"2013","journal-title":"Search Based Software Engineering"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2592479"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2367526"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.925798"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1162\/106365602760234108"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/321906.321910"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1029\/2009WR008121"},{"key":"ref60","first-page":"95","article-title":"SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization","author":"zitzler","year":"2001","journal-title":"Evolutionary Methods for Design Optimization and Control with Applications to Industrial Problems"},{"key":"ref62","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":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797969"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810758"},{"key":"ref28","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-10762-2_59","article-title":"Distance-based analysis of crossover operators for many-objective knapsack problems","author":"ishibuchi","year":"2014","journal-title":"Parallel Problem Solving from Nature"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2739185"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2587749"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.07.030"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2378512"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2008.4631121"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2791283"},{"key":"ref68","doi-asserted-by":"crossref","first-page":"4005","DOI":"10.1007\/s00500-015-1736-z","article-title":"Decomposing the user-preference in multiobjective optimization","volume":"20","author":"yu","year":"2016","journal-title":"Soft Comput"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.09.032"},{"article-title":"Incorporating decision maker’s preference information in evolutionary multi-objective optimization","year":"2013","author":"bechikh","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00009"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2017.2654301"},{"key":"ref22","first-page":"2115","article-title":"Effective ranking + speciation = many-objective optimization","author":"garza-fabre","year":"2011","journal-title":"Proc Evol Comput"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/978-3-540-31880-4_5","article-title":"An EMO algorithm using the hypervolume measure as selection criterion","author":"emmerich","year":"2005","journal-title":"Proc Int Conf Evol Multi-Criterion Optim"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2008.16.2.225"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2013.6557868"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2001.934293"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.861417"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2017.2742868"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/298151.298382"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2420112"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598342"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2587808"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2077298"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2204264"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70928-2_56"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2794319"},{"key":"ref10","article-title":"Off-line time aware scheduling of bag-of-tasks on heterogeneous distributed system","author":"xuan","year":"0","journal-title":"IEEE Access"},{"key":"ref11","first-page":"283","article-title":"PESA-II: Region-based selection in evolutionary multiobjective optimization","author":"corne","year":"2001","journal-title":"Proc 3rd Annu Conf Genet Evol Comput"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281533"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2014.07.069"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623496307510"},{"key":"ref14","first-page":"115","article-title":"Simulated binary crossover for continuous search space","volume":"9","author":"deb","year":"1995","journal-title":"Complex Syst"},{"key":"ref15","first-page":"30","article-title":"A combined genetic adaptive search (GeneAS) for engineering design","volume":"26","author":"deb","year":"1996","journal-title":"Comput Sci Inf"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281535"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277116"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1007032"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2881268"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-42978-6_4","article-title":"Many-objective optimization using evolutionary algorithms: A survey","author":"bechikh","year":"2017","journal-title":"Recent Advances in Evolutionary Multi-objective Optimization"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.08.008"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0427-8_25"},{"key":"ref8","first-page":"2693","article-title":"Some techniques to deal with many-objective problems","author":"jaimes","year":"2009","journal-title":"Proc Conf Companion Genet Evol Comput Conf Late Breaking Papers"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2519378"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2009.17.3.411"},{"key":"ref9","first-page":"69","article-title":"A multi-objective particle swarm optimizer based on decomposition","author":"mart\u00ednez","year":"2011","journal-title":"Proc Conf Genet Evol Comput"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2093579"},{"key":"ref45","article-title":"A new two-stage evolutionary algorithm for many-objective optimization","author":"sun","year":"0","journal-title":"IEEE Trans Evol Comput"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70928-2_54"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1994.2.3.221"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CIS.2017.00010"},{"key":"ref41","first-page":"4763","article-title":"An evolutionary many-objective optimisation algorithm with adaptive region decomposition","author":"liu","year":"2016","journal-title":"Proc Evol Comput"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70928-2_5"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.910138"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08730321.pdf?arnumber=8730321","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T08:56:11Z","timestamp":1643273771000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8730321\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":69,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2920698","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}