A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models

作者: Bin Ran , David E. Boyce , Larry J. LeBlanc

DOI: 10.1287/OPRE.41.1.192

关键词: Assignment problemFlow networkTraffic flowOptimal controlDynamic programmingTraffic congestionSimulationMathematical optimizationComputer scienceManagement Science and Operations ResearchComputer Science Applications

摘要: The instantaneous dynamic user-optimal (DUO) traffic assignment problem is to determine vehicle flows on each link at instant of time resulting from drivers using minimal-time routes. Instantaneous route the travel incurred if conditions remain unchanged while driving along route. In this paper, we introduce a different definition an DUO state. Using optimal control theory approach, formulate two new models for congested transportation network. These include formulations objective function and flow propagation constraints, are generalizations static model. equivalence solutions programs with demonstrated by proving first-order necessary conditions. Since these problems convex linear constraints...

参考文章(11)
B Ran, T Shimazaki, A GENERAL MODEL AND ALGORITHM FOR THE DYNAMIC TRAFFIC ASSIGNMENT PROBLEMS TRANSPORT POLICY, MANAGEMENT & TECHNOLOGY TOWARDS 2001 : SELECTED PROCEEDINGS OF THE FIFTH WORLD CONFERENCE ON TRANSPORT RESEARCH. ,vol. 4, ,(1989)
B Wie, DYNAMIC SYSTEM OPTIMAL TRAFFIC ASSIGNMENT ON CONGESTED MULTIDESTINATION NETWORKS TRANSPORT POLICY, MANAGEMENT & TECHNOLOGY TOWARDS 2001 : SELECTED PROCEEDINGS OF THE FIFTH WORLD CONFERENCE ON TRANSPORT RESEARCH. ,vol. 4, ,(1989)
Byung-Wook Wie, Terry L. Friesz, Roger L. Tobin, Dynamic user optimal traffic assignment on congested multidestination networks Transportation Research Part B: Methodological. ,vol. 24, pp. 431- 442 ,(1990) , 10.1016/0191-2615(90)90038-Z
Malachy Carey, Optimal time-varying flows on congested networks Operations Research. ,vol. 35, pp. 58- 69 ,(1987) , 10.1287/OPRE.35.1.58
Terry L. Friesz, Javier Luque, Roger L. Tobin, Byung-Wook Wie, Dynamic network traffic assignment considered as a continuous time optimal control problem Operations Research. ,vol. 37, pp. 893- 901 ,(1989) , 10.1287/OPRE.37.6.893
Deepak K. Merchant, George L. Nemhauser, Optimality Conditions for a Dynamic Traffic Assignment Model Transportation Science. ,vol. 12, pp. 200- 207 ,(1978) , 10.1287/TRSC.12.3.200
Deepak K. Merchant, George L. Nemhauser, A Model and an Algorithm for the Dynamic Traffic Assignment Problems Transportation Science. ,vol. 12, pp. 183- 199 ,(1978) , 10.1287/TRSC.12.3.183
Marguerite Frank, Philip Wolfe, An algorithm for quadratic programming Naval Research Logistics Quarterly. ,vol. 3, pp. 95- 110 ,(1956) , 10.1002/NAV.3800030109
Moshe Ben-Akiva, Andre de Palma, Pavlos Kanaroglou, Dynamic Model of Peak Period Traffic Congestion with Elastic Arrival Rates Transportation Science. ,vol. 20, pp. 164- 181 ,(1986) , 10.1287/TRSC.20.3.164