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.


    Access

    Download


    Export, share and cite



    Title :

    Capacitated Vehicle Routing with Non-Uniform Speeds


    Contributors:

    Publication date :

    2011-01-01


    Remarks:

    Gørtz , I L , Molinaro , M , Nagarajan , V & Ravi , R 2011 , Capacitated Vehicle Routing with Non-Uniform Speeds . in Lecture Notes in Computer Science : The 15th Conference on Integer Programming and Combinatorial Optimization . vol. 6655/2011 , Springer , Berlin , Lecture Notes in Computer Science , pp. 235-247 , The 15th Conference on Integer Programming and Combinatorial Optimization , 01/01/2011 . https://doi.org/10.1007/978-3-642-20807-2_19



    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English


    Classification :

    DDC:    629




    Capacitated-Vehicle Routing Problem with Backhauls on Trees

    Kumar, Roshan / Unnikrishnan, Avinash / Waller, S. Travis | Transportation Research Record | 2011


    Improved Genetic Algorithm for Capacitated Vehicle Routing Problem

    Ren, C.Y. | British Library Conference Proceedings | 2013


    Improved Genetic Algorithm for Capacitated Vehicle Routing Problem

    Ren, C.Y. | British Library Conference Proceedings | 2013


    Reoptimization Heuristic for the Capacitated Vehicle Routing Problem

    Rodrigo Linfati / John Willmer Escobar | DOAJ | 2018

    Free access