A Discrete Lagrangian Algorithm for Optimal Routing Problems
Journal Article
·
· AIP Conference Proceedings
- 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, Journal Name: AIP Conference Proceedings Journal Issue: 1 Vol. 1060; ISSN APCPCS; ISSN 0094-243X
- Country of Publication:
- United States
- Language:
- English
Similar Records
Projected Lagrangian algorithms for nonlinear minimax and l/sub 1/ optimization
Noether Theorem and independence of conserved quantities in Lagrangian field theories
Macroscopic Lagrangian description of warm plasmas, 1. formulation of the Langrangian
Technical Report
·
Wed Aug 01 00:00:00 EDT 1979
·
OSTI ID:5784880
Noether Theorem and independence of conserved quantities in Lagrangian field theories
Thesis/Dissertation
·
Fri Dec 31 23:00:00 EST 1982
·
OSTI ID:5794935
Macroscopic Lagrangian description of warm plasmas, 1. formulation of the Langrangian
Journal Article
·
Fri Dec 31 23:00:00 EST 1982
· Radio Science
·
OSTI ID:1081873