Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/13281
Title: Speed optimization and bunkering in liner shipping in the presence of uncertain service times and time windows at ports
Authors: Aydin, N
Lee, H
Mansouri, SA
Keywords: Transportation;OR in maritime industry;Fuel Cost;Dynamic programming
Issue Date: 2016
Publisher: Elsevier
Citation: European Journal of Operational Research, (2016)
Abstract: Recent studies in maritime shipping have concentrated on environmental and economic impacts of ships. In this regard, fuel is considered as one of the important factors for such impacts. In particular, the sailing speed of the vessels affects the fuel consumption directly. In this study, we consider a speed optimization problem in liner shipping, which is characterized by stochastic port times and time windows. The objective is to minimize the total fuel consumption while maintaining the schedule reliability. We develop a dynamic programming model by discretizing the port arrival times to provide approximate solutions. A deterministic model is presented to provide a lower bound on the optimal expected cost of the dynamic model. We also work on the effect of bunker prices on the liner service schedule. We propose a dynamic programming model for bunkering problem. Our numerical study using real data from a European liner shipping company indicates that the speed policy obtained by proposed dynamic model performs signi cantly better than the ones obtained by benchmark methods. Moreover, our results show that making speed decisions considering the uncertainty of port times will noticeably decrease fuel consumption cost.
URI: http://www.journals.elsevier.com/european-journal-of-operational-research
http://bura.brunel.ac.uk/handle/2438/13281
ISSN: 1872-6860
Appears in Collections:Brunel Business School Research Papers

Files in This Item:
File Description SizeFormat 
suplementary_document.pdf160.64 kBAdobe PDFView/Open
Fulltext.pdf1.2 MBAdobe PDFView/Open


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