Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/67444
Title: Robust liner shipping schedule design in service networks with transshipment cut and run decisions
Authors: Mi, Yue
Keywords: DRNTU::Engineering::Industrial engineering::Operations research
Issue Date: 2016
Abstract: The liner shipping industry has been suffering from poor schedule reliability due to delays in ports and the prevalence of transshipment. Aiming to solve the real-life problem of schedule reliability, this report investigates the design of schedule for liner shipping service networks, addressing the uncertainties in port time due to port congestion and delays in handling, while minimizing the impacts of misconnections of transshipment cargo and late-delivery. In addition to the usual published time, the schedule contains a target arrival time and a newly-introduced latest departure time for each port of call in each service. The target arrival time hedges against the possible waiting time at ports while the latest departure time enables a vessel to “cut and run” without waiting too long for delayed transshipment cargo. The schedule will serve as easy-to-use guidelines and assist quick and quality management decisions without the use of highly compute-intensive operational decision tools. The robustness of the schedule allows vessels to recover a delayed schedule in worst cases. A mixed-integer nonlinear stochastic programming model is formulated. Solution methodology is discussed in general, which includes linearization, approximation, and discretization.
URI: http://hdl.handle.net/10356/67444
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:CEE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
Mi Yue FYP Report.pdf
  Restricted Access
Main article1.64 MBAdobe PDFView/Open

Page view(s)

131
Updated on Jun 23, 2021

Download(s)

8
Updated on Jun 23, 2021

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.