Weather Routing Optimization: A New Shortest Path Algorithm

Abstract : —This paper presents an algorithm which solves the multiobjective shortest path problem in a time-dependent graph, taking advantage of the specificities of the weather routing problem. Multicriteria shortest path problems are widely studied in the literature, as well as monocriteria shortest path problems in time-dependent graphs. Their solving has numerous applications, especially in the transportation field. However, the combination of both these issues is not studied as much as each one separately. In this paper, we study the weather routing problem for cargo ships, which involves optimizing the ship routes following real-time weather information. For this problem, the arc weights on the graph have a low dispersion around their average value. We propose an extension of an algorithm (NAMOA*) taking advantage of this property. We study the validity of this new algorithm and explain why it solves efficiently the weather routing problem. Experiments done using real weather data corroborates the algorithm efficiency.
Document type :
Conference papers
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal-amu.archives-ouvertes.fr/hal-01792118
Contributor : Philippe Jégou <>
Submitted on : Tuesday, May 15, 2018 - 11:28:08 AM
Last modification on : Wednesday, September 12, 2018 - 1:27:41 AM
Long-term archiving on : Tuesday, September 25, 2018 - 4:45:59 PM

File

ICTAI-2017-Chauveau.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01792118, version 1

Collections

Citation

Estelle Chauveau, Philippe Jégou, Nicolas Prcovic. Weather Routing Optimization: A New Shortest Path Algorithm. 29th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2017, Nov 2017, Boston, United States. ⟨hal-01792118⟩

Share

Metrics

Record views

78

Files downloads

247