{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:16:11Z","timestamp":1755800171691,"version":"3.40.5"},"reference-count":61,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T00:00:00Z","timestamp":1599609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2020,9,9]]},"abstract":"<jats:p>Conventional optimization methods are not efficient enough to solve many of the naturally complicated optimization problems. Thus, inspired by nature, metaheuristic algorithms can be utilized as a new kind of problem solvers in solution to these types of optimization problems. In this paper, an optimization algorithm is proposed which is capable of finding the expected quality of different locations and also tuning its exploration-exploitation dilemma to the location of an individual. A novel particle swarm optimization algorithm is presented which implements the conditioning learning behavior so that the particles are led to perform a natural conditioning behavior on an unconditioned motive. In the problem space, particles are classified into several categories so that if a particle lies within a low diversity category, it would have a tendency to move towards its best personal experience. But, if the particle\u2019s category is with high diversity, it would have the tendency to move towards the global optimum of that category. The idea of the birds\u2019 sensitivity to its flying space is also utilized to increase the particles\u2019 speed in undesired spaces in order to leave those spaces as soon as possible. However, in desirable spaces, the particles\u2019 velocity is reduced to provide a situation in which the particles have more time to explore their environment. In the proposed algorithm, the birds\u2019 instinctive behavior is implemented to construct an initial population randomly or chaotically. Experiments provided to compare the proposed algorithm with the state-of-the-art methods show that our optimization algorithm is one of the most efficient and appropriate ones to solve the static optimization problems.<\/jats:p>","DOI":"10.1155\/2020\/2010545","type":"journal-article","created":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T23:30:40Z","timestamp":1599694240000},"page":"1-18","source":"Crossref","is-referenced-by-count":4,"title":["An Adaptive Particle Swarm Optimization Algorithm for Unconstrained Optimization"],"prefix":"10.1155","volume":"2020","author":[{"given":"Feng","family":"Qian","sequence":"first","affiliation":[{"name":"School of Mechatronic Engineering and Automation, Shanghai University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4686-0930","authenticated-orcid":true,"given":"Mohammad Reza","family":"Mahmoudi","sequence":"additional","affiliation":[{"name":"Department of Statistics, Faculty of Science, Fasa University, Fasa 7461, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8717-7711","authenticated-orcid":true,"given":"Ham\u00efd","family":"Parv\u00efn","sequence":"additional","affiliation":[{"name":"Institute of Research and Development, Duy Tan University, Da Nang 550000, Vietnam"},{"name":"Faculty of Information Technology, Duy Tan University, Da Nang 550000, Vietnam"},{"name":"Department of Computer Science, Nourabad Mamasani Branch, Islamic Azad University, Mamasani 7351, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim-Hung","family":"Pho","sequence":"additional","affiliation":[{"name":"Fractional Calculus, Optimization and Algebra Research Group, Faculty of Mathematics and Statistics, Ton Duc Thang University, Ho Chi Minh, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bui Anh","family":"Tuan","sequence":"additional","affiliation":[{"name":"Department of Mathematics Education, Teachers College, Can Tho University, Can Tho, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1080\/10095020.2018.1489576"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/s11676-018-0803-6"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.01.126"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.987"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.17705\/1cais.03723"},{"year":"2010","key":"6"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.06.043"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/4235.843494"},{"volume-title":"Benchmark functions for the CEC\u20192010 special session and competition on large-scale global optimization","year":"2009","key":"9"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112949"},{"year":"2004","key":"11"},{"year":"2004","key":"12"},{"year":"2006","key":"13"},{"year":"2006","key":"14"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1137\/0202009"},{"volume":"2","journal-title":"International Journal of Soft Computing and Engineering","year":"2012","key":"16"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1504\/ijcat.2012.048684"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-007-9149-x"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2011.08.003"},{"year":"2005","key":"25"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1177\/003754970107600201"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.12733\/jics20101559"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1061\/(asce)cp.1943-5487.0000163"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/9482073"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1016\/j.cageo.2011.12.011"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2013.08.027"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.12.026"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.11.003"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.10.047"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/2959370"},{"key":"39","first-page":"182","volume":"294","year":"2015","journal-title":"Innovative Applications of Artificial Neural Networks in Engineering"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/2167413"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2013.05.005"},{"key":"42","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-016-0805-z"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.3390\/a9030051"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.3390\/a9030059"},{"key":"45","doi-asserted-by":"publisher","DOI":"10.4172\/2090-4908.1000134"},{"key":"47","doi-asserted-by":"publisher","DOI":"10.1038\/261459a0"},{"key":"48","doi-asserted-by":"publisher","DOI":"10.1023\/a:1008202821328"},{"key":"49","doi-asserted-by":"publisher","DOI":"10.1109\/tsmcb.2011.2144582"},{"key":"50","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2010.04.024"},{"year":"2011","key":"52"},{"key":"53","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2013.12.005"},{"year":"2005","key":"54"},{"key":"55","doi-asserted-by":"publisher","DOI":"10.1049\/iet-gtd.2019.0878"},{"key":"56","doi-asserted-by":"publisher","DOI":"10.1049\/iet-gtd.2018.5812"},{"key":"57","doi-asserted-by":"publisher","DOI":"10.1080\/15325000802084380"},{"key":"58","doi-asserted-by":"publisher","DOI":"10.1016\/j.energy.2015.01.113"},{"key":"59","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijepes.2012.08.058"},{"key":"60","doi-asserted-by":"publisher","DOI":"10.1016\/j.enconman.2014.03.041"},{"issue":"6","key":"61","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1049\/iet-gtd.2014.0196","volume":"9","year":"2015","journal-title":"Transmission & Distribution"},{"key":"62","doi-asserted-by":"publisher","DOI":"10.3233\/ifs-141320"},{"key":"63","doi-asserted-by":"publisher","DOI":"10.1049\/iet-gtd.2013.0710"},{"key":"64","doi-asserted-by":"publisher","DOI":"10.1080\/15325000802548780"},{"key":"65","doi-asserted-by":"publisher","DOI":"10.3233\/ifs-151663"},{"key":"66","doi-asserted-by":"publisher","DOI":"10.3233\/jifs-171688"},{"key":"67","doi-asserted-by":"publisher","DOI":"10.3233\/jifs-171289"},{"key":"68","doi-asserted-by":"publisher","DOI":"10.3233\/jifs-18631"},{"key":"69","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-019-7515-6"},{"key":"70","doi-asserted-by":"publisher","DOI":"10.1109\/jsyst.2019.2896408"},{"key":"71","doi-asserted-by":"publisher","DOI":"10.1109\/jsyst.2018.2889988"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/2010545.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/2010545.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/2010545.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T23:30:43Z","timestamp":1599694243000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2020\/2010545\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,9]]},"references-count":61,"alternative-id":["2010545","2010545"],"URL":"https:\/\/doi.org\/10.1155\/2020\/2010545","relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2020,9,9]]}}}