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

An Incremental Online Heuristic For Evaluating The Feasibility Of The M-VRPTWAR

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

Author

Listed:
  • Christian Tummel
  • Christian Franzen
  • Eckart Hauck
  • Sabina Jeschke

    (RWTH Aachen University, IMA/ZLW)

Abstract

In this paper, a heuristic approach for evaluating the feasibility of an instance of the Multi-Depot Heterogeneous Fleet Vehicle Routing Problem with Time Windows and Assignment Restrictions (m-VRPTWAR) is presented. The heuristic approach tries to find a feasible solution by solving two sub-problems of the m-VRPTWAR: a 3-Dimensional Variable-sized Bin-Packing problem (3DVSBPP) and a Traveling Salesman Problem with Time Windows (TSPTW). In order to address the first problem, an online algorithm is presented. This algorithm expects shipments to be inserted in an online fashion and assigns them to freight routes by first-fit. Repacking already assigned shipments is permitted. The TSPTW part of the problem is addressed by a 2-phase heuristic that is based on algorithms presented in Savelsbergh (1985) and Ascheuer (1996). If there is no feasible solution for a new shipment, this shipment will be rejected. The heuristic approach is evaluated by solving several large-scale scenarios and monitoring the rejection rate of the algorithm.

Suggested Citation

  • Christian Tummel & Christian Franzen & Eckart Hauck & Sabina Jeschke, 2013. "An Incremental Online Heuristic For Evaluating The Feasibility Of The 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 753-765, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-33389-7_55
    DOI: 10.1007/978-3-642-33389-7_55
    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_55. 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.