A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Toward hybrid dynamic traffic assignment-models and solution procedures
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
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
Yi-Chang Chiu, (author) / Mahmassani, H.S. (author)
2001-01-01
899709 byte
Conference paper
Electronic Resource
English
Toward Hybrid Dynamic Traffic Assignment - Models and Solution Procedures
| British Library Conference Proceedings | 2001
Traffic Models for Dynamic Assignment
| British Library Conference Proceedings | 1992
An empirical study of simulation-based dynamic traffic assignment procedures
| Taylor & Francis Verlag | 2011
An empirical study of simulation-based dynamic traffic assignment procedures
| Online Contents | 2011
Approximate Solution Procedure for Dynamic Traffic Assignment
| Online Contents | 2013