A Three-Dimensional Dijkstra's algorithm for multi-objective ship voyage optimization

Impact of ship operations aided by voyage optimization on a ship’s fatigue assessment

“…9 A typical workflow of the voyage optimization process concerning various objectives, such as minimum fuel consumption, lowest fatigue damage and ETA, etc sailing course and speeds along the voyage. Some recent development focus on Dijkstra's algorithm [44], such as in Böttner [45], Skoglund et al [46], and Wang et al [35] who proposed a scheme for applying Dijkstra's algorithm into a three-dimensional voyage optimization problem to allow multi-objective global voyage optimizations. Some of the methods used in this study are listed in Table 2 and will be further explained in the following section.…”

“…The solid lines represent the measured ship routes and encountered H s . These routes are further optimized by a new 3-dimensional Dijkstra's Algorithm proposed in [35], focusing on the minimum fuel consumption and the same ETA as the measured voyages. It shows in Fig.…”

“…NB: the color bar presents the probability of the occurrence of certain wave ranges for lowest fatigue damage accumulation, respectively. The method for the voyage optimizations is a 3D Dijkstra's Algorithm (3DDA) as proposed in [35]. The influence of voyage optimization-aided ship operations on both short-term wave environments (individual voyage) and long-term wave statistics (sailing during the 3 years of measurement campaign) is also investigated.…”

“…In addition to the significant wave height H s , the fuel-based 3DDA voyage optimization method can consider the effect of other sea environmental parameters such as heading, speed, wave period, etc., on the ship's fuel consumption along a voyage. The fuel-based voyage optimization can always generate optimal routes with less fuel consumption than the actual sailing routes [35].…”

“…Comparison of ship routes and encountered H s by the chemical tankers between actual measurements and further optimized by a 3-dimensional Dijkstra's Algorithm proposed in[35] with the same travel times as measured. The solid lines represent information from the measurements, and the dashed lines represent information from the optimized ship routes…”