Selfish routing equilibrium in stochastic traffic network: A probability-dominant description

This paper suggests a probability-dominant user equilibrium (PdUE) model to describe the selfish routing equilibrium in a stochastic traffic network. At PdUE, travel demands are only assigned to the most dominant routes in the same origin-destination pair. A probability-dominant rerouting dynamic model is proposed to explain the behavioral mechanism of PdUE. To facilitate applications, the logit formula of PdUE is developed, of which a well-designed route set is not indispensable and the equivalent varitional inequality formation is simple. Two routing strategies, i.e., the probability-dominant strategy (PDS) and the dominant probability strategy (DPS), are discussed through a hypothetical experiment. It is found that, whether out of insurance or striving for perfection, PDS is a better choice than DPS. For more general cases, the conducted numerical tests lead to the same conclusion. These imply that PdUE (rather than the conventional stochastic user equilibrium) is a desirable selfish routing equilibrium for a stochastic network, given that the probability distributions of travel time are available to travelers.

[1]  Daniel McFadden,et al.  Modelling the Choice of Residential Location , 1977 .

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

[3]  Yunpeng Wang,et al.  Large-Scale Transportation Network Congestion Evolution Prediction Using Deep Learning Theory , 2015, PloS one.

[4]  David Ben-Arieh.  Network Economics: A Variational Inequality Approach , 2012 .

[5]  M. Bierlaire,et al.  Discrete choice models with multiplicative error terms , 2009 .

[6]  Yunpeng Wang,et al.  Long short-term memory neural network for traffic speed prediction using remote microwave sensor data , 2015 .

[7]  Enrique Castillo,et al.  Closed form expressions for choice probabilities in the Weibull case , 2008 .

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

[9]  Hai-Jun Huang.  A Combined Algorithm for Solving and Calibrating the Stochastic Traffic Assignment Model , 1995 .

[10]  H. Levy.  Stochastic Dominance: Investment Decision Making under Uncertainty , 2010 .

[11]  M. Bell.  Alternatives to Dial's logit assignment algorithm , 1995 .

[12]  S. Kitthamkesorn,et al.  A Path-size Weibit Stochastic User Equilibrium Model , 2013 .

[13]  Wenyi Zhang,et al.  A Nonlinear Pairwise Swapping Dynamics to Model the Selfish Rerouting Evolutionary Game , 2013, Networks and Spatial Economics.

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

[15]  Florian Heiss,et al.  Discrete Choice Methods with Simulation , 2016 .

[16]  Randolph W. Hall,et al.  TRAVEL OUTCOME AND PERFORMANCE: THE EFFECT OF UNCERTAINTY ON ACCESSIBILITY , 1983 .

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

[18]  Takashi Akamatsu,et al.  Cyclic flows, Markov process and stochastic traffic assignment , 1996 .

[19]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[20]  Hong Kam Lo,et al.  Degradable transport network: Travel time budget of travelers with heterogeneous risk aversion , 2006 .

[21]  Carlo G. Prato,et al.  Route choice modeling: past, present and future research directions , 2009 .

[22]  Tao Wang,et al.  Nonlinear Min-Cost-Pursued Route-Swapping Dynamic System , 2013 .

[23]  Moshe Ben-Akiva,et al.  Discrete Choice Analysis: Theory and Application to Travel Demand , 1985 .

[24]  Yunpeng Wang,et al.  Understanding commuting patterns using transit smart card data , 2017 .

[25]  S. Bekhor,et al.  Route Choice Models Used in the Stochastic User Equilibrium Problem: A Review , 2004 .

[26]  Wei Guan,et al.  Alpha-reliable combined mean traffic equilibrium model with stochastic travel times , 2013 .