2018/04/11 by Júlia Cária de Freitas, Freitas, Julia C., Puca Huachi Vaz Penna +1 · 1 citation
Computer Science · Engineering · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC) #Robotic Path Planning Algorithms #Transportation and Mobility Innovations #UAV Applications and Optimization #Vehicle Routing Optimization Methods
paper · pdf · doi:10.48550/arxiv.1804.03954
openalex publication_date 2018/04/11 · openalex created_date 2022/10/02 · openalex updated_date 2026/07/28
The efficiency and dynamism of Unmanned Aerial Vehicles (UAVs), or drones,\npresent substantial application opportunities in several industries in the last\nyears. Notably, the logistic companies gave close attention to these vehicles\nenvisioning reduce delivery time and operational cost. A variant of the\nTraveling Salesman Problem (TSP) called Flying Sidekick Traveling Salesman\nProblem (FSTSP) was introduced involving drone-assisted parcel delivery. The\ndrone is launched from the truck, proceeds to deliver parcels to a customer and\nthen is recovered by the truck in a third location. While the drone travels\nthrough a trip, the truck delivers parcels to other customers as long as the\ndrone has enough battery to hover waiting for the truck. This work proposes a\nhybrid heuristic that the initial solution is created from the optimal TSP\nsolution reached by a TSP solver. Next, an implementation of the General\nVariable Neighborhood Search is used to obtain the delivery routes of truck and\ndrone. Computational experiments show the potential of the algorithm to improve\nthe delivery time significantly. Furthermore, we provide a new set of instances\nbased on well-known TSPLIB instances.\n