Traffic Assignment with Adaptive Routing Choices in Stochastic Time-Dependent Networks
Lists
Only you see this
Abstract
This paper establishes a user-equilibrium traffic assignment model where users make adaptive routing decisions, defined as routing policies, in a stochastic time-dependent network. A generalization of Waldrop's First Principle is used as the equilibrium condition: each user follows a routing policy with minimum perceived disutility at his/her departure time and no user can unilaterally change routing policies to improve his/her perceived disutility. A general framework is provided and the equilibrium problem is formulated as a fixed point problem with three components: the optimal routing policy generation module, the routing policy choice model and the policy-based dynamic network loader. An MSA (method of successive averages) heuristic is designed. Computational tests are carried out in a hypothetical network, where random incidents are the source of stochasticity. The heuristic converges satisfactorily in the test network under the proposed test settings. The adaptiveness in the routing policy based model leads to travel time savings at equilibrium. As a byproduct, travel time reliability is also enhanced. The value of online information is an increasing function of the incident probability. Travel time savings are high when market penetrations are low. However, the function of travel time saving against market penetration is not monotonic. This suggests that in a travelers' information system or route guidance system, the information penetration needs to be chosen carefully to maximize benefits.
BibTeX
@inproceedings{gao2006traffic,
author = {Song Gao},
title = {{Traffic Assignment with Adaptive Routing Choices in Stochastic Time-Dependent Networks}},
booktitle = {Transportation},
year = {2006},
}Loading related content...