Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.cor.2013.08.014
Title: Liner shipping network design with deadlines
Authors: Wang, S.
Meng, Q. 
Keywords: Column generation
Liner shipping network design
NP-hard
Transit time
Issue Date: 2014
Source: Wang, S., Meng, Q. (2014). Liner shipping network design with deadlines. Computers and Operations Research 41 (1) : 140-149. ScholarBank@NUS Repository. https://doi.org/10.1016/j.cor.2013.08.014
Abstract: It is crucial for a liner shipping company to design its container shipping network. Given a set of port-to-port container shipment demands with delivery deadlines, the liner shipping company aims to design itineraries of portcalls, deploy ships on these itineraries and determine how to transport containers with the deployed ships in order to maximize its total profit. In this paper we first demonstrate NP-hardness of this problem and subsequently formulate it as a mixed-integer non-linear non-convex programming model. A column generation based heuristic method is proposed for solving this problem. Numerical experiments for container shipping on the Asia-Europe trade lane show that the proposed solution algorithm is efficient to find good quality solutions. © 2013 Elsevier Ltd.
Source Title: Computers and Operations Research
URI: http://scholarbank.nus.edu.sg/handle/10635/59108
ISSN: 03050548
DOI: 10.1016/j.cor.2013.08.014
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

26
checked on Dec 14, 2017

WEB OF SCIENCETM
Citations

20
checked on Nov 21, 2017

Page view(s)

29
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


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