Obstacle Bypassing in Optimal Ship Routing Using Simulated Annealing

Obstacle Bypassing in Optimal Ship Routing Using Simulated Annealing

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Kosmas, O T, Vlachos, D S, Simos, T E
Format: Tagungsbericht
Sprache:eng
Schlagworte:
ALGORITHMS
GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
MARITIME TRANSPORT
MATHEMATICAL METHODS AND COMPUTING
ROUTING
SHIPS
SIMULATION
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0094-243X
1551-7616
DOI:10.1063/1.3037118