Discrete Algorithms for Optimization in Ship Routing Problems

Discrete Algorithms for Optimization in Ship Routing Problems

Within the ideas of discretization of Lagrangian dynamics for conservative systems, we have constructed a discrete algorithm appropriate for optimal ship routing problems. This algorithm is an iterative optimization which produces optimal routes and optimal cost functions, by exploiting the advantag...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Kosmas, O T, Vlachos, D S, Simos, T H
Format: Tagungsbericht
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Within the ideas of discretization of Lagrangian dynamics for conservative systems, we have constructed a discrete algorithm appropriate for optimal ship routing problems. This algorithm is an iterative optimization which produces optimal routes and optimal cost functions, by exploiting the advantages of the discrete Lagrangian methods.
ISSN:0094-243X
DOI:10.1063/1.2790141