IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-33389-7_56.html
   My bibliography  Save this book chapter

The Multi-Depot Heterogeneous Fleet Vehicle Routing Problem With Time Windows And Assignment Restrictions (M-VRPTWAR)

In: Automation, Communication and Cybernetics in Science and Engineering 2011/2012

Author

Listed:
  • Christian Tummel

    (RWTH Aachen University, IMA/ZLW)

  • Christian Franzen

    (RWTH Aachen University, IMA/ZLW)

  • Eckart Hauck

    (RWTH Aachen University, IMA/ZLW)

  • Sabina Jeschke

    (RWTH Aachen University, IMA/ZLW)

Abstract

In this paper, the multi-depot heterogeneous fleet vehicle routing problem with time windows and assignment restrictions (m-VRPTWAR) is introduced. The problem addresses the assignment of a set of shipments to a set of freight routes so that unused cargo volume of the vehicles is minimized. The assignment of each shipment is restricted to a subset of the freight routes. Furthermore, the shipment has to be delivered in a specific time window. Thus, it is necessary to determine an order of the shipments of each freight route that guarantees the observance of all time windows. Firstly, a formulation of an integer linear program (ILP) for solving the m-VRPTWAR is developed and the problem is proven to be NP-hard. Afterwards, the ILP is evaluated by solving several large-scale scenarios using the solvers CPLEX and Gurobi.

Suggested Citation

  • Christian Tummel & Christian Franzen & Eckart Hauck & Sabina Jeschke, 2013. "The Multi-Depot Heterogeneous Fleet Vehicle Routing Problem With Time Windows And Assignment Restrictions (M-VRPTWAR)," Springer Books, in: Sabina Jeschke & Ingrid Isenhardt & Frank Hees & Klaus Henning (ed.), Automation, Communication and Cybernetics in Science and Engineering 2011/2012, edition 127, pages 767-779, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-33389-7_56
    DOI: 10.1007/978-3-642-33389-7_56
    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
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:sprchp:978-3-642-33389-7_56. 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.