Abstract
One of the most important strategic decisions of a liner shipping company is the design of a set of cyclic routes, services, for container vessels to provide transport for goods from origins to destinations. This problem is called the liner shipping network design problem (LSNDP). The cyclic nature of the services as well as the possibility of transshipping cargoes between services makes the problem difficult to solve for large instances. Therefore, it is common to make assumptions regarding the structure of the services. We analyze the effect of different structures ranging from simple ones visiting a port once in a service, to butterfly services where one port can be visited twice in a service and a more general structure where every port in a service can be visited more than once. To perform these analyses, we have developed a new mathematical model for the LSNDP where there are no limitations on the number of visits to each port. The model is solved by a branch-and-price method, where we for the sake of computational time have reduced the number of visits per port on a service to a maximum of two. The computational study shows that complex service structures can create more cost-efficient networks and that the objective value can be improved by allowing general service structures even for small sized instances.
Similar content being viewed by others
References
Agarwal R, Ergun O (2008) Ship scheduling and network design for cargo routing in liner shipping. Transp Sci 42(2):175–196
Álvarez JF (2009) Joint routing and deployment of a fleet of container vessels. Marit Econ Logist 11(2):186–208
Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch-and-price: column generation for solving huge integer programs. Oper Res 46(3):316–329
Brouer BD, Alvarez JF, Plum CEM, Pisinger D, Sigurd MM (2014a) A base integer programming model and benchmark suite for liner-shipping network design. Transp Sci 48(2):281–312
Brouer BD, Desaulniers G, Pisinger D (2014b) A matheuristic for the liner shipping network design problem. Transp Res Part E Logist Transp Rev 72:42–59
Christiansen M, Fagerholt K, Nygreen B, Ronen D (2013) Ship routing and scheduling in the new millennium. Eur J Oper Res 228(3):467–483
Desaulniers G (2009) Branch-and-price-and-cut for the split delivery vehicle routing problem with time windows. Oper Res 33:3–14
Fagerholt K (2004) Designing optimal routes in a liner shipping problem. Marit Policy Manag 31(4):259–268
Gelareh S, Pisinger D (2011) Fleet deployment, network design and hub location of liner shipping companies. Transp Res Part E Logist Transp Rev 47(6):947–964
Jepsen MK, Brouer BD, Plum CEM, Pisinger D, Sigurd MM (2011) A path based model for a green liner shipping network design problem. In: Proceedings of the international multiconference of engineers and computer scientists, vol 2, pp 1379–1384
Karsten CV (2015) Competitive liner shipping network design. Ph.D. thesis, Technical University of Denmark
Kjeldsen KH (2011) Classification of ship routing and scheduling problems in liner shipping. Inf Syst Oper Res 49(2):139–152
Lawrence SA (1972) International sea transport:the years ahead. Lexington Books, Lanham
Meng Q, Wang S, Andersson H, Thun K (2013) Containership routing and scheduling in liner shipping: overview and future research directions. Transp Sci 48:265–280
Mulder J, Dekker R (2014) Methods for strategic liner shipping network design. Eur J Oper Res 235(2):367–377
Plum CEM, Pisinger D, Salazar-González JJ, Sigurd MM (2014a) Single liner shipping service design. Comput Oper Res 45:1–6
Plum CEM, Pisinger D, Sigurd MM (2014b) A service flow model for the liner shipping network design problem. Eur J Oper Res 235(2):378–386
Reinhardt LB, Pisinger D (2012) A branch and cut algorithm for the container shipping network design problem. Flex Serv Manuf J 24(3):349–374
Stålhane M, Andersson H, Christiansen M, Cordeau J, Desaulniers G (2012) A branch-price-and-cut method for a ship routing and scheduling problem with split loads. Comput Oper Res 39:3361–3375
Stopford M (2009) Maritime economics 3e. Routledge, London
Tran NK, Haasis HD (2015) Literature survey of network optimization in container liner shipping. Flex Serv Manuf J 27(2–3):139–179
UNCTAD (2015) Review of maritime transport 2015. Technical report
Wang S, Meng Q (2014) Liner shipping network design with deadlines. Comput Oper Res 41(1):140–149
Zheng J, Meng Q, Sun Z (2015) Liner hub-and-spoke shipping network design. Transp Res Part E Logist Transp Rev 75:32–48
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Thun, K., Andersson, H. & Christiansen, M. Analyzing complex service structures in liner shipping network design. Flex Serv Manuf J 29, 535–552 (2017). https://doi.org/10.1007/s10696-016-9262-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10696-016-9262-6