Modeling Strategic Route Choice and Real-Time Information Impacts in Stochastic and Time-Dependent Networks

This paper establishes a general framework to study the impacts of real-time information on the users' routing decisions and the system cost in a stochastic time-dependent traffic network under a generalized equilibrium condition. Users are assumed to make strategic routing decisions, and the rule that maps a user's current state, including node, time, and information, to a decision on the next node to take, is defined as a routing policy. This definition allows for a wide variety of information accessibility situations, thus excluding the usually simplified assumptions, such as either no information or full information. A user's choice set contains routing policies rather than simple paths. A fixed-point problem formulation of the user equilibrium is given, and a method of successive average heuristic is designed. Computational tests are carried out in a hypothetical network, where random incidents are the source of stochasticity. System costs derived from three models with different information accessibility situations are compared. The strategic route choices lead to shorter expected travel times at equilibrium. Smaller travel time variances are obtained as a byproduct. The value of real-time information is an increasing function of the incident probability. However, it is not a monotonic function of the market penetration of information, which suggests that in designing a traveler information system or route guidance system, the information penetration needs to be chosen carefully to maximize benefits.

[1]  Adaptive least-expected time paths in stochastic, time-varying transportation and data networks , 2001 .

[2]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[3]  Randolph W. Hall,et al.  The Fastest Path through a Network with Random Time-Dependent Travel Times , 1986, Transp. Sci..

[4]  Bekir Bartin,et al.  Determining the Optimal Configuration of Highway Routes for Real-Time Traffic Information: A Case Study , 2010, IEEE Transactions on Intelligent Transportation Systems.

[5]  Hong Kam Lo,et al.  Network with degradable links: capacity analysis and design , 2003 .

[6]  Carlos F. Daganzo,et al.  On Stochastic Models of Traffic Assignment , 1977 .

[7]  Patrice Marcotte,et al.  Equilibrium and Advanced Transportation Modelling , 2013 .

[8]  Patrice Marcotte,et al.  A Strategic Flow Model of Traffic Assignment in Static Capacitated Networks , 2004, Oper. Res..

[9]  Martin L. Hazelton.  Some Remarks on Stochastic User Equilibrium , 1998 .

[10]  He Huang,et al.  Real-time traveler information for optimal adaptive routing in stochastic time-dependent networks , 2012 .

[11]  Haris N. Koutsopoulos,et al.  DEVELOPMENT OF A ROUTE GUIDANCE GENERATION SYSTEM FOR REAL-TIME APPLICATION , 1997 .

[12]  Song Gao,et al.  Optimal adaptive routing and traffic assignment in stochastic time-dependent networks , 2005 .

[13]  Peter Bonsall,et al.  Traveller Behavior: Decision-Making in an Unpredictable World , 2004, J. Intell. Transp. Syst..

[14]  Moshe Ben-Akiva,et al.  Adaptive route choices in risky traffic networks: A prospect theory approach , 2010 .

[15]  Athanasios K. Ziliaskopoulos,et al.  Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future , 2001 .

[16]  H. Mahmassani,et al.  Least expected time paths in stochastic, time-varying transportation networks , 1999 .

[17]  Patrice Marcotte,et al.  A Strategic Model for Dynamic Traffic Assignment , 2004 .

[18]  Donald L. Fisher,et al.  Route Choice Behavior in a Driving Simulator With Real-time Information , 2011 .

[19]  Tim Lomax,et al.  THE 2003 ANNUAL URBAN MOBILITY REPORT , 2003 .

[20]  M. Bierlaire,et al.  Discrete Choice Methods and their Applications to Short Term Travel Decisions , 1999 .

[21]  David P. Watling,et al.  A Second Order Stochastic Network Equilibrium Model, I: Theoretical Foundation , 2002, Transp. Sci..

[22]  Robert B. Dial,et al.  A PROBABILISTIC MULTIPATH TRAFFIC ASSIGNMENT MODEL WHICH OBVIATES PATH ENUMERATION. IN: THE AUTOMOBILE , 1971 .

