{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:28:21Z","timestamp":1743031701369,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030788100"},{"type":"electronic","value":"9783030788117"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-78811-7_20","type":"book-chapter","created":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:22:37Z","timestamp":1625613757000},"page":"205-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["UAV Path Planning Based on Variable Neighborhood Search Genetic Algorithm"],"prefix":"10.1007","author":[{"given":"Guo","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Rui","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Hongtao","family":"Lei","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Wenhua","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yuanming","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,7]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.comcom.2019.10.014","volume":"149","author":"S Aggarwal","year":"2020","unstructured":"Aggarwal, S., Kumar, N.: Path planning techniques for unmanned aerial vehicles: a review, solutions, and challenges. Comput. Commun. 149, 270\u2013299 (2020)","journal-title":"Comput. Commun."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"012021","DOI":"10.1088\/1742-6596\/1592\/1\/012021","volume":"1592","author":"F Li","year":"2020","unstructured":"Li, F., Li, Z.: Research on rapid planning of intelligent aircraft trajectory under multiple constraints. J. Phys. Conf. Ser. 1592, 012021 (2020)","journal-title":"J. Phys. Conf. Ser."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Chen, Y.-b., Luo, G.-c., Mei, Y.-s., Yu, J.-q., Su, X.-l.: UAV path planning using artificial potential field method updated by optimal control theory. Int. J. Syst. Sci. 47, 1407\u20131420 (2016)","DOI":"10.1080\/00207721.2014.929191"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ast.2015.12.021","volume":"50","author":"M Radmanesh","year":"2016","unstructured":"Radmanesh, M., Kumar, M.: Flight formation of UAVs in presence of moving obstacles using fast-dynamic mixed integer linear programming. Aerosp. Sci. Technol. 50, 149\u2013160 (2016)","journal-title":"Aerosp. Sci. Technol."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Dong, Z., Chen, Z., Zhou, R., Zhang, R.: A hybrid approach of virtual force and A\u2217 search algorithm for UAV path re-planning. In: 2011 6th IEEE Conference on Industrial Electronics and Applications, pp. 1140\u20131145. IEEE (2011)","DOI":"10.1109\/ICIEA.2011.5975758"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Arantes, M.d.S., Arantes, J.d.S., Toledo, C.F.M., Williams, B.C.: A hybrid multi-population genetic algorithm for UAV path planning. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016, pp. 853\u2013860 (2016)","DOI":"10.1145\/2908812.2908919"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"105086","DOI":"10.1109\/ACCESS.2019.2932008","volume":"7","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Bai, P., Liang, X., Wang, W., Zhang, J., Fu, Q.: Reconnaissance mission conducted by UAV swarms based on distributed PSO path planning algorithms. IEEE Access 7, 105086\u2013105099 (2019)","journal-title":"IEEE Access"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"2995","DOI":"10.1109\/ACCESS.2019.2962340","volume":"8","author":"B Li","year":"2019","unstructured":"Li, B., Qi, X., Yu, B., Liu, L.: Trajectory planning for UAV based on improved ACO algorithm. IEEE Access 8, 2995\u20133006 (2019)","journal-title":"IEEE Access"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Chen, J., Ye, F., Li, Y.: Travelling salesman problem for UAV path planning with two parallel optimization algorithms. In: 2017 Progress in Electromagnetics Research Symposium-Fall (PIERS-FALL), pp. 832\u2013837. IEEE (2017)","DOI":"10.1109\/PIERS-FALL.2017.8293250"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"338","DOI":"10.2514\/1.38510","volume":"46","author":"Y Eun","year":"2009","unstructured":"Eun, Y., Bang, H.: Cooperative task assignment\/path planning of multiple unmanned aerial vehicles using genetic algorithm. J. Aircr. 46, 338\u2013343 (2009)","journal-title":"J. Aircr."},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1016\/j.procir.2018.03.258","volume":"72","author":"K Peng","year":"2018","unstructured":"Peng, K., Wen, L., Li, R., Gao, L., Li, X.: An effective hybrid algorithm for permutation flow shop scheduling problem with setup time. Procedia CIRP 72, 1288\u20131292 (2018)","journal-title":"Procedia CIRP"},{"key":"20_CR12","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-981-13-0761-4_52","volume-title":"Harmony search and nature inspired optimization algorithms","author":"A Dixit","year":"2019","unstructured":"Dixit, A., Mishra, A., Shukla, A.: Vehicle routing problem with time windows using meta-heuristic algorithms: a survey. In: Yadav, N., Yadav, A., Bansal, J.C., Deep, K., Kim, J.H. (eds.) Harmony search and nature inspired optimization algorithms. AISC, vol. 741, pp. 539\u2013546. Springer, Singapore (2019). https:\/\/doi.org\/10.1007\/978-981-13-0761-4_52"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1016\/j.advengsoft.2011.05.014","volume":"42","author":"JJ Durillo","year":"2011","unstructured":"Durillo, J.J., Nebro, A.J.: jMetal: a Java framework for multi-objective optimization. Adv. Eng. Softw. 42, 760\u2013771 (2011)","journal-title":"Adv. Eng. Softw."}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78811-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:23:50Z","timestamp":1625613830000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78811-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030788100","9783030788117"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78811-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"7 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qingdao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iasei.org\/icsi2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"177","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"104","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4-5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}