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

Heuristic Strategies for a Multi-Allocation Problem in LTL Logistics

In: Operations Research Proceedings 2012

Author

Listed:
  • Uwe Clausen

    (Fraunhofer-Institut für Materialfluss und Logistik)

  • J. Fabian Meier

    (TU Dortmund, Institut für Transportlogistik)

Abstract

We consider a multi-allocation problem where the transport is handled by complete (integer-valued) trucks. It consists of two parts: A number of hubs are chosen out of a given set of depots; then the given transport relations are individually assigned to two hubs, one hub or direct transport. Having four-index variables for the routing and integer variables for the trucks, this MIP becomes difficult. Our heuristic approach gives much better results than a Cplex implementation and can be used to generate a restricted problem which can again be given to Cplex. The idea is as follows: Considering the whole network as collection of n trees sending goods to a chosen depot, we improve the total costs step by step: For that we always take the edge with most expensive transport and try to find a new route for it. In our paper we will explain the theoretic ideas, point out different possibilities and connect them to computational results.

Suggested Citation

  • Uwe Clausen & J. Fabian Meier, 2014. "Heuristic Strategies for a Multi-Allocation Problem in LTL Logistics," Operations Research Proceedings, in: Stefan Helber & Michael Breitner & Daniel Rösch & Cornelia Schön & Johann-Matthias Graf von der Schu (ed.), Operations Research Proceedings 2012, edition 127, pages 521-526, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-00795-3_78
    DOI: 10.1007/978-3-319-00795-3_78
    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-00795-3_78. 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.