On the min-cost traveling salesman problem with drone

Ha, Q. M., Deville, Y., Pham, Q. D., & Hà, M. H. · 2018

full-text

Against the makespan-style objective in Murray and Chu, this paper sets a TSP-D that minimizes transport cost and the cost of waiting. It is difficult to skip when a citation is needed for a cost-based truck-drone tour. The card is bibliographic and is not a certificate that the full paper was re-read.

Waiting while the truck and the aircraft meet is written into the objective as part of operating cost. The authors adapt a local-search procedure from Murray and Chu and also propose a GRASP. In their computational tests they report that GRASP produced better solution quality within an acceptable running time.

The cost coefficients are model parameters, not a carrier’s invoice. Drop the assumption that waiting is priced, and the route that looks best can change.