Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.trb.2013.01.001
Title: Reversing port rotation directions in a container liner shipping network
Authors: Wang, S.
Meng, Q. 
Keywords: Liner shipping network design
Mixed-integer linear programming
Multi-commodity network flow
Port rotation directions
Issue Date: Apr-2013
Source: Wang, S., Meng, Q. (2013-04). Reversing port rotation directions in a container liner shipping network. Transportation Research Part B: Methodological 50 : 61-73. ScholarBank@NUS Repository. https://doi.org/10.1016/j.trb.2013.01.001
Abstract: Reversing port rotation directions of ship routes is a practical alteration of container liner shipping networks. The port rotation directions of ship routes not only affect the transit time of containers, as has been recognized by the literature, but also the shipping capacity and transshipment cost. This paper aims to obtain the optimal port rotation directions that minimize the generalized network-wide cost including transshipment cost, slot-purchasing cost and inventory cost. A mixed-integer linear programming model is proposed for the optimal port rotation direction optimization problem and it nests a minimum cost multi-commodity network flow model. The proposed model is applied to a liner shipping network operated by a global liner shipping company. Results demonstrate that real-case instances could be efficiently solved and significant cost reductions are gained by optimization of port rotation directions. © 2013 Elsevier Ltd.
Source Title: Transportation Research Part B: Methodological
URI: http://scholarbank.nus.edu.sg/handle/10635/59190
ISSN: 01912615
DOI: 10.1016/j.trb.2013.01.001
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

20
checked on Dec 14, 2017

WEB OF SCIENCETM
Citations

18
checked on Nov 19, 2017

Page view(s)

43
checked on Dec 17, 2017

Google ScholarTM

Check

Altmetric


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