- Giovanni Campuzano ORCID:orcid.org/0000-0001-6808-923011,
- Eduardo Lalla-Ruiz ORCID:orcid.org/0000-0002-7286-950111 &
- Martijn Mes ORCID:orcid.org/0000-0001-9676-525911
Part of the book series:Lecture Notes in Computer Science ((LNTCS,volume 13004))
Included in the following conference series:
2389Accesses
Abstract
The Traveling Salesman Problem (TSP) is a well-known optimization problem with a wide range of extensions and applications in delivery systems. In this paper, we consider a recent extension of the TSP where a truck in collaboration with a single drone should visit a set of customers while minimizing the transportation times. We propose a Variable Neighbourhood Search (VNS) and a Multi-Start VNS (MS-VNS) algorithm, develop new neighbourhood structures, and compare the solutions against an existing mixed-integer linear programming (MILP) formulation. We take a set of instances based on existing benchmarks from the related literature. Results point out that the new neighbourhood structures substantially improve the performance of the VNS algorithms. Furthermore, results also show that the exact method is only able to find competitive solutions for small sets of instances, whereas our MS-VNS approach reaches better solution quality for large instances.
This is a preview of subscription content,log in via an institution to check access.
Access this chapter
Subscribe and save
- Get 10 units per month
- Download Article/Chapter or eBook
- 1 Unit = 1 Article or 1 Chapter
- Cancel anytime
Buy Now
- Chapter
- JPY 3498
- Price includes VAT (Japan)
- eBook
- JPY 13727
- Price includes VAT (Japan)
- Softcover Book
- JPY 17159
- Price includes VAT (Japan)
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Agatz, N., Bouman, P., Schmidt, M.: Optimization approaches for the traveling salesman problem with drone. Transp. Sci.52(4), 965–981 (2018)
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)
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–212. Springer, Heidelberg (2001).https://doi.org/10.1007/3-540-45365-2_21
Carlsson, J.G., Song, S.: Coordinated logistics with a truck and a drone. Manage. Sci.64(9), 4052–4069 (2018)
Chen, P., Huang, H., Dong, X.: Variable neighborhood search algorithm for fleet size and mixed vehicle routing problem. J. Syst. Simul.23(9), 1945–1950 (2011)
Dell’Amico, M., Montemanni, R., Novellani, S.: Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem. Optim. Lett.15(5), 1617–1648 (2019).https://doi.org/10.1007/s11590-019-01492-z
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–1222 (2016)
Dorling, K., Heinrichs, J., Messier, G.G., Magierowski, S.: Vehicle routing problems for drone delivery. IEEE Trans. Syst. Man Cybern. Syst.47(1), 70–85 (2016)
El-Adle, A.M., Ghoniem, A., Haouari, M.: Parcel delivery by vehicle and drone. J. Oper. Res. Soc. 1–19 (2019)
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–102 (2018)
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–290 (2020)
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–680 (2020)
Ha, Q.M., Deville, Y., Pham, Q.D., Hà, M.H.: On the min-cost traveling salesman problem with drone. Transp. Res. Part C Emerg. Technol.86, 597–621 (2018)
Hansen, P., Mladenović, N.: An introduction to variable neighborhood search. In: Voß S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-heuristics, pp. 433–458. Springer, Boston (1999).https://doi.org/10.1007/978-1-4615-5775-3_30
Hansen, P., Mladenović, N., Pérez, J.A.M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res.175(1), 367–407 (2010)
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–233 (2019)
Kocatürk, F., Tütüncü, 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–26 (2021).https://doi.org/10.1007/s10479-021-04137-6
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–315. IEEE (2017)
Marinelli, M., Caggiani, L., Ottomanelli, M., Dell’Orco, M.: En route truck-drone parcel delivery for optimal vehicle routing strategies. IET Intell. Transport Syst.12(4), 253–261 (2017)
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–109 (2015)
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–398 (2020)
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–106 (2015)
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 One15(2), e0227702 (2020)
Raj, R., Murray, C.: The multiple flying sidekicks traveling salesman problem with variable drone speeds. Transp. Res. Part C Emerg. Technol.120, 102813 (2020)
Roberti, R., Ruthmair, M.: Exact methods for the traveling salesman problem with drone. Transp. Sci.55(2), 315–335 (2021)
Schermer, D., Moeini, M., Wendt, O.: A branch-and-cut approach and alternative formulations for the traveling salesman problem with drone. Networks76(2), 164–186 (2020)
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–53 (2018)
Vásquez, 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)
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)
Author information
Authors and Affiliations
University of Twente, Drienerlolaan 5, 7500 AE, Enschede, The Netherlands
Giovanni Campuzano, Eduardo Lalla-Ruiz & Martijn Mes
- Giovanni Campuzano
You can also search for this author inPubMed Google Scholar
- Eduardo Lalla-Ruiz
You can also search for this author inPubMed Google Scholar
- Martijn Mes
You can also search for this author inPubMed Google Scholar
Corresponding author
Correspondence toGiovanni Campuzano.
Editor information
Editors and Affiliations
IEBIS, University of Twente, Enschede, Overijssel, The Netherlands
Martijn Mes
IEBIS, University of Twente, Enschede, Overijssel, The Netherlands
Eduardo Lalla-Ruiz
IWI-Institute of Information Systems, University of Hamburg, Hamburg, Germany
Stefan Voß
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Campuzano, G., Lalla-Ruiz, E., Mes, M. (2021). A Multi-start VNS Algorithm for the TSP-D with Energy Constraints. In: Mes, M., Lalla-Ruiz, E., Voß, S. (eds) Computational Logistics. ICCL 2021. Lecture Notes in Computer Science(), vol 13004. Springer, Cham. https://doi.org/10.1007/978-3-030-87672-2_26
Download citation
Published:
Publisher Name:Springer, Cham
Print ISBN:978-3-030-87671-5
Online ISBN:978-3-030-87672-2
eBook Packages:Computer ScienceComputer Science (R0)
Share this paper
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative