### Abstract

Original language | English |
---|---|

Journal | Networks |

Volume | 68 |

Issue number | 2 |

Pages (from-to) | 94-103 |

ISSN | 0028-3045 |

DOIs | |

Publication status | Published - 2016 |

### Keywords

- Vehicle routing
- Facility location
- Approximation algorithms

### Cite this

*Networks*,

*68*(2), 94-103. https://doi.org/10.1002/net.21683

}

*Networks*, vol. 68, no. 2, pp. 94-103. https://doi.org/10.1002/net.21683

**Locating Depots for Capacitated Vehicle Routing.** / Gørtz, Inge Li; Nagarajan, Viswanath .

Research output: Contribution to journal › Journal article › Research › peer-review

TY - JOUR

T1 - Locating Depots for Capacitated Vehicle Routing

AU - Gørtz, Inge Li

AU - Nagarajan, Viswanath

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

KW - Vehicle routing

KW - Facility location

KW - Approximation algorithms

U2 - 10.1002/net.21683

DO - 10.1002/net.21683

M3 - Journal article

VL - 68

SP - 94

EP - 103

JO - Networks

JF - Networks

SN - 0028-3045

IS - 2

ER -