Please use this identifier to cite or link to this item:
|Title:||Container routing in liner shipping||Authors:||Wang, S.
|Issue Date:||2013||Citation:||Wang, S., Meng, Q., Sun, Z. (2013). Container routing in liner shipping. Transportation Research Part E: Logistics and Transportation Review 49 (1) : 1-7. ScholarBank@NUS Repository. https://doi.org/10.1016/j.tre.2012.06.009||Abstract:||Container paths play an important role in liner shipping services with container transshipment operations. In the literature, link-based multi-commodity flow formulations are widely used for container routing. However, they have two deficiencies: the level of service in terms of the origin-to-destination transit time is not incorporated and maritime cabotage may be violated. To overcome these deficiencies, we first present an operational network representation of a liner shipping network. Based on the network, an integer linear programming model is formulated to obtain container paths with minimum cost. Finally, we add constraints to the integer linear programming model, excluding those paths already obtained, so as to find all the container paths. © 2012 Elsevier Ltd.||Source Title:||Transportation Research Part E: Logistics and Transportation Review||URI:||http://scholarbank.nus.edu.sg/handle/10635/58992||ISSN:||13665545||DOI:||10.1016/j.tre.2012.06.009|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 17, 2019
WEB OF SCIENCETM
checked on Oct 10, 2019
checked on Oct 13, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.