IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-24907-5_21.html
   My bibliography  Save this book chapter

Vehicle Routing with Heterogeneous Time Windows

In: Operations Research Proceedings 2022

Author

Listed:
  • Petra Mutzel

    (Universität Bonn)

  • Tim Niemann

    (Technische Universität Braunschweig)

  • Lukas Schürmann

    (Universität Bonn)

  • Sebastian Stiller

    (Technische Universität Braunschweig)

  • Andreas M. Tillmann

    (Technische Universität Braunschweig)

Abstract

We consider a novel variant of the heterogeneous vehicle routing problem (VRP) in which each customer has different availability time windows for every vehicle. In particular, this covers our motivating application of planning daily delivery tours for a single vehicle, where customers can be available at different times each day. The existing literature on heterogeneous VRPs typically distinguishes properties of the vehicle fleet such as costs or capacities, but apparently, windows of customers have only been regarded in a homogeneous fashion thus far. To solve the problem, we employ a branch-and-price framework based on a set partitioning formulation together with a parallelizable labeling algorithm. The heterogeneous time window structure yields notable computational gains by allowing to decompose the pricing problem as well as to utilize a customer-vehicle assignment branching rule. We show that this branching rule leads to more balanced search trees than the usual arc flow branching, and demonstrate its efficiency in numerical experiments.

Suggested Citation

  • Petra Mutzel & Tim Niemann & Lukas Schürmann & Sebastian Stiller & Andreas M. Tillmann, 2023. "Vehicle Routing with Heterogeneous Time Windows," Lecture Notes in Operations Research, in: Oliver Grothe & Stefan Nickel & Steffen Rebennack & Oliver Stein (ed.), Operations Research Proceedings 2022, chapter 0, pages 171-177, Springer.
    • Handle: RePEc:spr:lnopch:978-3-031-24907-5_21
    DOI: 10.1007/978-3-031-24907-5_21
    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:lnopch:978-3-031-24907-5_21. 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.