2011
DOI: 10.1007/s00773-011-0152-z
|View full text |Cite
|
Sign up to set email alerts
|

Development of a novel forward dynamic programming method for weather routing

Abstract: This paper presents a novel forward dynamic programming method for weather routing to minimise ship fuel consumption during a voyage. Compared with traditional weather routing methods which only optimise the ship's heading, while the engine power or propeller rotation speed is set as a constant throughout the voyage, this new method considers both the ship power settings and heading controls. A float state technique is used to reduce the iterations required during optimisation and thus save computation time. T… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
52
0
1

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 127 publications
(54 citation statements)
references
References 7 publications
1
52
0
1
Order By: Relevance
“…Dijkstra's algorithm was used to determine the minimum energy path for a surface ship [9], and the Theta* algorithm, which is a modified version of A*, was applied to path planning [10]. Wind and waves were also considered under the name of weather routing in [11][12][13][14]. These researches considered the added resistance induced by wind and waves for the path planning and the paths were generated using conventional methods such as A* and dynamic programming.…”
Section: Related Workmentioning
confidence: 99%
“…Dijkstra's algorithm was used to determine the minimum energy path for a surface ship [9], and the Theta* algorithm, which is a modified version of A*, was applied to path planning [10]. Wind and waves were also considered under the name of weather routing in [11][12][13][14]. These researches considered the added resistance induced by wind and waves for the path planning and the paths were generated using conventional methods such as A* and dynamic programming.…”
Section: Related Workmentioning
confidence: 99%
“…the calculus of variations [17], the modified isochrone method [18,19], the isopone method [20,21], the two-dimensional dynamic programming [13,22] and the three-dimensional dynamic programming [2]. Apart from above-mentioned algorithms, many other approaches have also been applied to solve these problems, such as the iterative dynamic programming [23], the augmented Lagrange multiplier [24], the Dijkstra algorithm [15,25] and the genetic algorithm [26].…”
Section: Introductionmentioning
confidence: 99%
“…It is well known that the ship routing optimization for oceangoing vessels is widely applied, and a considerable number of studies have been carried out [1][2][3][4][5][6][7][8][9][10]. Typically, ship routing can be modeled as a minimum fuel consumption problem subject to some constraints, which is solved with an optimization method [11][12][13][14][15].…”
Section: Introductionmentioning
confidence: 99%
“…Speed, loading and heading should all be integrated into routing optimization, making the problem multi-dimensional [21].…”
Section: Introductionmentioning
confidence: 99%