A Random Restart Local Search Matheuristic for the Flying Sidekick Traveling Salesman Problem

Mauro Dell'amico, Roberto Montemanni, Stefano Novellani

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

Drones and unmanned vehicles in general are gaining more and more interest in the logistic sector, due to the potential economic advantages they can provide. In this paper we focus on optimizing the use of a drone in conjunction with a truck for urban deliveries, dealing with what is called the flying sidekick traveling salesman problem. There is a set of customers that it is possible to serve either by a truck or by a drone. The target is to minimize the total time required to complete deliveries to all the customers. In this paper we show how an effective and simple random restart local search heuristic algorithm can be derived from a known mixed integer programming model for the problem.

Original languageEnglish
Title of host publicationICIEA 2021 Europe - 2021 8th International Conference on Industrial Engineering and Applications (Europe)
PublisherAssociation for Computing Machinery
Pages205-209
Number of pages5
ISBN (Electronic)9781450389921
DOIs
StatePublished - 8 Jan 2021
Externally publishedYes
Event8th International Conference on Industrial Engineering and Applications, ICIEA 2021-Europe - Virtual, Online, Spain
Duration: 8 Jan 202111 Jan 2021

Publication series

NameACM International Conference Proceeding Series

Conference

Conference8th International Conference on Industrial Engineering and Applications, ICIEA 2021-Europe
Country/TerritorySpain
CityVirtual, Online
Period8/01/2111/01/21

Keywords

  • Drones
  • Matheuristic Algorithms
  • Optimization
  • Random Restart Local Search
  • Traveling Salesman Problem

Fingerprint

Dive into the research topics of 'A Random Restart Local Search Matheuristic for the Flying Sidekick Traveling Salesman Problem'. Together they form a unique fingerprint.

Cite this