TY - JOUR
T1 - Multiple equilibria in a dynamic traffic network
AU - Iryo, Takamasa
N1 - Funding Information:
I would like to express my gratitude to Professor Mike Smith of the University of York for his useful comments and suggestions to this study. I am also thankful for the useful comments from anonymous reviewers. This study is financially supported by JSPS Grant-in-Aid #22686048, although all aspects of the study were conducted solely by the author (the funding source had no role in the study itself).
PY - 2011/7
Y1 - 2011/7
N2 - This study provides an example in which the dynamic user equilibrium (DUE) assignment of a congested road network with bottlenecks is non-unique. In previous studies, the uniqueness of DUE assignments with the bottleneck model has been shown in limited cases such as single-origin and single-destination networks. Consequently, it is still an important issue whether or not uniqueness is a general property of DUE assignments. The present study describes a network in which multiple patterns of link travel time are found, thus providing a negative answer to this question. The network has a loopy structure with multiple bottlenecks and multiple origin-destination (OD) pairs. Given a certain demand pattern of departure times for vehicles leaving their origins, a non-convex set of equilibria with a non-unique pattern of link travel times is shown to exist.
AB - This study provides an example in which the dynamic user equilibrium (DUE) assignment of a congested road network with bottlenecks is non-unique. In previous studies, the uniqueness of DUE assignments with the bottleneck model has been shown in limited cases such as single-origin and single-destination networks. Consequently, it is still an important issue whether or not uniqueness is a general property of DUE assignments. The present study describes a network in which multiple patterns of link travel time are found, thus providing a negative answer to this question. The network has a loopy structure with multiple bottlenecks and multiple origin-destination (OD) pairs. Given a certain demand pattern of departure times for vehicles leaving their origins, a non-convex set of equilibria with a non-unique pattern of link travel times is shown to exist.
KW - Bottleneck model
KW - Dynamic traffic assignment
KW - Dynamic user equilibrium
KW - Uniqueness
UR - http://www.scopus.com/inward/record.url?scp=79956373326&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79956373326&partnerID=8YFLogxK
U2 - 10.1016/j.trb.2011.02.010
DO - 10.1016/j.trb.2011.02.010
M3 - Article
AN - SCOPUS:79956373326
SN - 0191-2615
VL - 45
SP - 867
EP - 879
JO - Transportation Research, Series B: Methodological
JF - Transportation Research, Series B: Methodological
IS - 6
ER -