The Multi-objective Dynamic Traveling Salesman Problem: Last Mile Delivery with Unmanned Aerial Vehicles Assistance
classification
🧮 math.OC
keywords
problemaerialdeliveryformulatedroutesalesmantravelingtruck
read the original abstract
In this paper, we present an approach to optimizing the last-mile delivery route of a truck using coordination with unmanned aerial vehicles (UAVs). First, a traveling salesman problem is formulated to determine the truck's route. Then, a scheduling problem is formulated to determined the routes for the UAVs. A genetic algorithm is used to solve these problems, and simulated results are presented.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.