Advanced Search
MyIDEAS: Login to save this paper or follow this series

A vehicle routing model with split delivery and stop nodes

Contents:

Author Info

  • Leonardo Berbotto

    ()

  • Sergio García

    ()

  • Francisco J. Nogales

    ()

Registered author(s):

    Abstract

    In this work, a new variant of the Capacitated Vehicle Routing Problem (CVRP) is presented where the vehicles cannot perform any route leg longer than a given length L (although the routes can be longer). Thus, once a route leg length is close to L, the vehicle must go to a stop node to end the leg or return to the depot. We introduce this condition in a variation of the CVRP, the Split Delivery Vehicle Routing Problem, where multiple visits to a customer by different vehicles are allowed. We present two formulations for this problem which we call Split Delivery Vehicle Routing Problem with Stop Nodes: a vehicle flow formulation and a commodity flow formulation. Because of the complexity of this problem, a heuristic approach is developed. We compare its performance with and without the stop nodes

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://e-archivo.uc3m.es/bitstream/10016/11026/1/ws110906.pdf
    Download Restriction: no

    Bibliographic Info

    Paper provided by Universidad Carlos III, Departamento de Estadística y Econometría in its series Statistics and Econometrics Working Papers with number ws110906.

    as in new window
    Length:
    Date of creation: Apr 2011
    Date of revision:
    Handle: RePEc:cte:wsrepe:ws110906

    Contact details of provider:
    Postal: C/ Madrid, 126 - 28903 GETAFE (MADRID)
    Phone: 6249847
    Fax: 6249849
    Web page: http://www.uc3m.es/uc3m/dpto/DEE/departamento.html
    More information through EDIRC

    Related research

    Keywords: Split delivery vehicle routing problem; Stop node; Granular neighborhood; Tabu search;

    This paper has been announced in the following NEP Reports:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:cte:wsrepe:ws110906. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.