Toward hybrid dynamic traffic assignment-models and solution procedures

Yi-Chang Chiu, H. S. Mahmassani

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

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)
Title of host publicationIEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC
Pages245-250
Number of pages6
StatePublished - 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

Fingerprint

Differential thermal analysis
Experiments

Keywords

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

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Chiu, Y-C., & Mahmassani, H. S. (2001). Toward hybrid dynamic traffic assignment-models and solution procedures. In IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC (pp. 245-250)

Toward hybrid dynamic traffic assignment-models and solution procedures. / Chiu, Yi-Chang; Mahmassani, H. S.

IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC. 2001. p. 245-250.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chiu, Y-C & Mahmassani, HS 2001, Toward hybrid dynamic traffic assignment-models and solution procedures. in IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC. pp. 245-250, 2001 IEEE Intelligent Transportation Systems Proceedings, Oakland, CA, United States, 8/25/01.
Chiu Y-C, Mahmassani HS. Toward hybrid dynamic traffic assignment-models and solution procedures. In IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC. 2001. p. 245-250
Chiu, Yi-Chang ; Mahmassani, H. S. / Toward hybrid dynamic traffic assignment-models and solution procedures. IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC. 2001. pp. 245-250
@inproceedings{c029f15082994dbea9f34b9e71d15aa8,
title = "Toward hybrid dynamic traffic assignment-models and solution procedures",
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.",
keywords = "Centralized, Decentralized, Dynamic traffic assignment, Game theory, Stackelberg game",
author = "Yi-Chang Chiu and Mahmassani, {H. S.}",
year = "2001",
language = "English (US)",
pages = "245--250",
booktitle = "IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC",

}

TY - GEN

T1 - Toward hybrid dynamic traffic assignment-models and solution procedures

AU - Chiu, Yi-Chang

AU - Mahmassani, H. S.

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

KW - Centralized

KW - Decentralized

KW - Dynamic traffic assignment

KW - Game theory

KW - Stackelberg game

UR - http://www.scopus.com/inward/record.url?scp=0034779493&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034779493&partnerID=8YFLogxK

M3 - Conference contribution

SP - 245

EP - 250

BT - IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC

ER -