DOE OSTI · 21251783
A Discrete Lagrangian Algorithm for Optimal Routing Problems
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Kosmas, O T, Vlachos, D S, Simos, T E. 2008-11-06. A Discrete Lagrangian Algorithm for Optimal Routing Problems. https://doi.org/10.1063/1.3037117
Cite the original work for its findings. Save a collection to share your selection of sources.