{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T01:10:22Z","timestamp":1774314622452,"version":"3.50.1"},"reference-count":39,"publisher":"Wiley","license":[{"start":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T00:00:00Z","timestamp":1693958400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["2020YFB1710200"],"award-info":[{"award-number":["2020YFB1710200"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["61872105"],"award-info":[{"award-number":["61872105"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["62072136"],"award-info":[{"award-number":["62072136"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["ZJB1421113"],"award-info":[{"award-number":["ZJB1421113"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["GJB1421251"],"award-info":[{"award-number":["GJB1421251"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2020YFB1710200"],"award-info":[{"award-number":["2020YFB1710200"]}],"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":["61872105"],"award-info":[{"award-number":["61872105"]}],"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":["62072136"],"award-info":[{"award-number":["62072136"]}],"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":["ZJB1421113"],"award-info":[{"award-number":["ZJB1421113"]}],"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":["GJB1421251"],"award-info":[{"award-number":["GJB1421251"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Educational Science Planning of Heilongjiang Province","award":["2020YFB1710200"],"award-info":[{"award-number":["2020YFB1710200"]}]},{"name":"Educational Science Planning of Heilongjiang Province","award":["61872105"],"award-info":[{"award-number":["61872105"]}]},{"name":"Educational Science Planning of Heilongjiang Province","award":["62072136"],"award-info":[{"award-number":["62072136"]}]},{"name":"Educational Science Planning of Heilongjiang Province","award":["ZJB1421113"],"award-info":[{"award-number":["ZJB1421113"]}]},{"name":"Educational Science Planning of Heilongjiang Province","award":["GJB1421251"],"award-info":[{"award-number":["GJB1421251"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2023,9,6]]},"abstract":"<jats:p>Particle swarm optimization (PSO) is an evolutionary algorithm for solving global optimization problems. PSO has a fast convergence speed and does not require the optimization function to be differentiable and continuous. In recent two decades, a lot of researches have been working on improving the performance of PSO, and numerous PSO variants have been presented. According to a recent theory, no optimization algorithm can perform better than any other algorithm on all types of optimization problems. Thus, PSO with mixed strategies might be more efficient than pure strategy algorithms. A mixed strategy PSO algorithm (MSPSO) which integrates five different PSO variants was proposed. In MSPSO, an adaptive selection strategy is used to adjust the probability of selecting different variants according to the rate of the fitness value change between offspring generated by each variant and the personal best position of particles to guide the selection probabilities of variants. The rate of the fitness value change is a more effective indicator of good strategies than the number of previous successes and failures of each variant. In order to improve the exploitation ability of MSPSO, a Nelder\u2013Mead variant method is proposed. The combination of these two methods further improves the performance of MSPSO. The proposed algorithm is tested on CEC 2014 benchmark suites with 10 and 30 variables and CEC 2010 with 1000 variables and is also conducted to solve the hydrothermal scheduling problem. Experimental results demonstrate that the solution accuracy of the proposed algorithm is overall better than that of comparative algorithms.<\/jats:p>","DOI":"10.1155\/2023\/7111548","type":"journal-article","created":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T00:05:06Z","timestamp":1694045106000},"page":"1-19","source":"Crossref","is-referenced-by-count":11,"title":["PSO with Mixed Strategy for Global Optimization"],"prefix":"10.1155","volume":"2023","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7031-7458","authenticated-orcid":true,"given":"Jinwei","family":"Pang","sequence":"first","affiliation":[{"name":"School of Computer and Control Engineering, Yantai University, Yantai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7116-3753","authenticated-orcid":true,"given":"Xiaohui","family":"Li","sequence":"additional","affiliation":[{"name":"Harbin Vocational and Technical College, Harbin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9712-7678","authenticated-orcid":true,"given":"Shuang","family":"Han","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Harbin Engineering University, Harbin, China"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.26599\/tst.2021.9010047"},{"key":"2","first-page":"1942","article-title":"Particle swarm optimization","author":"J. Kennedy"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/3845407"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ultras.2018.06.012"},{"key":"5","first-page":"1","article-title":"Efficient traffic control and lifetime maximization in mobile ad hoc network by using PSO\u2013BAT optimization","volume":"27","author":"N. Sridevi","year":"2019","journal-title":"Wireless Networks"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.10.049"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/tcss.2020.2995760"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/tii.2021.3076811"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2014.2318025"},{"key":"10","first-page":"69","article-title":"A modified particle swarm optimizer","author":"Y. Shi"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.08.039"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.04.008"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.09.019"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2015.11.001"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.apenergy.2015.12.044"},{"key":"16","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-319-12286-1_5","article-title":"Hybrid particle swarm optimization with bat algorithm","volume-title":"Genetic and evolutionary computing","author":"T.-S. Pan","year":"2015"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.12.009"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.12.026"},{"key":"19","first-page":"562","article-title":"Mixed strategy may outperform pure strategy: an initial study","author":"J. He"},{"issue":"9","key":"20","doi-asserted-by":"crossref","first-page":"2553","DOI":"10.23940\/ijpe.19.09.p29.25532562","article-title":"A modified comprehensive learning particle swarm optimizer","volume":"15","author":"J. Pang","year":"2019","journal-title":"International Journal of Performability Engineering"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2012.2203138"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2004.826071"},{"key":"23","first-page":"174","article-title":"Fitness-distance-ratio based particle swarm optimization","volume":"03","author":"T. Peram","year":"2003","journal-title":"Proceedings of Swarm Intelligence Symposium SIS"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/7.4.308"},{"key":"25","article-title":"Problem Definitions and Evaluation Criteria for the CEC 2014 Special Session and Competition on Single Objective Real-Parameter Numerical Optimization","volume-title":"Computational Intelligence Laboratory","author":"J. J. Liang","year":"2013"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2005.857610"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.02.007"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.08.037"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.09.007"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-008-9080-4"},{"key":"31","volume-title":"Problem Definitions and Evaluation Criteria for CEC 2011 Competition on Testing Evolutionary Algorithms on Real World Optimization Problems","author":"S. Das","year":"2010"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.01.038"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2010.12.015"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2011.2173577"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.10.012"},{"key":"36","article-title":"Benchmark functions for the cec\u2019 2010 special session and competition on large-scale global optimization","volume":"17","author":"T. Ke","year":"2009","journal-title":"Nature Inspired Computation & Applications Laboratory"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2013.12.007"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.12.022"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2017.07.002"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2023\/7111548.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2023\/7111548.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2023\/7111548.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T00:05:18Z","timestamp":1694045118000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2023\/7111548\/"}},"subtitle":[],"editor":[{"given":"Alejandro F.","family":"Villaverde","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2023,9,6]]},"references-count":39,"alternative-id":["7111548","7111548"],"URL":"https:\/\/doi.org\/10.1155\/2023\/7111548","relation":{},"ISSN":["1099-0526","1076-2787"],"issn-type":[{"value":"1099-0526","type":"electronic"},{"value":"1076-2787","type":"print"}],"subject":[],"published":{"date-parts":[[2023,9,6]]}}}