東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Stochastic dynamic traffic assignmen...

Zhou, Chao.

FindBook

Google Book

Amazon

博客來

Stochastic dynamic traffic assignment for robust online operations under real-time information systems.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Stochastic dynamic traffic assignment for robust online operations under real-time information systems./
作者:	Zhou, Chao.
面頁冊數:	199 p.
附註:	Source: Dissertation Abstracts International, Volume: 64-08, Section: B, page: 3957.
Contained By:	Dissertation Abstracts International64-08B.
標題:	Engineering, Civil. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3099233
ISBN:	9780496468256

Stochastic dynamic traffic assignment for robust online operations under real-time information systems.
Zhou, Chao.

Stochastic dynamic traffic assignment for robust online operations under real-time information systems. - 199 p.

Source: Dissertation Abstracts International, Volume: 64-08, Section: B, page: 3957.

Thesis (Ph.D.)--Purdue University, 2002.

Dynamic Traffic Assignment (DTA), which aims at determining paths for traffic network users, plays a key role in Advanced Traveler Information Systems and Advanced Traffic Management Systems. Most existing DTA models are inadequate for on-line deployment because of their unrealistic assumptions on the availability of on-line information, their inability to account for the randomness in unfolding on-line conditions, and their computational requirements. In this research, a stochastic formulation of the dynamic traffic assignment problem is proposed to incorporate the inherent stochasticity within the traffic systems for on-line deployment. A stochastic quasi-gradient (SQG) algorithm is proposed to solve the problem. Simulation experiments indicate that the proposed stochastic quasi-gradient algorithm is superior to the previously proposed algorithms. To ensure on-line computational feasibility, a new paradigm for deployable dynamic traffic assignment is proposed. Called the hybrid strategy, it combines both off-line and on-line components. The off-line component uses the a priori optimization technique and SQG to seek a robust initial solution vis-a-vis randomness in origin-destination (O-D) demands using historical data. Heuristics are proposed to dynamically update the initial solution on-line based on unfolding demand and supply conditions. The hybrid approach circumvents the need for accurate on-line demand and network supply prediction models, while exploiting historical demand and network supply data off-line. Thereby, the computationally intensive components are executed off-line and are coupled with highly efficient on-line update heuristics. Extensive simulation studies highlight the robustness of the hybrid approach with respect to on-line variations in demand, its ability to address stochastic incident situations effectively, and its on-line efficiency.

ISBN: 9780496468256Subjects--Topical Terms:

783781
Engineering, Civil.

Stochastic dynamic traffic assignment for robust online operations under real-time information systems.
LDR:02833nmm 2200289 4500 001 1825955
005 20061206120631.5
008 130610s2002 eng d
020 $a 9780496468256
035 $a (UnM)AAI3099233
035 $a AAI3099233
040 $a UnM $c UnM
100 1 $a Zhou, Chao. $3 1673834
245 1 0 $a Stochastic dynamic traffic assignment for robust online operations under real-time information systems.
300 $a 199 p.
500 $a Source: Dissertation Abstracts International, Volume: 64-08, Section: B, page: 3957.
500 $a Major Professor: Srinivas Peeta.
502 $a Thesis (Ph.D.)--Purdue University, 2002.
520 $a Dynamic Traffic Assignment (DTA), which aims at determining paths for traffic network users, plays a key role in Advanced Traveler Information Systems and Advanced Traffic Management Systems. Most existing DTA models are inadequate for on-line deployment because of their unrealistic assumptions on the availability of on-line information, their inability to account for the randomness in unfolding on-line conditions, and their computational requirements. In this research, a stochastic formulation of the dynamic traffic assignment problem is proposed to incorporate the inherent stochasticity within the traffic systems for on-line deployment. A stochastic quasi-gradient (SQG) algorithm is proposed to solve the problem. Simulation experiments indicate that the proposed stochastic quasi-gradient algorithm is superior to the previously proposed algorithms. To ensure on-line computational feasibility, a new paradigm for deployable dynamic traffic assignment is proposed. Called the hybrid strategy, it combines both off-line and on-line components. The off-line component uses the a priori optimization technique and SQG to seek a robust initial solution vis-a-vis randomness in origin-destination (O-D) demands using historical data. Heuristics are proposed to dynamically update the initial solution on-line based on unfolding demand and supply conditions. The hybrid approach circumvents the need for accurate on-line demand and network supply prediction models, while exploiting historical demand and network supply data off-line. Thereby, the computationally intensive components are executed off-line and are coupled with highly efficient on-line update heuristics. Extensive simulation studies highlight the robustness of the hybrid approach with respect to on-line variations in demand, its ability to address stochastic incident situations effectively, and its on-line efficiency.
590 $a School code: 0183.
650 4 $a Engineering, Civil. $3 783781
650 4 $a Engineering, Industrial. $3 626639
650 4 $a Operations Research. $3 626629
690 $a 0543
690 $a 0546
690 $a 0796
710 2 0 $a Purdue University. $3 1017663
773 0 $t Dissertation Abstracts International $g 64-08B.
790 1 0 $a Peeta, Srinivas, $e advisor
790 $a 0183
791 $a Ph.D.
792 $a 2002
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3099233