Please use this identifier to cite or link to this item:
Title: A note on ship routing between ports
Authors: Wang, S 
Keywords: Bunker fuel
Dynamic programming
Sea transport
Ship routing
Issue Date: 2017
Publisher: Springer
Source: Optimization letters, 2017, v. 11, no. 1 , p. 217-223 How to cite?
Journal: Optimization letters 
Abstract: To minimize bunker fuel consumption, ship captains choose suitable speed and heading to take advantage of ocean currents, wind, and wave when routing a ship between two ports. Conventional approaches discretize the space and time and then apply dynamic programming to find the optimal speed and heading of a ship at each time. Nevertheless, the resulting solution to the discretized problem may not converge to the optimal solution to the original continuous problem, even when the sizes of the discretization grids approach 0. To overcome this deficiency, we propose an improved dynamic programming approach. The novelty of the improved method lies in that we repeatedly re-discretize the space in both controlled and random manners to obtain better solutions. The improved dynamic programming approach provides significantly better solutions than the conventional approaches.
ISSN: 1862-4472
EISSN: 1862-4480
DOI: 10.1007/s11590-016-1000-1
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Citations as of Nov 18, 2018

Google ScholarTM



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