A novel MILP relaxation for the load-dependent TSP yields optimal routes for most instances with up to 50 targets in under one minute, with optimality gaps below 13% for the rest.
A branch-and-price-and-cut algorithm for the vehicle routing problem with load-dependent drones,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An Exact Algorithm for Load-Dependent Traveling Salesman Problem for Unmanned Aerial Vehicle Package Delivery
A novel MILP relaxation for the load-dependent TSP yields optimal routes for most instances with up to 50 targets in under one minute, with optimality gaps below 13% for the rest.