A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone

Stefan Poikonen,Bruce L. Golden,Edward A. Wasil

A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone

2019

Stefan Poikonen
Bruce L. Golden
Edward A. Wasil

The Traveling Salesman Problem with a Drone (TSP-D) is a hybrid truck and drone model of delivery, in which the drone rides on the truck and launches from the truck to deliver packages. Our approac...

Keywords:

Branch and bound
Discrete mathematics
Mathematical optimization
Drone
Travelling salesman problem
Mathematics
Vehicle routing problem
Truck
Integer

Correction
Source
Cite
Save
Machine Reading By IdeaReader

References

Citations