A hamilton-jacobi optimal control framework for dynamic transportation network management
Keywords:
Hamilton–jacobi optimal control, hamilton–jacobi–bellman equation, dynamic transportation networks, optimal feedback control, traffic flow optimization, nonlinear dynamical systems, intelligent transportation management.Abstract
Advanced mathematical optimization modeling techniques are needed in dynamic transportation networks for the purpose of handling traffic dynamics and varying requirements of adaptive decision-making. In this study, a mathematical optimal control model based on Hamilton–Jacobi equations is designed to formulate the problem of managing dynamic transportation networks that are characterized by traffic dynamics modelled by nonlinear controlled dynamical systems. An optimal feedback control strategy has been developed using this model to solve the problem of minimizing congestion, travel delays, and costs associated with transportation operation while ensuring theoretical properties of existence, uniqueness, and stability. In formulating the problem, state dynamics, control variables, and cost functional are used, and the connection between system dynamics and the optimization objective is established via the Hamiltonian formulation. The Hamilton-Jacobi-Bellman (HJB) equation is obtained from the dynamic programming principle. The proposed method is investigated through a simulation of a transportation network with 20 nodes, 45 edges, and a 60-minute operational duration. A comparison with the STA, MPC, and RL-based techniques reveals that the proposed HJB algorithm gives the lowest delay value of 10.7 minutes, congestion value of 0.46, and cost value of 890. This algorithm yields a 42.5% reduction in delay, a 43.9% reduction in congestion, and a 41.4% reduction in cost compared to existing algorithms. Moreover, a stability analysis shows that the optimization is stable through the reduction of the objective cost from 1520 to 890 over 50 iterations.
Downloads
Downloads
Published
Issue
Section
License
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.

