Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.trb.2013.04.003
Title: Containership scheduling with transit-time-sensitive container shipment demand
Authors: Wang, S.
Meng, Q. 
Liu, Z.
Keywords: Branch-and-bound
Conic quadratic mixed-integer programming
Containership scheduling
Liner shipping
Transit-time-sensitive demand
Issue Date: Aug-2013
Citation: Wang, S., Meng, Q., Liu, Z. (2013-08). Containership scheduling with transit-time-sensitive container shipment demand. Transportation Research Part B: Methodological 54 : 68-83. ScholarBank@NUS Repository. https://doi.org/10.1016/j.trb.2013.04.003
Abstract: This paper examines the optimal containership schedule with transit-time-sensitive demand that is assumed to be a decreasing continuous function of transit time. A mixed-integer nonlinear non-convex optimization model is first formulated to maximize the total profit of a ship route. In view of the problem structure, a branch-and-bound based holistic solution method is developed. It is rigorously demonstrated that this solution method can obtain an ε-optimal solution in a finite number of iterations for general forms of transit-time-sensitive demand. Computational results based on a trans-Pacific liner ship route demonstrate the applicability and efficiency of the solution method. © 2013 Elsevier Ltd.
Source Title: Transportation Research Part B: Methodological
URI: http://scholarbank.nus.edu.sg/handle/10635/58993
ISSN: 01912615
DOI: 10.1016/j.trb.2013.04.003
Appears in Collections:Staff Publications

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

Google ScholarTM

Check

Altmetric


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