Robust schedule design for liner shipping services

► Robust schedule design considering port time uncertainty. ► Schedule recovery by fast steaming. ► A holistic algorithm that obtains near-optimal solutions. This paper examines the design of liner ship route schedules that can hedge against the uncertainties in port operations, which include the un...

Full description

Saved in:
Bibliographic Details
Published in:Transportation research. Part E, Logistics and transportation review Vol. 48; no. 6; pp. 1093 - 1106
Main Authors: Wang, Shuaian, Meng, Qiang
Format: Journal Article
Language:English
Published: Exeter Elsevier India Pvt Ltd 01.11.2012
Elsevier
Elsevier Sequoia S.A
Subjects:
Containerschifffahrt
Design optimization
Hafenanlagen
Liner shipping
Linienschifffahrt
Nichtlineare Optimierung
Port time
Ports
Sample average approximation
Schedule robustness
Scheduling
Scheduling algorithms
Scheduling-Verfahren
Shipping industry
Stochastic models
Studies
Traffic congestion
Uncertainty
Liner shipping
Scheduling
Port time
Schedule robustness
Sample average approximation
ISSN:1366-5545, 1878-5794
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:► Robust schedule design considering port time uncertainty. ► Schedule recovery by fast steaming. ► A holistic algorithm that obtains near-optimal solutions. This paper examines the design of liner ship route schedules that can hedge against the uncertainties in port operations, which include the uncertain wait time due to port congestion and uncertain container handling time. The designed schedule is robust in that uncertainties in port operations and schedule recovery by fast steaming are captured endogenously. This problem is formulated as a mixed-integer nonlinear stochastic programming model. A solution algorithm which incorporates a sample average approximation method, linearization techniques, and a decomposition scheme, is proposed. Extensive numerical experiments demonstrate that the algorithm obtains near-optimal solutions with the stochastic optimality gap less 1.5% within reasonable time.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1366-5545
1878-5794
DOI:10.1016/j.tre.2012.04.007