Abstract
This paper considers a classical ship scheduling problem in which the routing and scheduling of a heterogeneous fleet of ships with time windows for pick-ups and deliveries at multiple ports is required. Assuming fixed ship speeds, the problem of maximising profit is addressed. A variable neighborhood search metaheuristic is proposed for this problem. A computational evaluation compares this variable neighborhood search procedure with multi-start local search and a previous tabu search approach. Computational results show that variable neighborhood search provides both the best-quality solutions and the fastest computation time compared to multi-start and tabu search.
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
Preview
Unable to display preview. Download preview PDF.
References
Brønmo, G., Christiansen, M., Fagerholt, K., Nygreen, B.: A multi-start local search heuristic for ship scheduling - a computational study. Computers & Operations Research 34(3), 900–917 (2007)
Brønmo, G., Christiansen, M., Nygreen, B.: Ship routing and scheduling with flexible cargo sizes. Journal of the Operational Research Society 58(9), 1167–1177 (2007)
Brønmo, G., Nygreen, B., Lysgaard, J.: Column generation approaches to ship scheduling with flexible cargo sizes. European Journal of Operational Research 200(1), 139–150 (2010)
Christiansen, M., Fagerholt, K., Nygreen, B., Ronen, D.: Maritime transportation. In: Barnhart, C., Laporte, G. (eds.) Transportation, Handbooks in Operations Research and Management Science, vol. 14, pp. 189–284. Elsevier, Amsterdam (2007)
Christiansen, M., Fagerholt, K., Ronen, D.: Ship routing and scheduling: Status and perspectives. Transportation Science 38(1), 1–18 (2004)
Fagerholt, K.: A computer-based decision support system for vessel fleet scheduling – experience and future research. Decision Support Systems 37, 35–47 (2004)
Glover, F., Kochenberger, G.: Handbook of Metaheuristics. Kluwer, Dordrecht (2003)
Hansen, P., Mladenovic, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research 130(3), 449–467 (2001)
Hansen, P., Mladenovic, N.: Variable neighborhood search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 145–184. Kluwer, Boston (2003)
Kim, S., Lee, K.: An optimization-based decision support system for ship scheduling. Computers & Industrial Engineering 33(3-4), 689–692 (1997)
Korsvik, J.E., Fagerholt, K., Laporte, G.: A tabu search heuristic for ship routing and scheduling. Journal of the Operational Research Society 61(4), 594–603 (2010)
Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. In: IEEE International Conference on Tools with Artificial Intelligence, pp. 160–167 (2001)
Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers & Operations Research 24(11), 1097–1100 (1997)
Ronen, D.: Cargo ships routing and scheduling: Survey of models and problems. European Journal of Operational Research 12(2), 119–126 (1983)
Ronen, D.: Ship scheduling: The last decade. European Journal of Operational Research 71(3), 325–333 (1993)
UNCTAD secretariat: Review of maritime transport. United Nations Conference on trade and development, United Nations, New York, Geneva (2008), http://www.unctad.org/en/docs/rmt2008_en.pdf
UNCTAD secretariat: Review of maritime transport. United Nations conference on trade and development, United Nations, New York, Geneva (2010), http://www.unctad.org/en/docs/rmt2010_en.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Malliappi, F., Bennell, J.A., Potts, C.N. (2011). A Variable Neighborhood Search Heuristic for Tramp Ship Scheduling. In: Böse, J.W., Hu, H., Jahn, C., Shi, X., Stahlbock, R., Voß, S. (eds) Computational Logistics. ICCL 2011. Lecture Notes in Computer Science, vol 6971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24264-9_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-24264-9_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24263-2
Online ISBN: 978-3-642-24264-9
eBook Packages: Computer ScienceComputer Science (R0)