{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T06:44:59Z","timestamp":1771051499281,"version":"3.50.1"},"reference-count":57,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":90,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876110"],"award-info":[{"award-number":["61876110"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61836005"],"award-info":[{"award-number":["61836005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672358"],"award-info":[{"award-number":["61672358"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1713212"],"award-info":[{"award-number":["U1713212"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2017A030313338"],"award-info":[{"award-number":["2017A030313338"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>Decomposition\u2010based multiobjective evolutionary algorithms (MOEA\/Ds) have become increasingly popular in recent years. In these MOEA\/Ds, evolutionary search is guided by the used weight vectors in decomposition function to approximate the Pareto front (PF). Generally, the decomposition function will be constructed by the weight vectors and the reference point, which play an important role to balance convergence and diversity during the evolutionary search. However, in most existing MOEA\/Ds, only one ideal point is used as the reference point for all the evolutionary search, which is harmful to search the entire PF when tackling the problems with difficult\u2010to\u2010approximate PF boundaries. To address the above problem, this paper proposes an evolutionary search method with multiple utopian reference points in MOEA\/Ds. Similar to the existing MOEA\/Ds, each solution is associated with one weight vector, which provides an evolutionary search direction, while the novelty of our approach is to use multiple utopian reference points, which can provide evolutionary search directions for different weight vectors. Corner solutions are used to approximate the nadir point and then multiple utopian reference points for evolutionary search can be constructed based on the ideal point and the nadir point, which are uniformly distributed on the coordinate axis or planes. The use of these utopian points can prevent solutions to gather in the same region of PF and helps to strike a good balance of exploration and exploitation in the search space. The performance of our proposed algorithm is validated on tackling 16 recently proposed test problems with difficult\u2010to\u2010approximate PF boundaries and empirically compared to eight state\u2010of\u2010the\u2010art multiobjective evolutionary algorithms. The experimental results demonstrate the superiority of the proposed algorithm on solving most of the test problems adopted.<\/jats:p>","DOI":"10.1155\/2019\/7436712","type":"journal-article","created":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T23:34:23Z","timestamp":1554161663000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Evolutionary Search with Multiple Utopian Reference Points in Decomposition\u2010Based Multiobjective Optimization"],"prefix":"10.1155","volume":"2019","author":[{"given":"Wu","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2415-0401","authenticated-orcid":false,"given":"Qiuzhen","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8479-6904","authenticated-orcid":false,"given":"Zexuan","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2208-962X","authenticated-orcid":false,"given":"Jianqiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6203-1254","authenticated-orcid":false,"given":"Jianyong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhong","family":"Ming","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2019,4]]},"reference":[{"key":"e_1_2_10_1_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2015.2476796"},{"key":"e_1_2_10_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2010.07.014"},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/cplx.21689"},{"key":"e_1_2_10_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.06.107"},{"key":"e_1_2_10_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2856832"},{"key":"e_1_2_10_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2334692"},{"key":"e_1_2_10_7_2","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/8702820"},{"key":"e_1_2_10_8_2","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/4730957"},{"key":"e_1_2_10_9_2","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/1716352"},{"key":"e_1_2_10_10_2","first-page":"647","article-title":"A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem","volume":"59","author":"Li J.","year":"2011","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"e_1_2_10_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"e_1_2_10_12_2","unstructured":"ZitzlerE. LaumannsM. andThieleL. SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization Proceedings of the Evolutionary Methods for Design Optimization and Control with Application to Industrial Problems 2002 Athens Greece 95\u2013100."},{"key":"e_1_2_10_13_2","first-page":"577","article-title":"A new evolutionary algorithm for solving many-objective optimization problems","volume":"18","author":"Zou X.","year":"2014","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"e_1_2_10_14_2","article-title":"A clustering-based adaptive evolutionary algorithm for multiobjective optimization with irregular pareto fronts","author":"Hua Y.","year":"2018","journal-title":"IEEE Transactions on Cybernetics"},{"key":"e_1_2_10_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.08.008"},{"key":"e_1_2_10_16_2","doi-asserted-by":"crossref","unstructured":"LiK. ZhengJ. LiM. ZhouC. andLvH. A novel algorithm for non-dominated hypervolume-based multiobjective optimization Proceedings of the IEEE International Conference Systems Man and Cybernetics 2009 San Antonio Tex USA 5220\u20135226.","DOI":"10.1109\/ICSMC.2009.5345983"},{"key":"e_1_2_10_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"e_1_2_10_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2015.08.092"},{"key":"e_1_2_10_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.925798"},{"key":"e_1_2_10_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2196-9"},{"key":"e_1_2_10_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2293776"},{"key":"e_1_2_10_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.03.021"},{"key":"e_1_2_10_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2779450"},{"key":"e_1_2_10_24_2","doi-asserted-by":"publisher","DOI":"10.3390\/a8020157"},{"key":"e_1_2_10_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.11.052"},{"key":"e_1_2_10_26_2","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568086"},{"key":"e_1_2_10_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.04.061"},{"key":"e_1_2_10_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2012.04.011"},{"key":"e_1_2_10_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281533"},{"key":"e_1_2_10_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-017-1115-9"},{"key":"e_1_2_10_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2009.06.010"},{"key":"e_1_2_10_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.11.011"},{"key":"e_1_2_10_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2521175"},{"key":"e_1_2_10_34_2","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00109"},{"key":"e_1_2_10_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.04.002"},{"key":"e_1_2_10_36_2","doi-asserted-by":"crossref","unstructured":"SatoH. Inverted PBI in MOEA\/D and its impact on the search performance on multi and many-objective optimization Proceeding of the 2014 Conference on Genetic and Evolutionary Computation 2014 Vancouver Canada 645\u2013652.","DOI":"10.1145\/2576768.2598297"},{"key":"e_1_2_10_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2015.2403131"},{"key":"e_1_2_10_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2017.01.002"},{"key":"e_1_2_10_39_2","article-title":"A scalar projection and angle-based evolutionary algorithm for many-objective optimization problems","author":"Zhou Y.","year":"2018","journal-title":"IEEE Transactions on Cybernetics"},{"key":"e_1_2_10_40_2","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2011.587006"},{"key":"e_1_2_10_41_2","doi-asserted-by":"crossref","unstructured":"IshibuchiH. DoiK. MasudaH. andNojimaY. Relation between weight vectors and solutions in MOEA\/D Proceedings of the IEEE Symposium Series on Computational Intelligence SSCI 2015 December 2015 861\u2013868 2-s2.0-84964963322.","DOI":"10.1109\/SSCI.2015.127"},{"key":"e_1_2_10_42_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.08.036"},{"key":"e_1_2_10_43_2","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00175"},{"key":"e_1_2_10_44_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.08.002"},{"key":"e_1_2_10_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2015.03.022"},{"key":"e_1_2_10_46_2","article-title":"A generator for multiobjective test problems with difficult-to-approximate pareto front boundaries","author":"Wang Z.","year":"2018","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"e_1_2_10_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2704118"},{"key":"e_1_2_10_48_2","doi-asserted-by":"crossref","unstructured":"ZhangQ. LiuW. andLiH. The performance of a new version of MOEA\/D on CEC09 unconstrained MOP test instances Proceedings of the 2009 IEEE Congress on Evolutionary Computation CEC 2009 May 2009 Trondheim Norway 203\u2013208 2-s2.0-70449869158.","DOI":"10.1109\/CEC.2009.4982949"},{"key":"e_1_2_10_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2739185"},{"key":"e_1_2_10_50_2","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623496307510"},{"key":"e_1_2_10_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2247594"},{"key":"e_1_2_10_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2017.2742868"},{"key":"e_1_2_10_53_2","doi-asserted-by":"crossref","unstructured":"LiuH.andLiX. The multiobjective evolutionary algorithm based on determined weight and sub-regional search Proceedings of the IEEE Conference on Evolutionary Computation 2009 Trondheim Norway 1928\u20131934.","DOI":"10.1109\/CEC.2009.4983176"},{"key":"e_1_2_10_54_2","doi-asserted-by":"crossref","unstructured":"LiM.andZhengJ. Spread assessment for evolutionary multi-objective optimization Proceedings of the 5th International Conference on Evolutionary Multi-Criterion Optimization 2009 Nantes France 216\u2013230 https:\/\/doi.org\/10.1007\/978-3-642-01020-0_20.","DOI":"10.1007\/978-3-642-01020-0_20"},{"key":"e_1_2_10_55_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2005.851275"},{"key":"e_1_2_10_56_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2013.07.038"},{"key":"e_1_2_10_57_2","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2014.928817"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2019\/7436712.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2019\/7436712.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2019\/7436712","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T11:13:42Z","timestamp":1723029222000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2019\/7436712"}},"subtitle":[],"editor":[{"given":"Michele","family":"Scarpiniti","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.1155\/2019\/7436712"],"URL":"https:\/\/doi.org\/10.1155\/2019\/7436712","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]},"assertion":[{"value":"2019-01-11","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-03-13","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-04-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"7436712"}}