THE TRAVELING SALESMAN PROBLEM WITH MULTI-VISIT DRONE

Authors

  • Quang Minh Ha ORLab, Faculty of Computer Science, Phenikaa University, Hanoi, Vietnam
  • Duy Manh Vu ORLab, Faculty of Computer Science, Phenikaa University, Hanoi, Vietnam
  • Xuan Thanh Le Institute of Mathematics, Vietnam Academy of Science and Technology, Hanoi, Vietnam
  • Minh Ha Hoang ORLab, Phenikaa University

DOI:

https://doi.org/10.15625/1813-9663/37/4/16180

Abstract

This paper deals with the Traveling Salesman Problem with Multi-Visit Drone (TSP-MVD) in which a truck works in collaboration with a drone that can serve up to q > 1 customers consecutively during each sortie. We propose a Mixed Integer Linear Programming (MILP) formulation and a metaheuristic based on Iterated Local Search to solve the problem. Benchmark instances collected from the literature of the special case with q = 1 are used to test the performance of our algorithms. The obtained results show that our MILP model can solve a number of instances to optimality. This is the first time optimal solutions for these instances are reported. Our ILS performs better other algorithms in terms of both solution quality and running time on several class of instances. The numerical results obtained by testing the methods on new randomly generated instances show again the effectiveness of the methods as well as the positive impact of using the multi-visit drone.

Downloads

Published

2021-10-12

Issue

Section

SPECIAL ISSUE DEDICATED TO THE MEMORY OF PROFESSOR PHAN DINH DIEU - PART B