IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-55702-1_18.html
   My bibliography  Save this book chapter

Solving an On-Line Capacitated Vehicle Routing Problem with Structured Time Windows

In: Operations Research Proceedings 2016

Author

Listed:
  • Philipp Hungerländer

    (Alpen-Adria Universität Klagenfurt)

  • Kerstin Maier

    (Alpen-Adria Universität Klagenfurt)

  • Jörg Pöcher

    (Alpen-Adria Universität Klagenfurt)

  • Andrea Rendl

    (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 that can hold several customers and have a special structure (in our case equidistant and non-overlapping). In this work, we consider an on-line variant of the cVRPsTW that arises in the online shopping service of an international supermarket chain: customers choose a delivery time window for their order online, and the fleet’s tours are updated accordingly in real time. This leads to two challenges. First, the new customers need to be inserted at a suitable place in one of the existing tours. Second, the new customers have to be inserted in real time due to very high request rates. This is why we apply a computationally cheap, two-step approach consisting of an insertion step and an improvement step. In this context, we present a Mixed-Integer Linear Program (MILP) and a heuristic that employs the MILP. In an experimental evaluation, we demonstrate the efficiency of our approaches on a variety of benchmark sets.

Suggested Citation

  • Philipp Hungerländer & Kerstin Maier & Jörg Pöcher & Andrea Rendl & Christian Truden, 2018. "Solving an On-Line Capacitated Vehicle Routing Problem with Structured Time Windows," Operations Research Proceedings, in: Andreas Fink & Armin Fügenschuh & Martin Josef Geiger (ed.), Operations Research Proceedings 2016, pages 127-132, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-55702-1_18
    DOI: 10.1007/978-3-319-55702-1_18
    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.

    More about this item

    Statistics

    Access and download statistics

    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-319-55702-1_18. 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.