Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/59107
Title: Liner ship route schedule design with sea contingency time and port time uncertainty
Authors: Wang, S.
Meng, Q. 
Keywords: Bunker consumption
Cutting-plane algorithm
Liner ship route schedule design
Mixed-integer non-linear stochastic programming model
Port time uncertainty
Sea contingency
Issue Date: Jun-2012
Citation: Wang, S., Meng, Q. (2012-06). Liner ship route schedule design with sea contingency time and port time uncertainty. Transportation Research Part B: Methodological 46 (5) : 615-633. ScholarBank@NUS Repository.
Abstract: This paper deals with a tactical-level liner ship route schedule design problem which aims to determine the arrival time of a ship at each portcall on a ship route and the sailing speed function on each voyage leg by taking into account time uncertainties at sea and at port. It first derives the optimality condition for the sailing speed function with sea contingency and subsequently demonstrates the convexity of the bunker consumption function. A mixed-integer non-linear stochastic programming model is developed for the proposed liner ship route schedule design problem by minimizing the ship cost and expected bunker cost while maintaining a required transit time service level. In view of the special structure of the model, an exact cutting-plane based solution algorithm is proposed. Numerical experiments on real data provided by a global liner shipping company demonstrate that the proposed algorithm can efficiently solve real-case problems. © 2012 Elsevier Ltd.
Source Title: Transportation Research Part B: Methodological
URI: http://scholarbank.nus.edu.sg/handle/10635/59107
ISSN: 01912615
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

83
checked on Feb 28, 2018

WEB OF SCIENCETM
Citations

70
checked on Apr 25, 2018

Page view(s)

44
checked on Jun 30, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.