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 solution features of the HDTA model are discussed.
Toward hybrid dynamic traffic assignment-models and solution procedures
2001-01-01
899709 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Toward Hybrid Dynamic Traffic Assignment - Models and Solution Procedures
British Library Conference Proceedings | 2001
|Microsimulation-based procedures for dynamic network traffic assignment
British Library Conference Proceedings | 1994
|Traffic Models for Dynamic Assignment
British Library Conference Proceedings | 1992
|Traffic models for dynamic assignment
British Library Conference Proceedings | 1992
|An empirical study of simulation-based dynamic traffic assignment procedures
Online Contents | 2011
|