Capacitated Vehicle Routing with Non-Uniform Speeds

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2011

View graph of relations

The capacitated vehicle routing problem (CVRP) [21] involves distributing (identical) items from a depot to a set of demand locations in the shortest possible time, using a single capacitated vehicle. We study a generalization of this problem to the setting of multiple vehicles having non-uniform speeds (that we call Heterogenous CVRP), and present a constant-factor approximation algorithm. The technical heart of our result lies in achieving a constant approximation to the following TSP variant (called Heterogenous TSP). Given a metric denoting distances between vertices, a depot r containing k vehicles having speeds {λ i } i = 1 k , the goal is to find a tour for each vehicle (starting and ending at r), so that every vertex is covered in some tour and the maximum completion time is minimized. This problem is precisely Heterogenous CVRP when vehicles are uncapacitated. The presence of non-uniform speeds introduces difficulties for employing standard tour-splitting techniques. In order to get a better understanding of this technique in our context, we appeal to ideas from the 2-approximation for minimum makespan scheduling in unrelated parallel machines of Lenstra et al. [19]. This motivates the introduction of a new approximate MST construction called Level-Prim, which is related to Light Approximate Shortest-path Trees [18]. The last component of our algorithm involves partitioning the Level-Prim tree and matching the resulting parts to vehicles. This decomposition is more subtle than usual since now we need to enforce correlation between the lengths of the parts and their distances to the depot.
Original languageEnglish
Title of host publicationLecture Notes in Computer Science : The 15th Conference on Integer Programming and Combinatorial Optimization
Place of PublicationBerlin
Publication date2011
ISBN (print)9783642208065
StatePublished - 2011
EventThe 15th Conference on Integer Programming and Combinatorial Optimization -


ConferenceThe 15th Conference on Integer Programming and Combinatorial Optimization
Period01/01/2011 → …
SeriesLecture Notes in Computer Science

Bibliographical note

This Conference Proceeding is brought to you for free and open access by Research Showcase @ CMU. It has been accepted for inclusion in Tepper
School of Business by an authorized administrator of Research Showcase @ CMU. For more information, please contact researchshowcase@

CitationsWeb of Science® Times Cited: No match on DOI
Download as:
Download as PDF
Select render style:
Download as HTML
Select render style:
Download as Word
Select render style:

ID: 5827496