Abstract
This monograph investigates a central problem of the liner shipping industry, the liner shipping fleet repositioning problem (LSFRP), and solves it using a plethora of techniques both ignoring and taking into account container flows. We provide the first problem description and mathematical models of the LSFRP in the literature.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Andersen, M.W.: Service network design and management in liner container shipping applications. PhD thesis, Department of Transport, Technical University of Denmark (2010)
Kelareva, E., Tierney, K., Kilby, P.: CP methods for scheduling and routing with time-dependent task costs. In: Gomes, C., Sellmann, M. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Volume 7874 of Lecture Notes in Computer Science, pp. 111–127. Springer, Berlin/Heidelberg (2013)
United Nations Conference on Trade and Development (UNCTAD): Review of Maritime Transport. United Nations, New York/Geneva (2013)
United Nations Economic and Social Commission for Asia and the Pacific (UNESCAP): Regional Shipping and Port Development: Container Traffic Forecast 2007 Update (2007)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Tierney, K. (2015). Conclusion. In: Optimizing Liner Shipping Fleet Repositioning Plans. Operations Research/Computer Science Interfaces Series, vol 57. Springer, Cham. https://doi.org/10.1007/978-3-319-17665-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-17665-9_7
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-17664-2
Online ISBN: 978-3-319-17665-9
eBook Packages: Business and EconomicsBusiness and Management (R0)