Obstacle Bypassing in Optimal Ship Routing Using Simulated Annealing
Odysseas Kosmas, Dimitrios S. Vlachos, T. E. Simos, Theodore E. Simos, George Psihoyios · AIP conference proceedings · 2008
In this paper we are going to discuss a variation on the problem of finding the shortest path between two points in optimal ship routing problems consisting of obstacles that are not allowed to be crossed by the path. Our main goal are going to be the construction of an appropriate algorithm, based in an earlier work [16] by computing the shortest path between two points in the plane that avoids a set of polygonal obstacles.