A Discrete Lagrangian Algorithm for Optimal Routing Problems

Journal Article · Thu Nov 06 00:00:00 EST 2008 · AIP Conference Proceedings

DOI:https://doi.org/10.1063/1.3037117· OSTI ID:21251783

Kosmas, O T; Vlachos, D S; Simos, T E ^[1]

---

1. University of Peloponnese, 22100 Tripoli (Greece)

The ideas of discrete Lagrangian methods for conservative systems are exploited for the construction of algorithms applicable in optimal ship routing problems. The algorithm presented here is based on the discretisation of Hamilton's principle of stationary action Lagrangian and specifically on the direct discretization of the Lagrange-Hamilton principle for a conservative system. Since, in contrast to the differential equations, the discrete Euler-Lagrange equations serve as constrains for the optimization of a given cost functional, in the present work we utilize this feature in order to minimize the cost function for optimal ship routing.

• OSTI ID: 21251783
• Journal Information: AIP Conference Proceedings, Vol. 1060, Issue 1; Other Information: DOI: 10.1063/1.3037117; (c) 2008 American Institute of Physics; IeCCS 2007: International electronic conference on computer science, 28 June - 8 July 2007; Country of input: International Atomic Energy Agency (IAEA); ISSN 0094-243X
• Country of Publication: United States
• Language: English

Related Subjects

97 MATHEMATICAL METHODS AND COMPUTING
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
ALGORITHMS
GAMMA SPECTROSCOPY
LAGRANGE EQUATIONS
LAGRANGIAN FIELD THEORY
LAGRANGIAN FUNCTION
MARITIME TRANSPORT
OPTIMIZATION
SHIPS