IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-030-18500-8_17.html
   My bibliography  Save this book chapter

Sweep Algorithms for the Capacitated Vehicle Routing Problem with Structured Time Windows

In: Operations Research Proceedings 2018

Author

Listed:
  • Christoph Hertrich

    (Technische Universität Kaiserslautern)

  • Philipp Hungerländer

    (Alpen-Adria-Universität Klagenfurt)

  • Christian Truden

    (Alpen-Adria-Universität Klagenfurt)

Abstract

The capacitated Vehicle Routing Problem with structured Time Windows (cVRPsTW) is concerned with finding optimal tours for vehicles with given capacity constraints to deliver goods to customers within assigned time windows. In our problem variant these time windows have a special structure, namely they are non-overlapping and each time window holds several customers. This is a reasonable assumption for Attended Home Delivery services. Sweep algorithms are known as simple, yet effective heuristics for the classical capacitated Vehicle Routing Problem. We propose variants of the sweep algorithm that are not only able to deal with time windows, but also exploit the additional structure of the time windows in a cVRPsTW. Afterwards we suggest local improvement heuristics to decrease our objective function even further. A carefully constructed benchmark set that resembles real-world data is used to prove the efficacy of our algorithms in a computational study.

Suggested Citation

  • Christoph Hertrich & Philipp Hungerländer & Christian Truden, 2019. "Sweep Algorithms for the Capacitated Vehicle Routing Problem with Structured Time Windows," Operations Research Proceedings, in: Bernard Fortz & Martine Labbé (ed.), Operations Research Proceedings 2018, pages 127-133, Springer.
    • Handle: RePEc:spr:oprchp:978-3-030-18500-8_17
    DOI: 10.1007/978-3-030-18500-8_17
    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.

    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-030-18500-8_17. 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.