Mathematical models and computational algorithms for probit-based asymmetric stochastic user equilibrium problem with elastic demand

This article addresses model development and computational algorithm design for the probit-based asymmetric stochastic user equilibrium (SUE) problem with elastic demand. Two variational inequality (VI) models are first proposed for the SUE problem and then existence and uniqueness of their solutions are examined. These two VI models are, in reality, built by means of a probit-based stochastic network loading (SNL) map. Since there is no computational procedure available for calculating the SNL map, we thus propose a two-stage Monte Carlo simulation-based method to estimate the SNL map. To compromise computational time with accuracy in the estimation, a lower bound of sample size required by the Monte Carlo simulation is also investigated. Based on these two VI models and Monte Carlo simulation-based method, we design two hybrid prediction–correction (PC) — cost averaging (CA) algorithms for solving the SUE problem. Finally, two numerical examples are carried out to assess performance of the proposed algorithms.

[1]  L. Liao,et al.  Improvements of Some Projection Methods for Monotone Nonlinear Variational Inequalities , 2002 .

[2]  Warrren B Powell,et al.  The Convergence of Equilibrium Algorithms with Predetermined Step Sizes , 1982 .

[3]  S. Bekhor,et al.  Investigating path-based solution algorithms to the stochastic user equilibrium problem , 2005 .

[4]  S. Dafermos.  Relaxation Algorithms for the General Asymmetric Traffic Equilibrium Problem , 1982 .

[5]  Charles E. Heckler,et al.  Applied Multivariate Statistical Analysis , 2005, Technometrics.

[6]  Yosef Sheffi,et al.  Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods , 1985 .

[7]  Mike Maher.  Stochastic user equilibrium assignment with elastic demand , 2001 .

[8]  Hai-Jun Huang,et al.  A study on logit assignment which excludes all cyclic flows , 1998 .

[9]  Roberto Cominetti,et al.  Markovian traffic equilibrium , 2007, Math. Program..

[10]  Carlos F. Daganzo,et al.  Multinomial Probit: The Theory and its Application to Demand Forecasting. , 1980 .

[11]  G. M. Korpelevich.  The extragradient method for finding saddle points and other problems , 1976 .

[12]  William H. K. Lam,et al.  Modelling rain effects on risk-taking behaviours of multi-user classes in road networks with uncertainty , 2008 .

[13]  Hai Yang,et al.  A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs , 2001, Eur. J. Oper. Res..

[14]  Shing Chung Josh Wong,et al.  On the convergence of Bell's logit assignment formulation , 1999 .

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

[16]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[17]  David Watling,et al.  Perturbation stability of the asymmetric stochastic equilibrium assignment model , 1998 .

[18]  Warren B. Powell,et al.  A COMPARISON OF STOCHASTIC AND DETERMINISTIC TRAFFIC ASSIGNMENT OVER CONGESTED NETWORKS , 1981 .

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

[20]  A. Nagurney.  Network Economics: A Variational Inequality Approach , 1992 .

[21]  C. Fisk.  Some developments in equilibrium traffic assignment , 1980 .

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

[23]  M. Florian,et al.  The convergence of diagonalization algorithms for asymmetric network equilibrium problems , 1982 .

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

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

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

[27]  D. Bertsekas,et al.  Projection methods for variational inequalities with application to the traffic assignment problem , 1982 .

[28]  F. Facchinei,et al.  Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[29]  Hai Yang.  Heuristic algorithms for the bilevel origin-destination matrix estimation problem , 1995 .

[30]  P. Hughes,et al.  A PROBIT-BASED STOCHASTIC USER EQUILIBRIUM ASSIGNMENT MODEL , 1997 .

[31]  Agachai Sumalee,et al.  Sensitivity analysis of the variable demand probit stochastic user equilibrium with multiple user-classes , 2007 .

[32]  Sang Nguyen,et al.  Solution Algorithms for Network Equilibrium Models with Asymmetric User Costs , 1982 .

[33]  P. C. Hughes,et al.  AN ALGORITHM FOR SUEED - STOCHASTIC USER EQUILIBRIUM WITH ELASTIC DEMAND , 1997 .

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

[35]  A. Nagurney,et al.  Projected Dynamical Systems and Variational Inequalities with Applications , 1995 .

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

[37]  C. Daganzo.  Unconstrained Extremal Formulation of Some Transportation Equilibrium Problems , 1982 .

[38]  Zhong Zhou,et al.  Comparative Analysis of Three User Equilibrium Models Under Stochastic Demand , 2008 .

[39]  M. Bell.  STOCHASTIC USER EQUILIBRIUM ASSIGNMENT IN NETWORKS WITH QUEUES , 1995 .

[40]  Shlomo Bekhor,et al.  EFFECTS OF CHOICE SET SIZE AND ROUTE CHOICE MODELS ON PATH-BASED TRAFFIC ASSIGNMENT , 2008 .

[41]  Qiang Meng,et al.  General stochastic user equilibrium traffic assignment problem with link capacity constraints , 2008 .