Mean-Risk Traffic Assignment Under the Continuously Distributed Risk-Aversion Factor

Published Online:https://doi.org/10.1287/opre.2024.1027

References

  • Armijo L (1966) Minimization of functions having Lipschitz continuous first partial derivatives. Pacific J. Math. 16(1):1–3.CrossrefGoogle Scholar
  • Barzilai J, Borwein JM (1988) Two-point step size gradient methods. IMA J. Numer. Anal. 8(1):141–148.CrossrefGoogle Scholar
  • Beckmann M, McGuire CB, Winsten CB (1956) Studies in the Economics of Transportation (Yale University Press, New Haven).Google Scholar
  • Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math. Programming 98(1–3):49–71.CrossrefGoogle Scholar
  • Bhat CR, Sardesai R (2006) The impact of stop-making and travel time reliability on commute mode choice. Transportation Res. Part B: Methodological 40(9):709–730.CrossrefGoogle Scholar
  • Bureau of Public Roads (1964) Traffic Assignment Manual (U.S. Department of Commerce, Washington, DC).Google Scholar
  • Carrion C, Levinson D (2012) Value of travel time reliability: A review of current evidence. Transportation Res. Part A: Policy Practice 46(4):720–741.CrossrefGoogle Scholar
  • Chen A, Zhou Z (2010) The α-reliable mean-excess traffic equilibrium model with stochastic travel times. Transportation Res. Part B: Methodological 44(4):493–513.CrossrefGoogle Scholar
  • Chicoisne R, Ordóñez F, Espinoza D (2018) Risk averse shortest paths: A computational study. INFORMS J. Comput. 30(3):539–553.LinkGoogle Scholar
  • Dafermos SC, Sparrow FT (1969) Traffic assignment problem for a general network. J. Res. National Bureau Standards Sect. B: Math. Sci. 73B(2):91–118.CrossrefGoogle Scholar
  • Dial RB (1996) Bicriterion traffic assignment: Basic theory and elementary algorithms. Transportation Sci. 30(2):93–111.LinkGoogle Scholar
  • Dial RB (1997) Bicriterion traffic assignment: Efficient algorithms plus examples. Transportation Res. Part B: Methodological 31(5):357–379.CrossrefGoogle Scholar
  • Dial RB (1999a) Network-optimized road pricing: Part I: A parable and a model. Oper. Res. 47(1):54–64.LinkGoogle Scholar
  • Dial RB (1999b) Network-optimized road pricing: Part II: Algorithms and examples. Oper. Res. 47(2):327–336.LinkGoogle Scholar
  • Dial RB (2006) A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration. Transportation Res. Part B: Methodological 40(10):917–936.CrossrefGoogle Scholar
  • Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Math. 1:269–271.CrossrefGoogle Scholar
  • Du M, Tan H, Chen A (2021) A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models. Eur. J. Oper. Res. 290(3):982–999.CrossrefGoogle Scholar
  • Ehrgott M (2005) Multicriteria Optimization (Springer, Berlin).Google Scholar
  • Engelson L, Lindberg PO (2006) Congestion pricing of road networks with users having different time values. Lawphongpanich S, Hearn DW, Smith MJ, eds. Mathematical and Computational Models for Congestion Charging (Springer, Boston), 81–104.CrossrefGoogle Scholar
  • Gabriel SA, Bernstein D (1997) The traffic equilibrium problem with nonadditive path costs. Transportation Sci. 31(4):337–348.LinkGoogle Scholar
  • Hartman P, Stampacchia G (1966) On some non-linear elliptic differential-functional equations. Acta Math. 115:271–310.CrossrefGoogle Scholar
  • He F, Yin Y, Lawphongpanich S (2014) Network equilibrium models with battery electric vehicles. Transportation Res. Part B: Methodological 67:306–319.CrossrefGoogle Scholar
  • Hossan MS, Asgari H, Jin X (2016) Investigating preference heterogeneity in Value of Time (VOT) and Value of Reliability (VOR) estimation for managed lanes. Transportation Res. Part A: Policy Practice 94:638–649.CrossrefGoogle Scholar
  • Jackson WB, Jucker JV (1982) An empirical study of travel time variability and travel choice behavior. Transportation Sci. 16(4):460–475.LinkGoogle Scholar
  • Khani A, Boyles SD (2015) An exact algorithm for the mean–standard deviation shortest path problem. Transportation Res. Part B: Methodological 81:252–266.CrossrefGoogle Scholar
  • Lam TC, Small KA (2001) The value of time and reliability: Measurement from a value pricing experiment. Transportation Res. Part E: Logist. Transportation Rev. 37(2–3):231–251.CrossrefGoogle Scholar
  • Leurent F (1993) Cost versus time equilibrium over a network. Eur. J. Oper. Res. 71(2):205–221.CrossrefGoogle Scholar
  • Li Z, Hensher DA, Rose JM (2010) Willingness to pay for travel time reliability in passenger transport: A review and some new empirical evidence. Transportation Res. Part E: Logist. Transportation Rev. 46(3):384–403.CrossrefGoogle Scholar
  • Li Z, Li G, Xu Z, Chen A (2023) Multiclass bi-criteria traffic assignment without class-specific variables: An alternative formulation and a subgradient projection algorithm. Transportation Res. Part E: Logist. Transportation Rev. 176:103210.CrossrefGoogle Scholar
  • Liu HX, He X, Recker W (2007) Estimation of the time-dependency of values of travel time and its reliability from loop detector data. Transportation Res. Part B: Methodological 41(4):448–461.CrossrefGoogle Scholar
  • Lo HK, Luo X, Siu BW (2006) Degradable transport network: Travel time budget of travelers with heterogeneous risk aversion. Transportation Res. Part B: Methodological 40(9):792–806.CrossrefGoogle Scholar
  • Marcotte P (1998) Reformulations of a bicriterion equilibrium model. Fukushima M, Qi L, eds. Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods (Springer, Boston), 269–291.CrossrefGoogle Scholar
  • Marcotte P, Zhu D (1996) An efficient algorithm for a bicriterion traffic assignment problem. Bianco L, Toth P, eds. Advanced Methods in Transportation Analysis (Springer, Berlin), 63–73.CrossrefGoogle Scholar
  • McFadden D, Train K (2000) Mixed MNL models for discrete response. J. Appl. Econometrics 15(5):447–470.CrossrefGoogle Scholar
  • Mirchandani P, Soroush H (1987) Generalized traffic equilibrium with probabilistic travel times and perceptions. Transportation Sci. 21(3):133–152.LinkGoogle Scholar
  • Nagurney A, Dong J (2002) A multiclass, multicriteria traffic network equilibrium model with elastic demand. Transportation Res. Part B: Methodological 36(5):445–469.CrossrefGoogle Scholar
  • Nie YM (2011) Multi-class percentile user equilibrium with flow-dependent stochasticity. Transportation Res. Part B: Methodological 45(10):1641–1659.CrossrefGoogle Scholar
  • Nie YM, Wu X (2009) Shortest path problem considering on-time arrival probability. Transportation Res. Part B: Methodological 43(6):597–613.CrossrefGoogle Scholar
  • Nikolova E, Stier-Moses NE (2014) A mean-risk model for the traffic assignment problem with stochastic travel times. Oper. Res. 62(2):366–382.LinkGoogle Scholar
  • Nikolova E, Stier-Moses NE (2015) The burden of risk aversion in mean-risk selfish routing. Proc. 16th ACM Conf. Econom. Comput. (Association for Computing Machinery, Portland), 489–506.Google Scholar
  • Ordóñez F, Stier-Moses NE (2010) Wardrop equilibria with risk-averse users. Transportation Sci. 44(1):63–86.LinkGoogle Scholar
  • Ortúzar J, Willumsen LG (2024) Modelling Transport (John Wiley & Sons, Hoboken, NJ).Google Scholar
  • Prakash AA, Seshadri R, Srinivasan KK (2018) A consistent reliability-based user-equilibrium problem with risk-averse users and endogenous travel time correlations: Formulation and solution algorithm. Transportation Res. Part B: Methodological 114:171–198.CrossrefGoogle Scholar
  • Rezaee H, Hickman M (2015) Investigating the distribution of the value of time via multiclass traffic assignment. Transportation Res. Record 2530(1):65–72.CrossrefGoogle Scholar
  • Rockafellar RT, Uryasev S (2000) Optimization of conditional value-at-risk. J. Risk 2(3):21–42.CrossrefGoogle Scholar
  • Sedeño-Noda A, Raith A (2015) A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem. Comput. Oper. Res. 57:83–94.CrossrefGoogle Scholar
  • Shahabi M, Unnikrishnan A, Boyles SD (2013) An outer approximation algorithm for the robust shortest path problem. Transportation Res. Part E: Logist. Transportation Rev. 58:52–66.CrossrefGoogle Scholar
  • Sheffi Y (1985) Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods (Prentice Hall, Englewood cliffs, NJ).Google Scholar
  • Slavin H, Brandon J, Lam J, Sundaram S (2014) A brief note on toll road assignment methods. Technical report, Caliper Corporation, Newton, MA.Google Scholar
  • Small KA, Winston C, Yan J (2005) Uncovering the distribution of motorists’ preferences for travel time and reliability. Econometrica 73(4):1367–1382.CrossrefGoogle Scholar
  • van Lint J, van Zuylen HJ, Tu H (2008) Travel time unreliability on freeways: Why measures based on variance tell only half the story. Transportation Res. Part A: Policy Practice 42(1):258–277.CrossrefGoogle Scholar
  • Wang JY, Ehrgott M (2018) A three-objective user equilibrium model: Time surplus maximisation under uncertainty. J. Multi-Criteria Decision Anal. 25(1–2):3–15.CrossrefGoogle Scholar
  • Wardrop JG (1952) Road paper. Some theoretical aspects of road traffic research. Proc. Inst. Civil Engineers 1(3):325–362.CrossrefGoogle Scholar
  • Wu X (2015) Study on mean-standard deviation shortest path problem in stochastic and time-dependent networks: A stochastic dominance based approach. Transportation Res. Part B: Methodological 80:275–290.CrossrefGoogle Scholar
  • Xie C, Wu X, Boyles S (2019) Traffic equilibrium with a continuously distributed bound on travel weights: The rise of range anxiety and mental account. Ann. Oper. Res. 273(1):279–310.CrossrefGoogle Scholar
  • Xie J, Wang Q, Nie YM (2021) An efficient algorithm for continuous bi-criteria traffic assignment. Working paper, School of Transportation and Logistics, Southwest Jiaotong University, Chengdu, China.Google Scholar
  • Xie C, Wang TG, Pu X, Karoonsoontawong A (2017) Path-constrained traffic assignment: Modeling and computing network impacts of stochastic range anxiety. Transportation Res. Part B: Methodological 103:136–157.CrossrefGoogle Scholar
  • Xing T, Zhou X (2011) Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach. Transportation Res. Part B: Methodological 45(10):1660–1679.CrossrefGoogle Scholar
  • Xu Z, Chen A, Liu X (2023) Time and toll trade-off with heterogeneous users: A continuous time surplus maximization bi-objective user equilibrium model. Transportation Res. Part B: Methodological 173:31–58.CrossrefGoogle Scholar
  • Xu Z, Xie J, Liu X, Nie YM (2022) Hyperbush algorithm for strategy-based equilibrium traffic assignment problems. Transportation Sci. 56(4):877–903.LinkGoogle Scholar
  • Xu Z, Chen A, Li G, Li Z, Liu X (2024a) Elastic-demand bi-criteria traffic assignment under the continuously distributed value of time: A two-stage gradient projection algorithm with graphical interpretations. Transportation Res. Part E: Logist. Transportation Rev. 183:103425.CrossrefGoogle Scholar
  • Xu Z, Peng Y, Li G, Chen A, Liu X (2024b) Range-constrained traffic assignment for electric vehicles under heterogeneous range anxiety. Transportation Res. Part C: Emerging Tech. 158:104419.CrossrefGoogle Scholar
  • Zang Z, Xu X, Qu K, Chen R, Chen A (2022) Travel time reliability in transportation networks: A review of methodological developments. Transportation Res. Part C: Emerging Tech. 143:103866.CrossrefGoogle Scholar
  • Zangwill WI (1969) Nonlinear Programming: A Unified Approach, Prentice-Hall International Series in Management, vol. 52 (Prentice-Hall, Englewood Cliffs, NJ).Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.