Policy-based stochastic dynamic traffic assignment models and algorithms: Fid-Bau Portal

Fachinformationsdienst BAUdigital

A platform for research: civil engineering, architecture and urbanism

Policy-based stochastic dynamic traffic assignment models and algorithms

Gao, S. / Chabini, I.

Stochasticity is prevalent in transportation networks in general, and traffic networks in particular. We develop a policy-based stochastic dynamic traffic assignment (DTA) model and related solution algorithms. The DTA model works in a stochastic time-dependent network where link travel times are time-dependent random variables, Routing policies rather than paths are used as users' routing choices. A routing policy is a decision rule which specifies what node to take next out of current node based on current time and realized link travel times. We first give a conceptual framework for the DTA model. We then develop generic models for the routing policy generation problem, users' policy choice problem and dynamic network loading problem, which are the three major components of the overall DTA model. We then present a heuristic algorithm to solve the proposed policy-based DTA model. Using an example, we show that policy-based DTA models have solutions different, in expected travel times than the path-based models which are commonly used in the literature.

Access

Check availability in my library

Order at Subito €

Page navigation

Document information

Export, share and cite

Policy-based stochastic dynamic traffic assignment models and algorithms

Gao, S. / Chabini, I.

Stochasticity is prevalent in transportation networks in general, and traffic networks in particular. We develop a policy-based stochastic dynamic traffic assignment (DTA) model and related solution algorithms. The DTA model works in a stochastic time-dependent network where link travel times are time-dependent random variables, Routing policies rather than paths are used as users' routing choices. A routing policy is a decision rule which specifies what node to take next out of current node based on current time and realized link travel times. We first give a conceptual framework for the DTA model. We then develop generic models for the routing policy generation problem, users' policy choice problem and dynamic network loading problem, which are the three major components of the overall DTA model. We then present a heuristic algorithm to solve the proposed policy-based DTA model. Using an example, we show that policy-based DTA models have solutions different, in expected travel times than the path-based models which are commonly used in the literature.

Policy-based stochastic dynamic traffic assignment models and algorithms

Gao, S. / Chabini, I.

Stochasticity is prevalent in transportation networks in general, and traffic networks in particular. We develop a policy-based stochastic dynamic traffic assignment (DTA) model and related solution algorithms. The DTA model works in a stochastic time-dependent network where link travel times are time-dependent random variables, Routing policies rather than paths are used as users' routing choices. A routing policy is a decision rule which specifies what node to take next out of current node based on current time and realized link travel times. We first give a conceptual framework for the DTA model. We then develop generic models for the routing policy generation problem, users' policy choice problem and dynamic network loading problem, which are the three major components of the overall DTA model. We then present a heuristic algorithm to solve the proposed policy-based DTA model. Using an example, we show that policy-based DTA models have solutions different, in expected travel times than the path-based models which are commonly used in the literature.

Access

Check availability in my library

Order at Subito €

Page navigation

Document information

Export, share and cite

Document information

Title:

Policy-based stochastic dynamic traffic assignment models and algorithms

Contributors:

Gao, S. (author) / Chabini, I. (author)

Published in:

Proceedings. The IEEE 5th International Conference on Intelligent Transportation Systems ; 445-453

Publication date:

2002-01-01

Size:

627527 byte

ISBN:

DOI:

https://doi.org/10.1109/ITSC.2002.1041259

Type of media:

Conference paper

Type of material:

Electronic Resource

Language:

English

Similar titles

POLICY-BASED STOCHASTIC DYNAMIC TRAFFIC ASSIGNMENT MODELS AND ALGORITHMS

Gao, S. / Chabini, I. / IEEE | British Library Conference Proceedings | 2002

Dynamic Traffic Assignment: Genetic Algorithms Approach

Sadek, A. W. / Smith, B. L. / Demetsky, M. J. | British Library Online Contents | 1997

Traffic Models for Dynamic Assignment

Addison, J. D. / Heydecker, B. G. | British Library Conference Proceedings | 1992

Stochastic and deterministic formulations of dynamic traffic assignment

Heydecker, B. G. / Addison, J. D. / European Transport Forum | British Library Conference Proceedings | 1997

Stochastic Heuristic Dynamic Assignment Based on AIMSUN Microscopic Traffic Simulator

Barcelo, J. / Casas, J. | British Library Online Contents | 2006