{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:01:07Z","timestamp":1753887667693,"version":"3.41.2"},"reference-count":54,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":186,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>In the past few decades, a number of multiobjective evolutionary algorithms (MOEAs) have been proposed in the continue study. As pointed out in some recent studies, the performance of the most existing MOEAs is not promising when solving different shapes of Pareto fronts. To address this issue, this paper proposes an MOEA based on density estimation ranking. The algorithm includes density estimation ranking to shift the reference solution position, calculating the density of candidate solutions and ranking by the estimated density value, to modify the Pareto dominance relation and for handling complicated Pareto front. The result of this ranking can be used as the second selection criterion for environmental selection, and the optimal candidate individual with distribution and diversity information is selected. Experimental results show that the proposed algorithm can solve various types of Pareto fronts, outperformance several state\u2010of\u2010the\u2010art evolutionary algorithms in multiobjective optimization.<\/jats:p>","DOI":"10.1155\/2021\/4296642","type":"journal-article","created":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:50:13Z","timestamp":1625615413000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Evolutionary Algorithm for Multiobjective Optimization Based on Density Estimation Ranking"],"prefix":"10.1155","volume":"2021","author":[{"given":"Lin","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6750-8739","authenticated-orcid":false,"given":"Hengfei","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Xiujian","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Guanglei","family":"Sheng","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,7,6]]},"reference":[{"key":"e_1_2_7_1_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24653-4_23"},{"key":"e_1_2_7_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2966008"},{"key":"e_1_2_7_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2015.2468683"},{"key":"e_1_2_7_4_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1650\/3\/032171"},{"key":"e_1_2_7_5_2","doi-asserted-by":"crossref","unstructured":"CorneD. W.andKnowlesJ. D. Techniques for highly multiobjective optimisation: some nondominated points are better than others Proceedings of the International Conference on Genetic and Evolutionary Computation 2007 London England 773\u2013780 https:\/\/doi.org\/10.1145\/1276958.1277115 2-s2.0-34548137363.","DOI":"10.1145\/1276958.1277115"},{"key":"e_1_2_7_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"e_1_2_7_7_2","unstructured":"CorneD. JerramN. KnowlesJ. D. OatesM. andMartinJ. PESA-II: Region-based Selection in Evolutionary Multiobjective Optimization Proceedings of the 3rd annual conference on genetic and evolutionary computation 2001 San Francisco CA USA 283\u2013290."},{"key":"e_1_2_7_8_2","unstructured":"ZitzlerE. LaumannsM. andThieleL. SPEA2: Improving the strength Pareto evolutionary algorithm 2001 Tech. Rep. TIK-Report 103 ETH Zurich."},{"key":"e_1_2_7_9_2","doi-asserted-by":"crossref","unstructured":"DebK. MohanM. andMishraS. Towards a Quick Computation of Well-Spread Pareto-Optimal Solutions Evolutionary Multi-Criterion Optimization Second International Conference Emo Faro 2003 Portugal April. Springer-Verlag.","DOI":"10.1007\/3-540-36970-8_16"},{"key":"e_1_2_7_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2754271"},{"key":"e_1_2_7_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.10.001"},{"key":"e_1_2_7_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281533"},{"key":"e_1_2_7_13_2","doi-asserted-by":"crossref","unstructured":"MurataT. Specification of genetic search directions in cellular multi-objective genetic algorithms International Conference on Evolutionary Multi-Criterion Optimization 2001 Berlin Heidelberg 82\u201395.","DOI":"10.1007\/3-540-44719-9_6"},{"key":"e_1_2_7_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2007.892759"},{"key":"e_1_2_7_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2016.2519378"},{"key":"e_1_2_7_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2865590"},{"key":"e_1_2_7_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281535"},{"key":"e_1_2_7_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2395073"},{"key":"e_1_2_7_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100843"},{"key":"e_1_2_7_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2865931"},{"key":"e_1_2_7_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281533"},{"key":"e_1_2_7_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2592479"},{"key":"e_1_2_7_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.08.008"},{"key":"e_1_2_7_24_2","doi-asserted-by":"crossref","unstructured":"Menchaca-MendezA.andCoelloC. GDE-MOEA: A new MOEA based on the generational distance indicator and\u03b5-dominance 2015 IEEE Congress on Evolutionary Computation (CEC) 2015 Sendai Japan 947\u2013955.","DOI":"10.1109\/CEC.2015.7256992"},{"key":"e_1_2_7_25_2","doi-asserted-by":"crossref","unstructured":"IonescuA. F. Multi-objective Evolutionary Algorithms: Decomposition Versus Indicator-Based Approach 2021 404 Springer Cham Studies inFuzziness and Soft Computing https:\/\/doi.org\/10.1007\/978-3-030-61334-1_3.","DOI":"10.1007\/978-3-030-61334-1_3"},{"key":"e_1_2_7_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.08.027"},{"key":"e_1_2_7_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2791283"},{"key":"e_1_2_7_28_2","doi-asserted-by":"crossref","unstructured":"Hernandez GomezR.andCoelloC. A. Improved metaheuristic based on the R2 indicator for many-objective optimization Proceedings of the 2015 International Conference on Genetic and Evolutionary Computation 2015 New York NY USA 679\u2013686.","DOI":"10.1145\/2739480.2754776"},{"key":"e_1_2_7_29_2","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00009"},{"key":"e_1_2_7_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2017.2749619"},{"key":"e_1_2_7_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2455812"},{"key":"e_1_2_7_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2507366"},{"key":"e_1_2_7_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.03.009"},{"key":"e_1_2_7_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2019.2896533"},{"key":"e_1_2_7_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2350987"},{"key":"e_1_2_7_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2638902"},{"key":"e_1_2_7_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2504730"},{"key":"e_1_2_7_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2587749"},{"key":"e_1_2_7_39_2","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2005.s45"},{"key":"e_1_2_7_40_2","first-page":"30","article-title":"A combined genetic adaptive search (gene AS) for engineering design","volume":"26","author":"Deb K.","year":"1996","journal-title":"Computer Science and Informatics"},{"key":"e_1_2_7_41_2","first-page":"115","article-title":"Simulated binary crossover for continuous search space","volume":"9","author":"Deb K.","year":"1995","journal-title":"Complex Systems"},{"key":"e_1_2_7_42_2","doi-asserted-by":"publisher","DOI":"10.1016\/S1474-0346(02)00011-3"},{"key":"e_1_2_7_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810068"},{"key":"e_1_2_7_44_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15844-5_65"},{"key":"e_1_2_7_45_2","doi-asserted-by":"crossref","unstructured":"LiM. ZhengJ. ShenR. LiK. andYuanQ. A grid-based fitness strategy for evolutionary many-objective optimization Proceedings of the 12th annual conference on Genetic and evolutionary computation - GECCO \u203210 2010 New York NY USA 463\u2013470.","DOI":"10.1145\/1830483.1830570"},{"key":"e_1_2_7_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2262178"},{"key":"e_1_2_7_47_2","doi-asserted-by":"crossref","unstructured":"KukkonenS.andLampinenJ. GDE3: The third Evolution Step of Generalized Differential Evolution 1 2005 IEEE Congress on Evolutionary Computation September 2005 Edinburgh UK 443\u2013450.","DOI":"10.1109\/CEC.2005.1554717"},{"key":"e_1_2_7_48_2","unstructured":"MartinezS. Z.andCoelloC. A. C. A multi-objective particle swarm optimizer based on decomposition Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation 2011 New York NY USA 69\u201376."},{"key":"e_1_2_7_49_2","doi-asserted-by":"crossref","unstructured":"CoelloC. A.andLechugaM. S. MOPSO: a proposal for multiple objective particle swarm optimization Proceedings of the 2002 Congress on Evolutionary Computation. CEC\u203202 (Cat. No.02TH8600) 2002 Honolulu HI USA 1051\u20131056.","DOI":"10.1109\/CEC.2002.1004388"},{"key":"e_1_2_7_50_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.925798"},{"key":"e_1_2_7_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2521868"},{"key":"e_1_2_7_52_2","doi-asserted-by":"crossref","unstructured":"ZhangQ. F. LiuW. D. andLiH. The performance of a new version of MOEA\/D on CEC09 unconstrained MOP test instances IEEE Congress on Evolutionary Computation 2009 Trondheim Norway https:\/\/doi.org\/10.1109\/cec.2009.4982949 2-s2.0-70449869158.","DOI":"10.1109\/CEC.2009.4982949"},{"key":"e_1_2_7_53_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2017.2742868"},{"key":"e_1_2_7_54_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2373386"}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/4296642.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/4296642.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/4296642","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T09:37:03Z","timestamp":1723023423000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/4296642"}},"subtitle":[],"editor":[{"given":"Shan","family":"Zhong","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/4296642"],"URL":"https:\/\/doi.org\/10.1155\/2021\/4296642","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"type":"print","value":"1530-8669"},{"type":"electronic","value":"1530-8677"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-05-09","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-06-19","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"4296642"}}