IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-642-20009-0_36.html
   My bibliography  Save this book chapter

Graph Sparsification for the Vehicle Routing Problem with Time Windows

In: Operations Research Proceedings 2010

Author

Listed:
  • Christian Doppstadt

    (Goethe University Frankfurt)

  • Michael Schneider

    (University of Kaiserslautern)

  • Andreas Stenger

    (Goethe University Frankfurt)

  • Bastian Sand

    (University of Kaiserslautern)

  • Daniele Vigo

    (University of Bologna)

  • Michael Schwind

    (Goethe University Frankfurt)

Abstract

The Vehicle Routing Problem with Time Windows (VRPTW) is one of the most important and widely studied NP-hard combinatorial optimization problems in the operations research literature. The problem calls for the determination of a minimum-cost set of routes for a fleet of identical vehicles with limited capacities to serve a set of customers that have a given demand and an associated time window in which they can be visited. Due to its computational complexity, VRPTW can only be solved by exact methods for instances of moderate size [2]. However, a large number of successful metaheuristic solution methods have been proposed, which are able to produce high-quality solutions for reasonably-sized instances in limited time. For an extensive review, the reader is referred to [5, 3].

Suggested Citation

  • Christian Doppstadt & Michael Schneider & Andreas Stenger & Bastian Sand & Daniele Vigo & Michael Schwind, 2011. "Graph Sparsification for the Vehicle Routing Problem with Time Windows," Operations Research Proceedings, in: Bo Hu & Karl Morasch & Stefan Pickl & Markus Siegle (ed.), Operations Research Proceedings 2010, pages 227-232, Springer.
    • Handle: RePEc:spr:oprchp:978-3-642-20009-0_36
    DOI: 10.1007/978-3-642-20009-0_36
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Schneider, Michael & Schwahn, Fabian & Vigo, Daniele, 2017. "Designing granular solution methods for routing problems with time windows," European Journal of Operational Research, Elsevier, vol. 263(2), pages 493-509.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-642-20009-0_36. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.