Can I read On the min-cost Traveling Salesman Problem with Drone on EtoBox?

On the min-cost Traveling Salesman Problem with Drone by Quang Minh Ha; Yves Deville; Quang Dung Pham; Minh Hoàng Hà is a scholarly article available to read on EtoBox.

What is On the min-cost Traveling Salesman Problem with Drone about?

Over the past few years, unmanned aerial vehicles (UAV), also known as drones, have been adopted as part of a new logistic method in the commercial sector called "last-mile delivery". In this novel approach, they are deployed alongside trucks to deliver goods to customers to improve the quality of service and reduce the transportation cost. This approach gives rise to a new variant of the traveling salesman problem (TSP), called TSP with drone (TSP-D). A variant of this problem that aims to minimize the time at which truck and drone finish the service (or, in other words, to maximize the quality of service) was studied in the work of . In contrast, this paper considers a new variant of TSP-D in which the objective is to minimize operational costs including total transportation cost and one created by waste time a vehicle has to wait for the other. The problem is first formulated mathematically. Then, two algorithms are proposed for the solution. The first algorithm (TSP-LS) was adapted from the approach proposed by , in which an optimal TSP solution is converted to a feasible TSP-D solution by local searches. The second algorithm, a Greedy Randomized Adaptive Search Procedure (GRAS

Author

Quang Minh Ha; Yves Deville; Quang Dung Pham; Minh Hoàng Hà

Publisher

Elsevier BV

Published

2018

Language

EN