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

Route Minimization Heuristic for the Vehicle Routing Problem with Multiple Pauses

In: Operations Research Proceedings 2015

Author

Listed:
  • Alexey Khmelev

    (Novosibirsk State University)

Abstract

In this work we introduce the vehicle routing problem with multiple pauses, where the fleet is heterogeneous in terms of capacity and drivers availability. Each shift has a time interval when the driver is available and a set of breaks that needs to be scheduled in the route during this shift. The objective is to minimize the number of vehicles and the travel distance. To tackle large instances, we develop a three-phase local search algorithm taking multiple breaks into account by introducing an ejection pool and randomized variable neighborhood descent as local improvement procedure. For effective break scheduling, we develop a special dynamic programming routine. Computational experiments are done on the data set provided by a delivery company situated in Novosibirsk, Russia. The instances contain 1000 customers and 30 vehicles. Experiments show effectiveness of our algorithm. It substantially reduces the fleet and travel distance.

Suggested Citation

  • Alexey Khmelev, 2017. "Route Minimization Heuristic for the Vehicle Routing Problem with Multiple Pauses," Operations Research Proceedings, in: Karl Franz Dörner & Ivana Ljubic & Georg Pflug & Gernot Tragler (ed.), Operations Research Proceedings 2015, pages 265-271, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-42902-1_36
    DOI: 10.1007/978-3-319-42902-1_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.

    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-42902-1_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.