Dynamic Programming Approaches for the Traveling Salesman Problem with Drone
The fast and cost-efficient home delivery of goods ordered online is logistically challenging. Many companies are looking for new ways to cross the last-mile to their customers. One technology-enabled opportunity that recently has received much attention is the use of a drone to support deliveries. A new delivery model in this area entails the use of a delivery truck that collaborates with a drone to make deliveries. Effectively combining a drone and a truck gives rise to a new planning problem that we call the Traveling Salesman Problem with Drone (TSP-D). In this talk, I will present solution approaches to the TSP-D based on dynamic programming and discuss various new numerical results.
Registration to Remy Spliet, email@example.com is required for availability of lunch.