Journal article
Locating Depots for Capacitated Vehicle Routing
We study a location-routing problem in the context of capacitated vehicle routing. The input to the k-location capacitated vehicle routing problem (k-LocVRP) consists of a set of demand locations in a metric space and a fleet of k identical vehicles, each of capacity Q. The objective is to locate k depots, one for each vehicle, and compute routes for the vehicles so that all demands are satisfied and the total cost is minimized.
Our main result is a constant-factor approximation algorithm for k-LocVRP. In obtaining this result, we introduce a common generalization of the k-median and minimum spanning tree problems (called k median forest), which might be of independent interest. We give a local-search based (3+ε)-approximation algorithm for k median forest, which leads to a (12+ε)-approximation algorithm for k-LocVRP, for any constant ε>0.
Language: | English |
---|---|
Year: | 2016 |
Pages: | 94-103 |
ISSN: | 10970037 and 00283045 |
Types: | Journal article |
DOI: | 10.1002/net.21683 |
ORCIDs: | Gørtz, Inge Li |