Đang chuẩn bị liên kết để tải về tài liệu:
The traveling salesman problem with multi - visit drone
Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
This paper deals with the Traveling Salesman Problem with Multi-Visit Drone (TSPMVD) 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 (ILS) 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. |