Abstract
Liner shipping companies can benefit significantly by improving ship scheduling and cost analysis in service route planning by systematic methods. This paper proposes a dynamic programming (DP) model for ship scheduling and identifies cost items relevant to the planning of a service route, which can help planners make better scheduling decisions under berth time-window constraints, as well as estimate more accurately voyage fixed costs and freight variable costs in liner service route planning. The proposed model pursues an optimal scheduling strategy including cruising speed and quay crane dispatching decisions, vis à vis tentative and rough schedule arrangements. Additionally, the model can be extended to cases of integrating one company’s – or strategic alliance – partners’ service networks, in order to gain more efficient hub-and-spoke operations, tighter transshipment and better level-of-service.
Similar content being viewed by others
References
Cho, SC and Perakis, AN . 1996: Optimal liner fleet routeing strategies. Maritime Policy & Management 23: 249–259.
Haralambides, HE and Veenstra, AW . 2000: Modelling performance in liner shipping. In: David AH and Keneth, JB (eds). Handbook of Transport Modelling. Pergamon, Elsevier Science, Oxford, UK, 2000) .
Jaramillo, DI and Perakis, AN . 1991: Fleet deployment optimisation for liner shipping Part 2: Implementation and results. Maritime Policy and Management 18: 235–262.
Lane, DE, Heaver, TD and Uyeno, D . 1987: Planning and scheduling for efficiency in liner shipping. Maritime Policy and Management 14: 109–125.
Lim SM . 1996: Round-the-world service: The rise of Evergreen and the fall of U.S. Lines. Maritime Policy and Management 23: 119–144.
Perakis, AN and Jaramillo, DI . 1991: Fleet deployment optimisation for liner shipping Part 1: Background, problem formulation and solution approaches. Maritime Policy and Management 18: 183–200.
Powell, BJ and Perakis, AN . 1997: Fleet deployment optimization for liner shipping: An integer programming model. Maritime Policy and Management 24: 183–192.
Rana, K and Vickson, RG . 1988: A model and solution algorithm for optimal routing of a time-chartered containership. Transportation Science 22: 83–95.
Rana, K and Vickson, RG . 1991: Routing containerships using Lagrangean relaxation and decomposition. Transportation Science 25: 201–214.
Ronen, D . 1983: Cargo ships routing and scheduling: Survey of models and problems. European Journal of Operational Research 12: 119–126.
Ronen, D . 1993: Ship scheduling: The last decade. European Journal of Operational Research 71: 325–333.
Xie, X, Wang, T and Chen, D . 2000: A dynamic model and algorithm for fleet planning. Maritime Policy and Management 27: 53–63.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ting, SC., Tzeng, GH. Ship Scheduling and Cost Analysis for Route Planning in Liner Shipping. Marit Econ Logist 5, 378–392 (2003). https://doi.org/10.1057/palgrave.mel.9100087
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.mel.9100087