[23]  Song Gao,et al.  Optimal routing policy problems in stochastic time-dependent networks , 2006 .

[24]  Yu Nie,et al.  Multi-class percentile user equilibrium with flow-dependent stochasticity , 2011 .

[25]  J. Tsitsiklis,et al.  Stochastic shortest path problems with recourse , 1996 .

[26]  Zhong Zhou,et al.  The [alpha]-reliable Mean-Excess Traffic Equilibrium Model with Stochastic Travel Times , 2010 .

[27]  John W. Polak,et al.  STATIONARY STATES IN STOCHASTIC PROCESS MODELS OF TRAFFIC ASSIGNMENT: A MARKOV CHAIN MONTE CARLO APPROACH , 1996 .

[28]  S. Travis Waller,et al.  On the online shortest path problem with limited arc cost dependencies , 2002, Networks.

[29]  Carlos F. Daganzo,et al.  Stochastic network equilibrium with multiple vehicle types and asymmetric , 1983 .

[30]  Pitu Mirchandani,et al.  Generalized Traffic Equilibrium with Probabilistic Travel Times and Perceptions , 1987, Transp. Sci..

[31]  Giulio Erberto Cantarella,et al.  Dynamic Processes and Equilibrium in Transportation Networks: Towards a Unifying Theory , 1995, Transp. Sci..

[32]  Maria Nadia Postorino,et al.  Fixed Point Approaches to the Estimation of O/D Matrices Using Traffic Counts on Congested Networks , 2001, Transp. Sci..

[33]  Agachai Sumalee,et al.  A network equilibrium model with travellers’ perception of stochastic travel times , 2009 .

[34]  David P. Watling,et al.  A Second Order Stochastic Network Equilibrium Model, II: Solution Method and Numerical Experiments , 2002, Transp. Sci..

[35]  Moshe Ben-Akiva,et al.  Adaptive Route Choice Models in Stochastic Time-Dependent Networks , 2008 .

[36]  Giulio Erberto Cantarella,et al.  A General Fixed-Point Approach to Multimode Multi-User Equilibrium Assignment with Elastic Demand , 1997, Transp. Sci..

[37]  Stefano Pallottino,et al.  Equilibrium traffic assignment for large scale transit networks , 1988 .

[38]  Robert L. Smith,et al.  User-equilibrium properties of fixed points in dynamic traffic assignment 1 1 This research was supp , 1998 .

[39]  Satish V. Ukkusuri,et al.  Exploring User Behavior in Online Network Equilibrium Problems , 2007 .

[40]  Henry X. Liu,et al.  An Analytical Dynamic Traffic Assignment Model with Probabilistic Travel Times and Travelers' Perceptions , 2002 .

[41]  Daniele Pretolani,et al.  A directed hypergraph model for random time dependent shortest paths , 2000, Eur. J. Oper. Res..

[42]  E. Cascetta.  A stochastic process approach to the analysis of temporal dynamics in transportation networks , 1989 .

[43]  Warren B. Powell,et al.  An algorithm for the equilibrium assignment problem with random link times , 1982, Networks.

[44]  Danny Weyns,et al.  A Decentralized Approach for Anticipatory Vehicle Routing Using Delegate Multiagent Systems , 2011, IEEE Transactions on Intelligent Transportation Systems.

[45]  Avinash Unnikrishnan,et al.  User Equilibrium with Recourse , 2009 .

[46]  Gary A. Davis,et al.  Large Population Approximations of a General Stochastic Traffic Assignment Model , 1993, Oper. Res..

[47]  Michael Florian,et al.  Optimal strategies: A new assignment model for transit networks , 1989 .

[48]  W. Marsden.  I and J , 2012 .

[49]  Song Gao,et al.  Strategic Thinking and Risk Attitudes in Route Choice , 2010 .

[50]  Bin Ran,et al.  Analytical Dynamic Traffic Assignment Model with Probabilistic Travel Times and Perceptions , 2002 .