Abstract
We present a mathematical model for the liner shipping network design problem with transit time restrictions on the cargo flow. We extend an existing matheuristic for the liner shipping network design problem to consider transit time restrictions. The matheuristic is an improvement heuristic, where an integer program is solved iteratively as a move operator in a large-scale neighborhood search. To assess the effects of insertions/removals of port calls, flow and revenue changes are estimated for relevant commodities along with an estimation of the change in the vessel cost. Computational results on the benchmark suite LINER-LIB are reported, showing profitable networks for most instances. We provide insights on causes for rejecting demand and the average speed per vessel class in the solutions obtained.
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.
Similar content being viewed by others
References
Agarwal, R., Ergun, O.: Ship scheduling and network design for cargo routing in liner shipping. Transportation Science 42(2), 175–196 (2008)
Alvarez, J.F.: Mathematical expressions for level of service optimization in liner shipping. Journal of the Operational Research Society 63(6), 709–714 (2012)
Archetti, C., Speranza, M.G.: A survey on matheuristics for routing problems. EURO Journal on Computational Optimization 2, 223–246 (2014)
Brouer, B., Alvarez, J., Plum, C., Pisinger, D., Sigurd, M.: A base integer programming model and benchmark suite for liner shipping network design. Transportation Science 48(2), 281–312 (2014a)
Brouer, B., Desaulniers, G., Pisinger, D.: A matheuristic for the liner shipping network design problem. Transportation Research Part E: Logistics and Transportation Review 72, 42–59 (2014b)
Christiansen, M., Fagerholt, K., Nygreen, B., Ronen, D.: Ship routing and scheduling in the new millennium. European Journal of Operational Research 228(3), 467–483 (2013)
Gelareh, S., Nickel, S., Pisinger, D.: Liner shipping hub network design in a competitive environment. Transportation Research Part E: Logistics and Transportation Review 46(6), 991–1004 (2010)
Karsten, C.V., Pisinger, D., Ropke, S., Brouer, B.D.: The time constrained multi-commodity network flow problem and its application to liner shipping network design. Transportation Research Part E: Logistics and Transportation Review 76, 122–138 (2015)
Liu, Z., Meng, Q., Wang, S., Sun, Z.: Global intermodal liner shipping network design. Transportation Research Part E: Logistics and Transportation Review 61, 28–39 (2014)
Meng, Q., Wang, S., Andersson, H., Thun, K.: Containership routing and scheduling in liner shipping: Overview and future research directions. Transportation Science 48(2), 265–280 (2014)
Mulder, J., Dekker, R.: Methods for strategic liner shipping network design. European Journal of Operational Research 235(2), 367–377 (2014)
Plum, C., Pisinger, D., Sigurd, M.M.: A service flow model for the liner shipping network design problem. European Journal of Operational Research 235(2), 378–386 (2014)
Reinhardt, L.B., Pisinger, D.: A branch and cut algorithm for the container shipping network design problem. Flexible Services and Manufacturing Journal 24(3), 349–374 (2012)
Wang, S., Meng, Q.: Liner shipping network design with deadlines. Computers and Operations Research 41(1), 140–149 (2014)
Wang, S., Meng, Q., Sun, Z.: Container routing in liner shipping. Transportation Research Part E: Logistics and Transportation Review 49(1), 1–7 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Brouer, B.D., Desaulniers, G., Karsten, C.V., Pisinger, D. (2015). A Matheuristic for the Liner Shipping Network Design Problem with Transit Time Restrictions. In: Corman, F., Voß, S., Negenborn, R. (eds) Computational Logistics. ICCL 2015. Lecture Notes in Computer Science(), vol 9335. Springer, Cham. https://doi.org/10.1007/978-3-319-24264-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-24264-4_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24263-7
Online ISBN: 978-3-319-24264-4
eBook Packages: Computer ScienceComputer Science (R0)