Please use this identifier to cite or link to this item: https://doi.org/10.1080/03088839.2010.486635
Title: A chance constrained programming model for short-term liner ship fleet planning problems
Authors: Meng, Q. 
Wang, T.
Issue Date: 2010
Source: Meng, Q., Wang, T. (2010). A chance constrained programming model for short-term liner ship fleet planning problems. Maritime Policy and Management 37 (4) : 329-346. ScholarBank@NUS Repository. https://doi.org/10.1080/03088839.2010.486635
Abstract: This article deals with a short-term Liner Ship Fleet Planning (LSFP) problem with cargo shipment demand uncertainty for a single liner container shipping company. The cargo shipment demand uncertainty enables us to propose a chance constraint for each liner service route, which guarantees that the liner service route can satisfy the customers' demand at least with a predetermined probability. Assuming that cargo shipment demand between any two ports on each liner service route is normally distributed, this article develops an integer linear programming model with chance constraints for the short-term LSFP problem. The proposed integer linear programming model can be efficiently solved by any optimization solver such as CPLEX. Finally, a numerical example is carried out to assess the model and analyze impact of the chance constraints and cargo shipment demand. © 2010 Taylor & Francis.
Source Title: Maritime Policy and Management
URI: http://scholarbank.nus.edu.sg/handle/10635/53933
ISSN: 03088839
DOI: 10.1080/03088839.2010.486635
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

52
checked on Dec 13, 2017

WEB OF SCIENCETM
Citations

44
checked on Nov 16, 2017

Page view(s)

83
checked on Dec 16, 2017

Google ScholarTM

Check

Altmetric


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