This paper considers a version of the flying sidekick travel- ing salesman problem in which parcels are delivered to cus- tomers by either a truck or a set of identical flying drones. The drones’ flights are limited by the battery endurance and each flight is made of a launch, a service to a customer, and a return: launch and return must happen when the truck is stationary. These operations require time and when multi- ple drones are launched and/or collected at the same node, their order becomes relevant. The proposed model takes into account the order of these operations as a scheduling problem, because ignoring it could lead to infeasible solu- tions in the reality due to the possible exceeding of drones endurance. We propose a set of novel formulations for the problem that can improve the size of the largest instances solved in the literature. We provide a comparison among the formulations, between the multiple drones solutions and the single drone ones, and among different variants of the model.

Modeling the Flying Sidekick Traveling Salesman Problem with Multiple Drones / Dell'Amico, Mauro; Montemanni, Roberto; Novellani, Stefano. - In: NETWORKS. - ISSN 1097-0037. - (2021), pp. 1-33. [10.1002/net.22022]

Modeling the Flying Sidekick Traveling Salesman Problem with Multiple Drones

Mauro Dell'Amico;Roberto Montemanni;Stefano Novellani
2021

Abstract

This paper considers a version of the flying sidekick travel- ing salesman problem in which parcels are delivered to cus- tomers by either a truck or a set of identical flying drones. The drones’ flights are limited by the battery endurance and each flight is made of a launch, a service to a customer, and a return: launch and return must happen when the truck is stationary. These operations require time and when multi- ple drones are launched and/or collected at the same node, their order becomes relevant. The proposed model takes into account the order of these operations as a scheduling problem, because ignoring it could lead to infeasible solu- tions in the reality due to the possible exceeding of drones endurance. We propose a set of novel formulations for the problem that can improve the size of the largest instances solved in the literature. We provide a comparison among the formulations, between the multiple drones solutions and the single drone ones, and among different variants of the model.
2021
1
33
Modeling the Flying Sidekick Traveling Salesman Problem with Multiple Drones / Dell'Amico, Mauro; Montemanni, Roberto; Novellani, Stefano. - In: NETWORKS. - ISSN 1097-0037. - (2021), pp. 1-33. [10.1002/net.22022]
Dell'Amico, Mauro; Montemanni, Roberto; Novellani, Stefano
File in questo prodotto:
File Dimensione Formato  
Networks - 2021 - Dell Amico - Modeling the flying sidekick traveling salesman problem with multiple drones.pdf

Accesso riservato

Tipologia: Versione pubblicata dall'editore
Dimensione 2.37 MB
Formato Adobe PDF
2.37 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/1227691
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 20
  • ???jsp.display-item.citation.isi??? 21
social impact