Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.tre.2013.02.003
Title: Bunker consumption optimization methods in shipping: A critical review and extensions
Authors: Wang, S.
Meng, Q. 
Liu, Z.
Keywords: Bunker consumption optimization
Mixed-integer nonlinear programming
Sailing speed
Shipping
Issue Date: Jul-2013
Source: Wang, S., Meng, Q., Liu, Z. (2013-07). Bunker consumption optimization methods in shipping: A critical review and extensions. Transportation Research Part E: Logistics and Transportation Review 53 (1) : 49-62. ScholarBank@NUS Repository. https://doi.org/10.1016/j.tre.2013.02.003
Abstract: It is crucial nowadays for shipping companies to reduce bunker consumption while maintaining a certain level of shipping service in view of the high bunker price and concerned shipping emissions. After introducing the three bunker consumption optimization contexts: minimization of total operating cost, minimization of emission and collaborative mechanisms between port operators and shipping companies, this paper presents a critical and timely literature review on mathematical solution methods for bunker consumption optimization problems. Several novel bunker consumption optimization methods are subsequently proposed. The applicability, optimality, and efficiency of the existing and newly proposed methods are also analyzed. This paper provides technical guidelines and insights for researchers and practitioners dealing with the bunker consumption issues. © 2013 Elsevier Ltd.
Source Title: Transportation Research Part E: Logistics and Transportation Review
URI: http://scholarbank.nus.edu.sg/handle/10635/58976
ISSN: 13665545
DOI: 10.1016/j.tre.2013.02.003
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

39
checked on Dec 13, 2017

WEB OF SCIENCETM
Citations

32
checked on Nov 16, 2017

Page view(s)

36
checked on Dec 16, 2017

Google ScholarTM

Check

Altmetric


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