Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem
Terry L. Friesz, Javier Luque, Roger L. Tobin, Byung-Wook Wie
Operations Research · 1989 · Volume 37 · Issue 6
Abstract
Two continuous time formulations of the dynamic traffic assignment problem are considered, one that corresponds to system optimization and the other to a version of user optimization on a single mode network using optimal control theory. Pontryagin's necessary conditions are analyzed and given economic interpretations that correspond to intuitive notions regarding dynamic system optimized and dynamic user optimized traffic flow patterns. Notably, we offer the first dynamic generalization of Beckmann's equivalent optimization problem for static user optimized traffic assignment in the form of an optimal control problem. The analysis further establishes that a constraint qualification and convexity requirements for the Hamiltonian, which together ensure that the necessary conditions are also sufficient, are satisfied under commonly encountered regularity conditions.
Keywords
dynamic programming/optimal control: applications, networks/graphs: flow algorithms, transportation, models, assignment: dynamics
Enable JavaScript for citation tools and additional paper interactions.