Discrete Algorithms for Optimization in Ship Routing Problems

Kosmas O, Vlachos DS, Simos TE (2007)

Publication Type: Conference contribution

Publication year: 2007


Publisher: American Institute of Physics

Edited Volumes: AIP Conference Proceedings

Book Volume: 936

Pages Range: 322-325

Conference Proceedings Title: AIP Conference Proceedings

Event location: Corfu GR

DOI: 10.1063/1.2790141


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. © 2007 American Institute of Physics.

Authors with CRIS profile

Involved external institutions

How to cite


Kosmas, O., Vlachos, D.S., & Simos, T.E. (2007). Discrete Algorithms for Optimization in Ship Routing Problems. In AIP Conference Proceedings (pp. 322-325). Corfu, GR: American Institute of Physics.


Kosmas, Odysseas, Dimitros S Vlachos, and Theodoros E. Simos. "Discrete Algorithms for Optimization in Ship Routing Problems." Proceedings of the International Conference of Numerical Analysis and Applied Mathematics, Corfu American Institute of Physics, 2007. 322-325.

BibTeX: Download