A scenario-based dynamic programming model for multi-period liner ship fleet planning
This paper proposes a more realistic multi-period liner ship fleet planning problem for a liner container shipping company than has been studied in previous literature. The proposed problem is formulated as a scenario-based dynamic programming model consisting of a number of integer linear programming formulations for each single planning period, and the model can be solved efficiently by a shortest path algorithm on an acyclic network. A numerical example is carried out to illustrate the applicability of the proposed model and solution method. The numerical results show that chartering in ships may not always be a better policy for a long-term planning horizon though it is much cheaper than buying ships in the short-term. Purchasing ships seems to be a more profitable investment in the long run.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 47 (2011)
Issue (Month): 4 (July)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic|
When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:47:y:2011:i:4:p:401-413. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.