{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T12:41:39Z","timestamp":1774269699236,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030876715","type":"print"},{"value":"9783030876722","type":"electronic"}],"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-87672-2_26","type":"book-chapter","created":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T21:02:46Z","timestamp":1632258166000},"page":"393-409","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Multi-start VNS Algorithm for the TSP-D with Energy Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6808-9230","authenticated-orcid":false,"given":"Giovanni","family":"Campuzano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7286-9501","authenticated-orcid":false,"given":"Eduardo","family":"Lalla-Ruiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9676-5259","authenticated-orcid":false,"given":"Martijn","family":"Mes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,22]]},"reference":[{"issue":"4","key":"26_CR1","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1287\/trsc.2017.0791","volume":"52","author":"N Agatz","year":"2018","unstructured":"Agatz, N., Bouman, P., Schmidt, M.: Optimization approaches for the traveling salesman problem with drone. Transp. Sci. 52(4), 965\u2013981 (2018)","journal-title":"Transp. Sci."},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"102913","DOI":"10.1016\/j.trc.2020.102913","volume":"124","author":"M Boccia","year":"2021","unstructured":"Boccia, M., Masone, A., Sforza, A., Sterle, C.: A column-and-row generation approach for the flying sidekick travelling salesman problem. Transp. Res. Part C Emerg. Technol. 124, 102913 (2021)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/3-540-45365-2_21","volume-title":"Applications of Evolutionary Computing","author":"EK Burke","year":"2001","unstructured":"Burke, E.K., Cowling, P.I., Keuthen, R.: Effective local and guided variable neighbourhood search methods for the asymmetric travelling salesman problem. In: Boers, E.J.W. (ed.) EvoWorkshops 2001. LNCS, vol. 2037, pp. 203\u2013212. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45365-2_21"},{"issue":"9","key":"26_CR4","doi-asserted-by":"publisher","first-page":"4052","DOI":"10.1287\/mnsc.2017.2824","volume":"64","author":"JG Carlsson","year":"2018","unstructured":"Carlsson, J.G., Song, S.: Coordinated logistics with a truck and a drone. Manage. Sci. 64(9), 4052\u20134069 (2018)","journal-title":"Manage. Sci."},{"issue":"9","key":"26_CR5","first-page":"1945","volume":"23","author":"P Chen","year":"2011","unstructured":"Chen, P., Huang, H., Dong, X.: Variable neighborhood search algorithm for fleet size and mixed vehicle routing problem. J. Syst. Simul. 23(9), 1945\u20131950 (2011)","journal-title":"J. Syst. Simul."},{"issue":"5","key":"26_CR6","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1007\/s11590-019-01492-z","volume":"15","author":"M Dell\u2019Amico","year":"2019","unstructured":"Dell\u2019Amico, M., Montemanni, R., Novellani, S.: Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem. Optim. Lett. 15(5), 1617\u20131648 (2019). https:\/\/doi.org\/10.1007\/s11590-019-01492-z","journal-title":"Optim. Lett."},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1016\/j.procs.2016.05.473","volume":"80","author":"A Dhahri","year":"2016","unstructured":"Dhahri, A., Mjirda, A., Zidi, K., Ghedira, K.: A VNS-based heuristic for solving the vehicle routing problem with time windows and vehicle preventive maintenance constraints. Procedia Comput. Sci. 80, 1212\u20131222 (2016)","journal-title":"Procedia Comput. Sci."},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/TSMC.2016.2582745","volume":"47","author":"K Dorling","year":"2016","unstructured":"Dorling, K., Heinrichs, J., Messier, G.G., Magierowski, S.: Vehicle routing problems for drone delivery. IEEE Trans. Syst. Man Cybern. Syst. 47(1), 70\u201385 (2016)","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"El-Adle, A.M., Ghoniem, A., Haouari, M.: Parcel delivery by vehicle and drone. J. Oper. Res. Soc. 1\u201319 (2019)","DOI":"10.1080\/01605682.2019.1671156"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.endm.2018.03.013","volume":"66","author":"JC de Freitas","year":"2018","unstructured":"de Freitas, J.C., Penna, P.H.V.: A randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem. Electron. Notes Discrete Math. 66, 95\u2013102 (2018)","journal-title":"Electron. Notes Discrete Math."},{"issue":"1","key":"26_CR11","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/itor.12671","volume":"27","author":"JC de Freitas","year":"2020","unstructured":"de Freitas, J.C., Penna, P.H.V.: A variable neighborhood search for flying sidekick traveling salesman problem. Int. Trans. Oper. Res. 27(1), 267\u2013290 (2020)","journal-title":"Int. Trans. Oper. Res."},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.trc.2020.02.030","volume":"114","author":"PL Gonzalez-R","year":"2020","unstructured":"Gonzalez-R, P.L., Canca, D., Andrade-Pineda, J.L., Calle, M., Leon-Blanco, J.M.: Truck-drone team logistics: a heuristic approach to multi-drop route planning. Transp. Res. Part C Emerg. Technol. 114, 657\u2013680 (2020)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.trc.2017.11.015","volume":"86","author":"QM Ha","year":"2018","unstructured":"Ha, Q.M., Deville, Y., Pham, Q.D., H\u00e0, M.H.: On the min-cost traveling salesman problem with drone. Transp. Res. Part C Emerg. Technol. 86, 597\u2013621 (2018)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"26_CR14","doi-asserted-by":"publisher","unstructured":"Hansen, P., Mladenovi\u0107, N.: An introduction to variable neighborhood search. In: Vo\u00df S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-heuristics, pp. 433\u2013458. Springer, Boston (1999). https:\/\/doi.org\/10.1007\/978-1-4615-5775-3_30","DOI":"10.1007\/978-1-4615-5775-3_30"},{"issue":"1","key":"26_CR15","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., P\u00e9rez, J.A.M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.ijpe.2019.01.010","volume":"214","author":"HY Jeong","year":"2019","unstructured":"Jeong, H.Y., Song, B.D., Lee, S.: Truck-drone hybrid delivery routing: Payload-energy dependency and no-fly zones. Int. J. Prod. Econ. 214, 220\u2013233 (2019)","journal-title":"Int. J. Prod. Econ."},{"key":"26_CR17","doi-asserted-by":"publisher","unstructured":"Kocat\u00fcrk, F., T\u00fct\u00fcnc\u00fc, G.Y., Salhi, S.: The multi-depot heterogeneous VRP with backhauls: formulation and a hybrid VNS with GRAMPS meta-heuristic approach. Ann. Oper. Res. 1\u201326 (2021). https:\/\/doi.org\/10.1007\/s10479-021-04137-6","DOI":"10.1007\/s10479-021-04137-6"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Liu, Z., Sengupta, R., Kurzhanskiy, A.: A power consumption model for multi-rotor small unmanned aircraft systems. In: 2017 International Conference on Unmanned Aircraft Systems (ICUAS), pp. 310\u2013315. IEEE (2017)","DOI":"10.1109\/ICUAS.2017.7991310"},{"issue":"4","key":"26_CR19","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1049\/iet-its.2017.0227","volume":"12","author":"M Marinelli","year":"2017","unstructured":"Marinelli, M., Caggiani, L., Ottomanelli, M., Dell\u2019Orco, M.: En route truck-drone parcel delivery for optimal vehicle routing strategies. IET Intell. Transport Syst. 12(4), 253\u2013261 (2017)","journal-title":"IET Intell. Transport Syst."},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.trc.2015.03.005","volume":"54","author":"CC Murray","year":"2015","unstructured":"Murray, C.C., Chu, A.G.: The flying sidekick traveling salesman problem: optimization of drone-assisted parcel delivery. Transp. Res. Part C Emerg. Technol. 54, 86\u2013109 (2015)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"26_CR21","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.trc.2019.11.003","volume":"110","author":"CC Murray","year":"2020","unstructured":"Murray, C.C., Raj, R.: The multiple flying sidekicks traveling salesman problem: parcel delivery with multiple drones. Transp. Res. Part C Emerg. Technol. 110, 368\u2013398 (2020)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"issue":"1","key":"26_CR22","first-page":"84","volume":"15","author":"T Oda","year":"2015","unstructured":"Oda, T., Liu, Y., Sakamoto, S., Elmazi, D., Barolli, L., Xhafa, F.: Analysis of mesh router placement in wireless mesh networks using Friedman test considering different meta-heuristics. Int. J. Commun. Netw. Distrib. Syst. 15(1), 84\u2013106 (2015)","journal-title":"Int. J. Commun. Netw. Distrib. Syst."},{"issue":"2","key":"26_CR23","doi-asserted-by":"publisher","first-page":"e0227702","DOI":"10.1371\/journal.pone.0227702","volume":"15","author":"X Qi","year":"2020","unstructured":"Qi, X., Fu, Z., Xiong, J., Zha, W.: Multi-start heuristic approaches for one-to-one pickup and delivery problems with shortest-path transport along real-life paths. PloS One 15(2), e0227702 (2020)","journal-title":"PloS One"},{"key":"26_CR24","doi-asserted-by":"publisher","first-page":"102813","DOI":"10.1016\/j.trc.2020.102813","volume":"120","author":"R Raj","year":"2020","unstructured":"Raj, R., Murray, C.: The multiple flying sidekicks traveling salesman problem with variable drone speeds. Transp. Res. Part C Emerg. Technol. 120, 102813 (2020)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"issue":"2","key":"26_CR25","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1287\/trsc.2020.1017","volume":"55","author":"R Roberti","year":"2021","unstructured":"Roberti, R., Ruthmair, M.: Exact methods for the traveling salesman problem with drone. Transp. Sci. 55(2), 315\u2013335 (2021)","journal-title":"Transp. Sci."},{"issue":"2","key":"26_CR26","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1002\/net.21958","volume":"76","author":"D Schermer","year":"2020","unstructured":"Schermer, D., Moeini, M., Wendt, O.: A branch-and-cut approach and alternative formulations for the traveling salesman problem with drone. Networks 76(2), 164\u2013186 (2020)","journal-title":"Networks"},{"key":"26_CR27","doi-asserted-by":"crossref","unstructured":"Tu, P.A., Dat, N.T., Dung, P.Q.: Traveling salesman problem with multiple drones. In: Proceedings of the Ninth International Symposium on Information and Communication Technology, pp. 46\u201353 (2018)","DOI":"10.1145\/3287921.3287932"},{"key":"26_CR28","doi-asserted-by":"publisher","first-page":"105127","DOI":"10.1016\/j.cor.2020.105127","volume":"127","author":"SA V\u00e1squez","year":"2020","unstructured":"V\u00e1squez, S.A., Angulo, G., Klapp, M.A.: An exact solution method for the TSP with drone based on decomposition. Comput. Oper. Res. 127, 105127 (2020)","journal-title":"Comput. Oper. Res."},{"key":"26_CR29","doi-asserted-by":"publisher","first-page":"102668","DOI":"10.1016\/j.trd.2020.102668","volume":"90","author":"J Zhang","year":"2021","unstructured":"Zhang, J., Campbell, J.F., Sweeney, D.C., II., Hupman, A.C.: Energy consumption models for delivery drones: a comparison and assessment. Transp. Res. Part D Transp. Environ. 90, 102668 (2021)","journal-title":"Transp. Res. Part D Transp. Environ."}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87672-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T04:57:49Z","timestamp":1699505869000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87672-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030876715","9783030876722"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87672-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 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":"iccl22021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccl2021.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"111","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":"42","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":"38% - 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":"2","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}