On the Determination of the Optimum Path in Space

: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. An example would be the determination of the shortest sea course between two given ports. This paper presents an examination of the problem, states the weaknesses of the existing solutions, and introduces a new approach, which can be easily applied to a variety of spaces, while considering different travel cost models. The implementation of the algorithm for movements on the plane surface, in the three-dimensional space, and on the spherical surface as an approximation of the earth, has been examined. The results are illustrated through several examples.

• Type: Conference
• Year: 1995
• Where: COSIT
• Authors: Emmanuel Stefanakis, Marinos Kavouras
• Keywords: Complex Problem, COSIT 1995, GIS, Optimum Paths, Shortest Sea Course