Obstacle Bypassing in Optimal Ship Routing Using Simulated Annealing
Kosmas O, Vlachos DS, Simos TE (2007)
Publication Type: Conference contribution
Publication year: 2007
Book Volume: 1060
Pages Range: 79-83
Conference Proceedings Title: AIP Conference Proceedings
Event location: Athens
Abstract
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.
Authors with CRIS profile
Involved external institutions
How to cite
APA:
Kosmas, O., Vlachos, D.S., & Simos, T.E. (2007). Obstacle Bypassing in Optimal Ship Routing Using Simulated Annealing. In AIP Conference Proceedings (pp. 79-83). Athens, GR.
MLA:
Kosmas, Odysseas, Dimitros S Vlachos, and Theodoros E. Simos. "Obstacle Bypassing in Optimal Ship Routing Using Simulated Annealing." Proceedings of the International electronic Conference on Computer Science, Athens 2007. 79-83.
BibTeX: Download