{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:14:59Z","timestamp":1758269699951,"version":"3.37.3"},"reference-count":40,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62066019","61903089"],"award-info":[{"award-number":["62066019","61903089"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Jiangxi Provincial Natural Science Foundation","award":["20202BABL202020","20202BAB202014"],"award-info":[{"award-number":["20202BABL202020","20202BAB202014"]}]},{"name":"Science Foundation of Jiangxi University of Science and Technology","award":["JXXJBS18059"],"award-info":[{"award-number":["JXXJBS18059"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[2021,3,15]]},"abstract":"<jats:p>Particle swarm optimization (PSO) algorithm is a stochastic and population-based optimization algorithm. Its traditional learning strategy is implemented by updating the best position using the particle\u2019s own historical best experience and its neighborhood\u2019s best experience to find the optimal solution of the problem. However, the learning strategy is ineffective when dealing with highly complex problems. In this paper, a particle swarm optimization algorithm based on a multidimensional mean learning strategy is proposed. In this algorithm, an opposition-based learning strategy is utilized to initialize the population to enhance the exploitation capability. Furthermore, the historical best positions of all the particles are reconstructed in a vertical crossover manner that is based on the mean information of multiple optimal dimensions to generate the guiding particles. Additionally, an improved inertia weight is used to further guide all the particle movements to balance the capability of the proposed algorithm for global exploration and local exploitation. The proposed algorithm is tested on 12 benchmark functions and is compared with some well-known PSO algorithms. The experimental results show that the proposed algorithm obtains more competitive optimal solution compared with other PSO algorithms when solving high-dimensional complex problems.<\/jats:p>","DOI":"10.1142\/s0218001421510058","type":"journal-article","created":{"date-parts":[[2020,7,11]],"date-time":"2020-07-11T15:33:07Z","timestamp":1594481587000},"page":"2151005","source":"Crossref","is-referenced-by-count":8,"title":["An Efficient Particle Swarm Optimization with Multidimensional Mean Learning"],"prefix":"10.1142","volume":"35","author":[{"given":"Wei","family":"Li","sequence":"first","affiliation":[{"name":"School of Information Engineering, Jiangxi University of Science and Technology, Ganzhou, Jiangxi, P.\u00a0R.\u00a0China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang","family":"Meng","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Jiangxi University of Science and Technology, Ganzhou, Jiangxi, P.\u00a0R.\u00a0China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Mathematics and Computer Science, Gannan Normal University, Ganzhou, Jiangxi, P.\u00a0R.\u00a0China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junhui","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Jiangxi University of Science and Technology, Ganzhou, Jiangxi, P.\u00a0R.\u00a0China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2020,10,7]]},"reference":[{"key":"S0218001421510058BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2015.08.002"},{"key":"S0218001421510058BIB002","first-page":"369298","volume":"2015","author":"Beatriz A. G.","year":"2015","journal-title":"Comput. Intell. Neurosci."},{"key":"S0218001421510058BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/SIS.2007.368035"},{"key":"S0218001421510058BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2307-7"},{"key":"S0218001421510058BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.10.011"},{"key":"S0218001421510058BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.08.039"},{"key":"S0218001421510058BIB007","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2519758"},{"key":"S0218001421510058BIB008","doi-asserted-by":"publisher","DOI":"10.1109\/4235.985692"},{"key":"S0218001421510058BIB009","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2503433"},{"key":"S0218001421510058BIB010","doi-asserted-by":"publisher","DOI":"10.1109\/ISC2.2018.8656985"},{"key":"S0218001421510058BIB011","doi-asserted-by":"publisher","DOI":"10.1109\/MHS.1995.494215"},{"key":"S0218001421510058BIB012","first-page":"84","volume-title":"Proc. 2000 Congr. Evolutionary Computation (ICEC)","author":"Eberhart R. C.","year":"2000"},{"issue":"1","key":"S0218001421510058BIB013","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/TSC.2015.2439695","volume":"9","author":"Fong S.","year":"2016","journal-title":"IEEE Trans. Serv. Comput."},{"key":"S0218001421510058BIB014","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2185052"},{"key":"S0218001421510058BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-3448-7"},{"key":"S0218001421510058BIB016","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"S0218001421510058BIB017","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2149-3"},{"key":"S0218001421510058BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106592"},{"key":"S0218001421510058BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.02.034"},{"key":"S0218001421510058BIB020","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.857610"},{"key":"S0218001421510058BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.01.004"},{"key":"S0218001421510058BIB022","doi-asserted-by":"publisher","DOI":"10.3233\/ICA-180594"},{"key":"S0218001421510058BIB023","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.826074"},{"issue":"11","key":"S0218001421510058BIB024","first-page":"2208","volume":"1","author":"Nasiraghdam M.","year":"2011","journal-title":"J. Basic Appl. Sci. Res."},{"key":"S0218001421510058BIB025","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.826076"},{"key":"S0218001421510058BIB027","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.05.031"},{"key":"S0218001421510058BIB028","doi-asserted-by":"publisher","DOI":"10.1109\/CESCE.2010.16"},{"key":"S0218001421510058BIB029","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0040810"},{"key":"S0218001421510058BIB030","series-title":"Lecture Notes in Computer Sciences","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1007\/BFb0040812","volume-title":"EP 1998: Evolutionary Programming VII","volume":"1447","author":"Shi Y. H.","year":"1998"},{"key":"S0218001421510058BIB031","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1998.699146"},{"key":"S0218001421510058BIB032","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.826069"},{"key":"S0218001421510058BIB033","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.06.009"},{"issue":"3","key":"S0218001421510058BIB034","first-page":"479","volume":"24","author":"Wang F.","year":"2020","journal-title":"IEEE Trans. Evol. Comput."},{"key":"S0218001421510058BIB035","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.01.027"},{"key":"S0218001421510058BIB036","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106693"},{"key":"S0218001421510058BIB037","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.09.070"},{"key":"S0218001421510058BIB038","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.12.009"},{"key":"S0218001421510058BIB039","doi-asserted-by":"publisher","DOI":"10.1109\/ICNC.2014.6975891"},{"key":"S0218001421510058BIB040","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2052054"},{"key":"S0218001421510058BIB041","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.12.030"}],"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001421510058","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T03:50:54Z","timestamp":1696391454000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218001421510058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,7]]},"references-count":40,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2021,3,15]]}},"alternative-id":["10.1142\/S0218001421510058"],"URL":"https:\/\/doi.org\/10.1142\/s0218001421510058","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"type":"print","value":"0218-0014"},{"type":"electronic","value":"1793-6381"}],"subject":[],"published":{"date-parts":[[2020,10,7]]}}}