DocumentCode
828334
Title
Perturbation strategies for optimal traffic reassignment
Author
Gershwin, Stanley B. ; Dersin, Pierre ; Athans, Michael
Author_Institution
Massachusetts Institute of Technology, MA, USA
Volume
24
Issue
1
fYear
1979
fDate
2/1/1979 12:00:00 AM
Firstpage
3
Lastpage
12
Abstract
Suboptimal static traffic reassignment strategies are developed following a traffic perturbation due to an incident or change in flow in a large freeway corridor network. The basic technique is perturbation analysis using a quadratic approximation to the cost of traversing the roadway links. A dynamic programming approach, using the subnetwork number as the stage variable, leads to an optimization problem which is a variant of the linear-quadratic optimal control problem. Explicit relationships between decay of perturbations, controllability, and lateral access in the network are obtained. The perturbation strategies are useful because they can be used 1) to isolate the subset of the network that needs to be reoptimized by nonlinear programming, or 2) as a real-time quasistatic traffic reassignment algorithm; in either case computational requirements are reduced.
Keywords
Dynamic programming; Perturbation methods; Road-traffic control; Communication system traffic control; Cost function; Dynamic programming; Identity-based encryption; Optimal control; Roads; Telecommunication traffic; Traffic control; Transportation; Vehicle dynamics;
fLanguage
English
Journal_Title
Automatic Control, IEEE Transactions on
Publisher
ieee
ISSN
0018-9286
Type
jour
DOI
10.1109/TAC.1979.1101938
Filename
1101938
Link To Document