{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T17:57:26Z","timestamp":1770832646425,"version":"3.50.1"},"reference-count":50,"publisher":"Wiley","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"crossref","award":["2017YFC1500400"],"award-info":[{"award-number":["2017YFC1500400"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"crossref","award":["51808147"],"award-info":[{"award-number":["51808147"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2017YFC1500400"],"award-info":[{"award-number":["2017YFC1500400"]}],"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":["51808147"],"award-info":[{"award-number":["51808147"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Intelligence and Neuroscience"],"published-print":{"date-parts":[[2019,8,1]]},"abstract":"<jats:p>Lightning attachment procedure optimization (LAPO) is a new global optimization algorithm inspired by the attachment procedure of lightning in nature. However, similar to other metaheuristic algorithms, LAPO also has its own disadvantages. To obtain better global searching ability, an enhanced version of LAPO called ELAPO has been proposed in this paper. A quasi-opposition-based learning strategy is incorporated to improve both exploration and exploitation abilities by considering an estimate and its opposite simultaneously. Moreover, a dimensional search enhancement strategy is proposed to intensify the exploitation ability of the algorithm. 32 benchmark functions including unimodal, multimodal, and CEC 2014 functions are utilized to test the effectiveness of the proposed algorithm. Numerical results indicate that ELAPO can provide better or competitive performance compared with the basic LAPO and other five state-of-the-art optimization algorithms.<\/jats:p>","DOI":"10.1155\/2019\/1589303","type":"journal-article","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T19:30:44Z","timestamp":1564687844000},"page":"1-24","source":"Crossref","is-referenced-by-count":22,"title":["An Enhanced Lightning Attachment Procedure Optimization with Quasi-Opposition-Based Learning and Dimensional Search Strategies"],"prefix":"10.1155","volume":"2019","author":[{"given":"Tongyi","family":"Zheng","sequence":"first","affiliation":[{"name":"School of Civil Engineering, Guangzhou University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5426-7788","authenticated-orcid":true,"given":"Weili","family":"Luo","sequence":"additional","affiliation":[{"name":"School of Civil Engineering, Guangzhou University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2016.2634625"},{"key":"2","volume":"5","year":"2006"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.11.003"},{"issue":"1","key":"4","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TEVC.2010.2059031","volume":"15","year":"2011","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2008.919004"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/9482073"},{"issue":"4","key":"7","first-page":"28","volume":"1","year":"2007","journal-title":"IEEE Computational Intelligence Magazine"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/8034573"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/5675349"},{"key":"14","first-page":"65","volume-title":"A new metaheuristic bat-inspired algorithm","year":"2010"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2010.07.049"},{"issue":"3","key":"17","first-page":"245","volume":"67","year":"2018","journal-title":"Structural Engineering and Mechanics"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-1920-1"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.03.003"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2015.01.010"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1142\/s1469026816500115"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2016.01.008"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2016.03.001"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2017.01.004"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.09.035"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2017.05.014"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2017.06.003"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/6291968"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-018-9675-0"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2018.04.007"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2007.900837"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.03.004"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2005.04.005"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1007\/s00707-009-0270-4"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.08.023"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1007\/s12597-009-0003-4"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.04.126"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2012.09.003"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1504\/ijcse.2011.041221"},{"key":"42","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-1870-7"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1016\/j.compositesa.2019.02.002"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.06.033"},{"key":"46","doi-asserted-by":"publisher","DOI":"10.5370\/jeet.2013.8.4.686"},{"key":"47","doi-asserted-by":"publisher","DOI":"10.1061\/(asce)me.1943-5479.0000398"},{"key":"48","doi-asserted-by":"publisher","DOI":"10.21307\/ijssis-2017-801"},{"key":"50","doi-asserted-by":"publisher","DOI":"10.3390\/a7040663"},{"key":"52","doi-asserted-by":"publisher","DOI":"10.1016\/j.asej.2013.06.002"},{"key":"56","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijepes.2016.02.051"},{"key":"57","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijepes.2015.06.023"},{"key":"58","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/2749035"},{"key":"59","doi-asserted-by":"publisher","DOI":"10.5267\/j.ijiec.2015.8.004"},{"issue":"6","key":"60","first-page":"735","volume":"68","year":"2018","journal-title":"Structural Engineering and Mechanics"},{"key":"62","year":"2013"},{"key":"63","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.02.002"},{"key":"64","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.03.047"}],"container-title":["Computational Intelligence and Neuroscience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2019\/1589303.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2019\/1589303.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2019\/1589303.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,21]],"date-time":"2019-09-21T09:46:05Z","timestamp":1569059165000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/cin\/2019\/1589303\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,1]]},"references-count":50,"alternative-id":["1589303","1589303"],"URL":"https:\/\/doi.org\/10.1155\/2019\/1589303","relation":{},"ISSN":["1687-5265","1687-5273"],"issn-type":[{"value":"1687-5265","type":"print"},{"value":"1687-5273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,1]]}}}