Abstract
This paper presents a hybrid framework for Dynamic Traffic Assignment (DTA) problems. The Hybrid DTA problem (HDTA) is modeled as a Stackelberg Game, in which the Centralized DTA (CDTA) model is considered as the game leader and the Decentralized DTA (DDTA) model is the follower. Central to the analysis is the algorithm that provides approximate solution for the assignment problem in a realistic size network. Experiments are conducted and the violation features of the HDTA model are discussed.
| Original language | English (US) |
|---|---|
| Pages | 245-250 |
| Number of pages | 6 |
| State | Published - 2001 |
| Event | 2001 IEEE Intelligent Transportation Systems Proceedings - Oakland, CA, United States Duration: Aug 25 2001 → Aug 29 2001 |
Other
| Other | 2001 IEEE Intelligent Transportation Systems Proceedings |
|---|---|
| Country/Territory | United States |
| City | Oakland, CA |
| Period | 8/25/01 → 8/29/01 |
Keywords
- Centralized
- Decentralized
- Dynamic traffic assignment
- Game theory
- Stackelberg game
ASJC Scopus subject areas
- Automotive Engineering
- Mechanical Engineering
- Computer Science Applications