{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T08:04:43Z","timestamp":1771920283445,"version":"3.50.1"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["21576127"],"award-info":[{"award-number":["21576127"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Basic Scientific Research Project of Institution of Higher Learning of Liaoning Province","award":["2017FWDF10"],"award-info":[{"award-number":["2017FWDF10"]}]},{"DOI":"10.13039\/501100005047","name":"Natural Science Foundation of Liaoning Province","doi-asserted-by":"publisher","award":["20180550700"],"award-info":[{"award-number":["20180550700"]}],"id":[{"id":"10.13039\/501100005047","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2967399","type":"journal-article","created":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T21:06:26Z","timestamp":1579295186000},"page":"22203-22224","source":"Crossref","is-referenced-by-count":14,"title":["Improved Grasshopper Algorithm Based on Gravity Search Operator and Pigeon Colony Landmark Operator"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1883-9958","authenticated-orcid":false,"given":"S. S.","family":"Guo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8853-1927","authenticated-orcid":false,"given":"J. S.","family":"Wang","sequence":"additional","affiliation":[]},{"given":"W.","family":"Xie","sequence":"additional","affiliation":[]},{"given":"M. W.","family":"Guo","sequence":"additional","affiliation":[]},{"given":"L. F.","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-011-0241-y"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2014.07.012"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/SIS.2005.1501604"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICINFA.2008.4608059"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1108\/IJICC-02-2014-0005"},{"key":"ref30","first-page":"78","article-title":"Gravitational search algorithm based on dynamic gravitational constant and population decline","volume":"38","author":"li","year":"2018","journal-title":"Journal of System Science and Mathematics"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2014.04.005"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2951716"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.07.015"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-405163-8.00008-9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MCS.2002.1004010"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.11.033"},{"key":"ref11","first-page":"32","article-title":"An optimization model based on animal local government: Fish swarm algorithm","volume":"22","author":"li","year":"2002","journal-title":"Systems Engineering - Theory & Practice"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.4249\/scholarpedia.6915"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.05.008"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1108\/02644401211235834"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2015.01.010"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.07.006"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2017.07.002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2017.01.004"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00202-019-00762-4"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2891673"},{"key":"ref4","first-page":"13","article-title":"Three-dimensional flight path planning of UAV based on improved antlion algorithm","volume":"40","author":"huang","year":"2018","journal-title":"J Electron Inf Technol"},{"key":"ref27","first-page":"263","article-title":"Hybrid locust optimization algorithm for job shop scheduling problem","volume":"55","author":"yan","year":"2019","journal-title":"Comput Eng Appl"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-018-3343-2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/15325008.2019.1607922"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.03.004"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.energy.2016.05.105"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1177\/1687814017717663"},{"key":"ref7","first-page":"366","article-title":"Application of bat algorithm in multi-target and multi-selection backpack problem","volume":"30","author":"li","year":"2013","journal-title":"Comput Simul"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmatprotec.2008.06.028"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.02.041"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.09.015"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.3390\/rs11091134"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2018.07.044"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2859816"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ast.2017.08.037"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.15672\/hujms.507579"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.06.023"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/08961985.pdf?arnumber=8961985","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:51:00Z","timestamp":1639770660000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8961985\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2967399","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}