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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Acknowledgments
This research project is part of the DFG project “Lenkung des Güterflusses in durch Gateways gekoppelten Logistik-Service-Netzwerken mittels quadratischer Optimierung”.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Clausen, U., Meier, J.F. (2014). Heuristic Strategies for a Multi-Allocation Problem in LTL Logistics. In: Helber, S., et al. Operations Research Proceedings 2012. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-00795-3_78
Download citation
DOI: https://doi.org/10.1007/978-3-319-00795-3_78
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-00794-6
Online ISBN: 978-3-319-00795-3
eBook Packages: Business and EconomicsBusiness and Management (R0)