{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T05:01:02Z","timestamp":1767848462473,"version":"3.49.0"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3215131","type":"journal-article","created":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T20:58:31Z","timestamp":1667509111000},"page":"110497-110511","source":"Crossref","is-referenced-by-count":19,"title":["A Multi-Objective Quantum-Inspired Seagull Optimization Algorithm Based on Decomposition for Unmanned Aerial Vehicle Path Planning"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6223-9215","authenticated-orcid":false,"given":"Peng","family":"Wang","sequence":"first","affiliation":[{"name":"School of Automation, Nanjing University of Information Science and Technology, Nanjing, China"}]},{"given":"Zhiliang","family":"Deng","sequence":"additional","affiliation":[{"name":"School of Automation, Nanjing University of Information Science and Technology, Nanjing, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114430"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.06.006"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-019-04532-1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-020-09876-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.11.024"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105781"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s12065-021-00649-z"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2011.11.057"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-015-0443-5"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1004388"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.03.026"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.04.009"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.03.011"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.804320"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-015-1681-x"},{"key":"ref18","article-title":"Quantum-inspired evolutionary algorithm for continuous space optimization based on multiple chains encoding method of quantum bits","volume":"2014","author":"Rui","year":"2014","journal-title":"Math. Problems Eng."},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-007-9265-7"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-009-0005-7"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.21629\/jsee.2019.02.11"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.11.029"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-017-2641-9"},{"issue":"3","key":"ref24","first-page":"487","article-title":"Improvement on NIQGA and novel quantum-inspired evolutionary algorithm based on variable angle-distance","volume":"41","author":"Liu","year":"2011","journal-title":"J. Southeastern Univ."},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-015-9815-8"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2161872"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11218-8_1"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797969"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01020-0_20"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/0470011815.b2a15112"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107376"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/COASE.2019.8842980"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09921223.pdf?arnumber=9921223","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T04:07:57Z","timestamp":1706069277000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9921223\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3215131","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}