Toward hybrid dynamic traffic assignment-models and solution procedures

Y. C. Chiu, H. S. Mahmassani

Research output: Contribution to conferencePaper

8 Scopus citations

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 languageEnglish (US)
Pages245-250
Number of pages6
StatePublished - Jan 1 2001
Externally publishedYes
Event2001 IEEE Intelligent Transportation Systems Proceedings - Oakland, CA, United States
Duration: Aug 25 2001Aug 29 2001

Other

Other2001 IEEE Intelligent Transportation Systems Proceedings
CountryUnited States
CityOakland, CA
Period8/25/018/29/01

Keywords

  • Centralized
  • Decentralized
  • Dynamic traffic assignment
  • Game theory
  • Stackelberg game

ASJC Scopus subject areas

  • Automotive Engineering
  • Mechanical Engineering
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Toward hybrid dynamic traffic assignment-models and solution procedures'. Together they form a unique fingerprint.

  • Cite this

    Chiu, Y. C., & Mahmassani, H. S. (2001). Toward hybrid dynamic traffic assignment-models and solution procedures. 245-250. Paper presented at 2001 IEEE Intelligent Transportation Systems Proceedings, Oakland, CA, United States.