Heuristic Strategies for a Multi-Allocation Problem in LTL Logistics
Uwe Clausen () and
J. Fabian Meier ()
Additional contact information
Uwe Clausen: Fraunhofer-Institut für Materialfluss und Logistik
J. Fabian Meier: TU Dortmund, Institut für Transportlogistik
A chapter in Operations Research Proceedings 2012, 2014, pp 521-526 from Springer
Abstract:
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.
Keywords: Capacity Utilisation; Transport Volume; Restricted Problem; Shipping Volume; Turnover Cost (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-00795-3_78
Ordering information: This item can be ordered from
http://www.springer.com/9783319007953
DOI: 10.1007/978-3-319-00795-3_78
Access Statistics for this chapter
More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().