{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T01:30:22Z","timestamp":1775093422045,"version":"3.50.1"},"reference-count":47,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":181,"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":["51808147"],"award-info":[{"award-number":["51808147"]}],"id":[{"id":"10.13039\/501100001809","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>Squirrel search algorithm (SSA) is a new biological\u2010inspired optimization algorithm, which has been proved to be more effective for solving unimodal, multimodal, and multidimensional optimization problems. However, similar to other swarm intelligence\u2010based algorithms, SSA also has its own disadvantages. In order to get better global convergence ability, an improved version of SSA called ISSA is proposed in this paper. Firstly, an adaptive strategy of predator presence probability is proposed to balance the exploration and exploitation capabilities of the algorithm. Secondly, a normal cloud model is introduced to describe the randomness and fuzziness of the foraging behavior of flying squirrels. Thirdly, a selection strategy between successive positions is incorporated to preserve the best position of flying squirrel individuals. Finally, in order to enhance the local search ability of the algorithm, a dimensional search enhancement strategy is utilized. 32 benchmark functions including unimodal, multimodal, and CEC 2014 functions are used to test the global search ability of the proposed ISSA. Experimental test results indicate that ISSA provides competitive performance compared with the basic SSA and other four well\u2010known state\u2010of\u2010the\u2010art optimization algorithms.<\/jats:p>","DOI":"10.1155\/2019\/6291968","type":"journal-article","created":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T23:39:16Z","timestamp":1562024356000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":47,"title":["An Improved Squirrel Search Algorithm for Optimization"],"prefix":"10.1155","volume":"2019","author":[{"given":"Tongyi","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5426-7788","authenticated-orcid":false,"given":"Weili","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2019,7]]},"reference":[{"key":"e_1_2_9_1_2","doi-asserted-by":"publisher","DOI":"10.1002\/9780470640425"},{"key":"e_1_2_9_2_2","doi-asserted-by":"publisher","DOI":"10.1108\/02644401211235834"},{"key":"e_1_2_9_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.04.023"},{"key":"e_1_2_9_4_2","first-page":"153","article-title":"Gradient-based algorithms, introduction to adaptive arrays","author":"Monzingo R. A.","year":"2011","journal-title":"IET Digital Library"},{"key":"e_1_2_9_5_2","volume-title":"Gradient-based learning algorithms for recurrent networks and their computational complexity, Backpropagation","author":"Williams R. J.","year":"1995"},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2005.852558"},{"key":"e_1_2_9_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/cplx.21560"},{"key":"e_1_2_9_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/cplx.21634"},{"key":"e_1_2_9_9_2","doi-asserted-by":"publisher","DOI":"10.1002\/cplx.20168"},{"key":"e_1_2_9_10_2","doi-asserted-by":"publisher","DOI":"10.1137\/0202009"},{"key":"e_1_2_9_11_2","volume-title":"Evolution Strategies \u2013A Comprehensive Introduction","author":"Beyer H.","year":"2002"},{"key":"e_1_2_9_12_2","doi-asserted-by":"crossref","unstructured":"KennedyJ.andEberhartR. Particle swarm optimization 4 Proceedings of the IEEE International Conference on Neural Networks 2002 IEEE 1942\u20131948.","DOI":"10.1109\/ICNN.1995.488968"},{"key":"e_1_2_9_13_2","volume-title":"A Powerful and Efficient Algorithm for Numerical Function Optimization: Artificial Bee Colony (ABC) Algorithm","author":"Karaboga D.","year":"2007"},{"key":"e_1_2_9_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2006.329691"},{"key":"e_1_2_9_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2013.12.007"},{"key":"e_1_2_9_16_2","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177011077"},{"key":"e_1_2_9_17_2","first-page":"735","article-title":"An improved Big Bang-Big Crunch algorithm for structural damage detection","volume":"68","author":"Yin Z.","year":"2018","journal-title":"Structural Engineering and Mechanics"},{"key":"e_1_2_9_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.03.004"},{"key":"e_1_2_9_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.06.033"},{"key":"e_1_2_9_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2017.05.014"},{"key":"e_1_2_9_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.10.036"},{"key":"e_1_2_9_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2017.03.014"},{"key":"e_1_2_9_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2017.01.046"},{"key":"e_1_2_9_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.857610"},{"key":"e_1_2_9_25_2","unstructured":"PeramT. VeeramachaneniK. andMohanC. K. Fitness-distance-ratio based particle swarm optimization Proceedings of the Swarm Intelligence Symposium 2003 Sis \u201803. Proceedings of the IEEE 2012 174\u2013181 2-s2.0-84942155292."},{"key":"e_1_2_9_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.826071"},{"key":"e_1_2_9_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2203138"},{"key":"e_1_2_9_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.05.007"},{"key":"e_1_2_9_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2016.11.003"},{"key":"e_1_2_9_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.10.040"},{"key":"e_1_2_9_31_2","unstructured":"PanW. T. A new evolutionary computation approach: fruit fly optimization algorithm Proceedings of the Conference of Digital Technology and Innovation Management 2011 Taipei Taiwan."},{"key":"e_1_2_9_32_2","doi-asserted-by":"publisher","DOI":"10.1080\/09540091.2013.854735"},{"key":"e_1_2_9_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.01.048"},{"key":"e_1_2_9_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2014.02.005"},{"key":"e_1_2_9_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2014.02.021"},{"key":"e_1_2_9_36_2","first-page":"245","article-title":"Structural damage identification using cloud model based fruit fly optimization algorithm","volume":"67","author":"Zheng T.","year":"2018","journal-title":"Structural Engineering and Mechanics"},{"key":"e_1_2_9_37_2","article-title":"A novel nature-inspired algorithm for optimization: Squirrel search algorithm","author":"Jain M.","year":"2018","journal-title":"Swarm and Evolutionary Computation"},{"key":"e_1_2_9_38_2","doi-asserted-by":"crossref","unstructured":"YangX.-S. A new metaheuristic bat-inspired algorithm 284 Proceedings of the Nature Inspired Cooperative Strategies for Optimization (NICSO 2010) 2010 Springer Berlin Heidelberg 65\u201374 Zbl1197.90348.","DOI":"10.1007\/978-3-642-12538-6_6"},{"key":"e_1_2_9_39_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2013.06.001"},{"key":"e_1_2_9_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"e_1_2_9_41_2","first-page":"15","article-title":"Membership clouds and membership clouds generator","volume":"32","author":"Li D.","year":"1995","journal-title":"International Journal of Computational Research and Development"},{"key":"e_1_2_9_42_2","doi-asserted-by":"publisher","DOI":"10.1002\/int.20340"},{"key":"e_1_2_9_43_2","unstructured":"LiangJ. QuB. andSuganthanP. Problem definitions and evaluation criteria for the CEC 2014 special session and competition on single objective real-parameter numerical optimization Zhengzhou China and Technical Report 2014 Computational Intelligence Laboratory Zhengzhou University Nanyang Technological University Singapore."},{"key":"e_1_2_9_44_2","doi-asserted-by":"crossref","unstructured":"YangX.-S.andDebS. Cuckoo search via L\u00e9vy flights Proceedings of the World Congress on Nature and Biologically Inspired Computing (NABIC \u203209) 2009 210\u2013214 https:\/\/doi.org\/10.1109\/NABIC.2009.5393690 2-s2.0-77949623076.","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"e_1_2_9_45_2","doi-asserted-by":"publisher","DOI":"10.1504\/IJMMNO.2013.055204"},{"key":"e_1_2_9_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.02.002"},{"key":"e_1_2_9_47_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.03.047"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2019\/6291968.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2019\/6291968.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2019\/6291968","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T11:52:38Z","timestamp":1723031558000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2019\/6291968"}},"subtitle":[],"editor":[{"given":"Alex","family":"Alexandridis","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.1155\/2019\/6291968"],"URL":"https:\/\/doi.org\/10.1155\/2019\/6291968","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-02-15","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-05-28","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-07-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"6291968"}}