{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T11:15:40Z","timestamp":1777634140755,"version":"3.51.4"},"reference-count":34,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,11,6]],"date-time":"2021-11-06T00:00:00Z","timestamp":1636156800000},"content-version":"vor","delay-in-days":309,"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":["71461027"],"award-info":[{"award-number":["71461027"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Computational Intelligence and Neuroscience"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>The optimization problems are taking place at all times in actual lives. They are divided into single objective problems and multiobjective problems. Single objective optimization has only one objective function, while multiobjective optimization has multiple objective functions that generate the Pareto set. Therefore, to solve multiobjective problems is a challenging task. A multiobjective particle swarm optimization, which combined cosine distance measurement mechanism and novel game strategy, has been proposed in this article. The cosine distance measurement mechanism was adopted to update Pareto optimal set in the external archive. At the same time, the candidate set was established so that Pareto optimal set deleted from the external archive could be effectively replaced, which helped to maintain the size of the external archive and improved the convergence and diversity of the swarm. In order to strengthen the selection pressure of leader, this article combined with the game update mechanism, and a global leader selection strategy that integrates the game strategy including the cosine distance mechanism was proposed. In addition, mutation was used to maintain the diversity of the swarm and prevent the swarm from prematurely converging to the true Pareto front. The performance of the proposed competitive multiobjective particle swarm optimizer was verified by benchmark comparisons with several state\u2010of\u2010the\u2010art multiobjective optimizer, including seven multiobjective particle swarm optimization algorithms and seven multiobjective evolutionary algorithms. Experimental results demonstrate the promising performance of the proposed algorithm in terms of optimization quality.<\/jats:p>","DOI":"10.1155\/2021\/6440338","type":"journal-article","created":{"date-parts":[[2021,11,7]],"date-time":"2021-11-07T06:02:14Z","timestamp":1636264934000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Multiobjective Particle Swarm Optimization Based on Cosine Distance Mechanism and Game Strategy"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0000-4661","authenticated-orcid":false,"given":"Nana","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1571-5370","authenticated-orcid":false,"given":"Yanmin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qijun","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shihua","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kangge","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2021,11,6]]},"reference":[{"key":"e_1_2_9_1_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107198"},{"key":"e_1_2_9_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/mci.2017.2708578"},{"key":"e_1_2_9_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2021.126019"},{"key":"e_1_2_9_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compfluid.2021.104859"},{"key":"e_1_2_9_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2017.06.004"},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.2478\/caim-2020-0003"},{"key":"e_1_2_9_7_2","unstructured":"KennedyJ.andEberhartR. Particle swarm optimization Proceedings of the ICNN\u201995\u2014International Conference on Neural Networks 1995 Perth Australia."},{"key":"e_1_2_9_8_2","doi-asserted-by":"crossref","unstructured":"CoelloC. A. C.andLechugaM. S. MOPSO: a proposal for multiple objective particle swarm optimization 2 Proceedings of the 2002 Congress on Evolutionary Computation 2002 Honolulu HI USA 1051\u20131056.","DOI":"10.1109\/CEC.2002.1004388"},{"key":"e_1_2_9_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2004.826067"},{"key":"e_1_2_9_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"e_1_2_9_11_2","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568167"},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31880-4_35"},{"key":"e_1_2_9_13_2","doi-asserted-by":"crossref","unstructured":"NebroA. DurilloJ. Garc\u0142a-NietoJ. CoelloC. LunaF. andAlbaE. SMPSO: a new PSO based metaheuristic for multi-objective optimization Proceedings of the 2009 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making 2009 Nashville TN USA 66\u201373 https:\/\/doi.org\/10.1109\/mcdm.2009.4938830 2-s2.0-67650565595.","DOI":"10.1109\/MCDM.2009.4938830"},{"key":"e_1_2_9_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.06.071"},{"key":"e_1_2_9_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2007.892759"},{"key":"e_1_2_9_16_2","doi-asserted-by":"crossref","unstructured":"PengW.andZhangQ. A decomposition-based multi-objective particle swarm optimization algorithm for continuous optimization problems 1 Proceedings of the 2008 IEEE International Conference on Granular Computing GRC 2008 2008 Hangzhou China https:\/\/doi.org\/10.1109\/grc.2008.4664724 2-s2.0-57949098236.","DOI":"10.1109\/GRC.2008.4664724"},{"key":"e_1_2_9_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15871-1_1"},{"key":"e_1_2_9_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.07.018"},{"key":"e_1_2_9_19_2","unstructured":"Mart\u0142nezS.andCoelloC. A multi-objective particle swarm optimizer based on decomposition 1 Proceedings of the Genetic and Evolutionary Computation Conference 2011 Dublin Ireland 69\u201376."},{"key":"e_1_2_9_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2020.3007846"},{"key":"e_1_2_9_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2020.03.240"},{"key":"e_1_2_9_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2003.810761"},{"key":"e_1_2_9_23_2","article-title":"Particle swarm optimization with a balanceable fitness estimation for many-objective optimization problems","volume":"1","author":"Lin Q.","year":"2016","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"e_1_2_9_24_2","doi-asserted-by":"crossref","unstructured":"RaquelC.andNavalP. An effective use of crowding distance in multi-objective particle swarm optimization Proceedings of the 2005 Genetic and Evolutionary Computation Conference 2005 Washington DC USA https:\/\/doi.org\/10.1145\/1068009.1068047 2-s2.0-32444449874.","DOI":"10.1145\/1068009.1068047"},{"key":"e_1_2_9_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2013.2281535"},{"key":"e_1_2_9_26_2","doi-asserted-by":"crossref","unstructured":"TianY. ZhangX. ChengR. andJinY. A multi-objective evolutionary algorithm based on an enhanced inverted generational distance metric Proceedings of the 2016 IEEE Congress on Evolutionary Computation (CEC) 2016 Vancouver Canada https:\/\/doi.org\/10.1109\/cec.2016.7748352 2-s2.0-85008244063.","DOI":"10.1109\/CEC.2016.7748352"},{"key":"e_1_2_9_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2016.2592479"},{"key":"e_1_2_9_28_2","unstructured":"ZitzlerM. L. E.andThieleL. SPEA2: improving the strength pareto evolutionary algorithm Proceedings of the 5th Conference on Evolutionary Methods for Design Optimization and Control with Applications to Industrial Problems 2001 Athens Greece."},{"key":"e_1_2_9_29_2","doi-asserted-by":"crossref","unstructured":"ZitzlerE.andK\u00fcnzliS. Indicator-based selection in multiobjective search Proceedings of the 2004 International Conference on Parallel Problem Solving from Nature 2004 Birmingham UK 832\u2013842 https:\/\/doi.org\/10.1007\/978-3-540-30217-9_84.","DOI":"10.1007\/978-3-540-30217-9_84"},{"key":"e_1_2_9_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106378"},{"key":"e_1_2_9_31_2","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568202"},{"key":"e_1_2_9_32_2","unstructured":"DebK. ThieleL. LaumannsM. andZitzlerE. Scalable multi-objective optimization test problems Proceedings of the 2002 Congress on Evolutionary Computation 2002 Honolulu HI USA."},{"key":"e_1_2_9_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2007.894202"},{"key":"e_1_2_9_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/mci.2017.2742868"}],"container-title":["Computational Intelligence and Neuroscience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2021\/6440338.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2021\/6440338.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/6440338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T12:13:10Z","timestamp":1722946390000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/6440338"}},"subtitle":[],"editor":[{"given":"Mario","family":"Versaci","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/6440338"],"URL":"https:\/\/doi.org\/10.1155\/2021\/6440338","archive":["Portico"],"relation":{},"ISSN":["1687-5265","1687-5273"],"issn-type":[{"value":"1687-5265","type":"print"},{"value":"1687-5273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-09-07","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-10-18","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-11-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"6440338"}}