Article ID Journal Published Year Pages File Type
1143300 Operations Research Letters 2007 5 Pages PDF
Abstract
The tour partitioning heuristic for the vehicle routing problem assumes an unlimited supply of vehicles. If the number of vehicles is fixed, this heuristic may produce infeasible solutions. We modify the heuristic to guarantee feasibility in this situation and we analyze the worst-case performance of the modified heuristic.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem
Authors
, ,