Ship weather routing based on modified Dijkstra algorithm

DOI

10.2991/mmebc-16.2016.147How to use a DOI?

Keywords

modified Dijkstra algorithm, weather routing, linked list.

Abstract

Ship weather routing is used to obtain a shortest time path or most economical path considering weather condition. Many approaches have been studied to solve ship-routing problem, and Dijkstra algorithm is quite practical among them. A modified Dijkstra algorithm using structure matrix and single linked list is applied to establish shortest time route in this passage. The weights are stored by structure matrix instead of adjacency matrix and single linked list is used for less time consumption. The modified algorithm owns a better computational complexity due to the improved methods, meanwhile, simulations are made to illustrate the result of the modified algorithm.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xianming Zhu
AU  - Hongbo Wang
AU  - Zihao Shen
AU  - Hongjun Lv
PY  - 2016/06
DA  - 2016/06
TI  - Ship weather routing based on modified Dijkstra algorithm
BT  - Proceedings of the 2016 6th International Conference on Machinery, Materials, Environment, Biotechnology and Computer
PB  - Atlantis Press
SP  - 696
EP  - 699
SN  - 2352-5401
UR  - https://doi.org/10.2991/mmebc-16.2016.147
DO  - 10.2991/mmebc-16.2016.147
ID  - Zhu2016/06
ER  -