Abstract
A service provided by the liner shipping companies is the transport of containers by truck between the terminal and customers. These transports consist of import orders and export orders. Even though these transports concern containers and, therefore, each order is a full load, an import and an export order can be combined in one trip where the container is emptied at an import customer and taken to an export customer to be filled. Finding a set of optimal vehicle routes allowing these combinations is NP-hard. However, exploring the fact that the number of possible routes is small in the problem presented, we in this report show a model which can within seconds solve the problem to optimality. The model is tested on real-life data sets and additional constraints to the problem are considered.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Caris, A., Janssens, G.K.: A local search heuristic for the pre- and end-haulage of intermodal container terminals. Computers & Operations Research 36(10), 2763–2772 (2009)
Imai, A., Nishimura, E., Current, J.: A Lagrangian relaxation-based heuristic for the vehicle routing with full container load. European Journal of Operational Research 176, 87–105 (2007)
Mingozzi, A., Giorgi, S., Baldacci, R.: Exact method for the vehicle routing problem with backhauls. Transportation Science 33, 315–329 (1999)
Osman, I.H., Wassan, N.A.: A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls. Journal of Scheduling 5, 263–285 (2002)
Parragh, S.N., Dörner, K.F., Hartl, R.F.: A survey on pickup and delivery problems: Part I: transportation between customers and depot. Journal für Betriebswirtschaft 58(1), 21–51 (2008)
Parragh, S.N., Dörner, K.F., Hartl, R.F.: A survey on pickup and delivery problems: Part II: transportation between pickup and delivery locations. Journal für Betriebswirtschaft 58(2), 81–117 (2008)
Toth, P., Vigo, D.: An exact algorithm for the vehicle routing problem with backhauls. Transportation Science 31, 372–385 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reinhardt, L.B., Spoorendonk, S., Pisinger, D. (2012). Solving Vehicle Routing with Full Container Load and Time Windows. In: Hu, H., Shi, X., Stahlbock, R., Voß, S. (eds) Computational Logistics. ICCL 2012. Lecture Notes in Computer Science, vol 7555. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33587-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-33587-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33586-0
Online ISBN: 978-3-642-33587-7
eBook Packages: Computer ScienceComputer Science (R0)