Distributionally Robust Markovian Traffic Equilibrium

References

• Ahipaşaoğlu SD, Arıkan U, Natarajan K (2016) On the flexibility of using marginal distribution choice models in traffic equilibrium. Transportation Res. Part B: Methodological 91(September):130–158.Crossref, Google Scholar
• Ahipaşaoğlu SD, Meskarian R, Magnanti TL, Natarajan K (2015) Beyond normality: A cross moment-stochastic user equilibrium model. Transportation Res. Part B: Methodological 81(2):333–354.Crossref, Google Scholar
• Akamatsu T (1996) Cyclic flows, Markov process and stochastic traffic assignment. Transportation Res. Part B: Methodological 30(5):369–386.Crossref, Google Scholar
• Akamatsu T (1997) Decomposition of path choice entropy in general transport networks. Transportation Sci. 31(4):349–362.Link, Google Scholar
• Atamturk A, Zhang M (2007) Two-stage robust network flow and design under demand uncertainty. Oper. Res. 55(4):662–673.Link, Google Scholar
• Baillon JB, Cominetti R (2008) Markovian traffic equilibrium. Math. Programming 111(1/2):33–56.Google Scholar
• Bekhor S, Ben-Akiva ME, Ramming MS (2006) Evaluation of choice set generation algorithms for route choice models. Ann. Oper. Res. 144(1):235–247.Crossref, Google Scholar
• Bell MG (1995) Alternatives to Dial’s logit assignment algorithm. Transportation Res. Part B: Methodological 29(4):287–295.Crossref, Google Scholar
• Ben-Akiva M, Bierlaire M (1999) Discrete choice methods and their applications to short term travel decisions. Hall RW, ed. Handbook of Transportation Science (Wolters Kluwer, Alphen aan den Rijn, Netherlands), 5–33.Crossref, Google Scholar
• Boyd S, Vandenberghe L (2004) Convex Optimization (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Carlsson JG, Behroozi M, Mihic K (2018) Wasserstein distance and the distributionally robust TSP. Oper. Res. 66(6):1603–1624.Google Scholar
• Carlsson JG, Delage E (2013) Robust partitioning for stochastic multi-vehicle routing. Oper. Res. 61(3):727–744.Link, Google Scholar
• Castillo E, Calviño A, Nogal M, Lo HK (2014) On the probabilistic and physical consistency of traffic random variables and models. Comput.-Aided Civil Infrastructure Engrg. 29(7):496–517.Crossref, Google Scholar
• Castillo E, Jiménez P, Menéndez JM, Nogal M (2013) A Bayesian method for estimating traffic flows based on plate scanning. Transportation 40(1):173–201.Crossref, Google Scholar
• Clark CE (1961) The greatest of a finite set of random variables. Oper. Res. 9(2):145–162.Link, Google Scholar
• Daganzo CF, Sheffi Y (1977) On stochastic models of traffic assignment. Transportation Sci. 11(3):253–274.Link, Google Scholar
• Dial R (1971) A probabilistic multipath traffic assignment model which obviates path enumeration. Transportation Res. 5(2):83–111.Crossref, Google Scholar
• Erera AL, Morales JC, Savelsbergh M (2009) Robust optimization for empty repositioning problems. Oper. Res. 57(2):468–483.Link, Google Scholar
• Fosgerau M, Bierlaire M (2009) Discrete choice models with multiplicative error terms. Transportation Res. Part B: Methodological 43(5):494–505.Crossref, Google Scholar
• Fosgerau M, Fukuda D (2012) Valuing travel time variability: Characteristics of the travel time distribution on an urban road. Transportation Res. Part C: Emerging Tech. 24(October):83–101.Google Scholar
• Fosgerau M, Frejinger E, Karlstrom A (2013) A link based network route choice model with unrestricted choice set. Transportation Res. Part B: Methodological 56(October):70–80.Crossref, Google Scholar
• Frejinger E, Bierlaire M, Ben-Akiva M (2009) Sampling of alternatives for route choice modeling. Transportation Res. Part B: Methodological 43(10):984–994.Crossref, Google Scholar
• Gould MD (1989) Considering individual cognitive ability in the provision of usable navigation assistance. Conf. Record Papers Presented First Vehicle Navigation and Information Systems Conf. (Institute of Electrical and Electronics Engineers, Piscataway, NJ), 443–447.Google Scholar
• Kemeny JG, Snell JL (1960) Finite Markov Chains, vol. 356 (van Nostrand, Princeton, NJ).Google Scholar
• Kiusalaas J (2013) Numerical Methods in Engineering with Python 3 (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Kuipers B (1978) Modeling spatial knowledge. Cognitive Sci. 2(2):129–153.Crossref, Google Scholar
• Lee DH, Meng Q, Deng W (2009) Origin-based partial linearization method for the stochastic user equilibrium traffic assignment problem. J. Transportation Engrg. 136(1):52–60.Crossref, Google Scholar
• Maher M (1992) SAM—A stochastic assignment model. Mathematics in Transport Planning and Control, Institute of Mathematics and Its Applications Conference Series, vol. 38 (Clarendon Press, Oxford, UK), 121–32.Google Scholar
• Maher M (1998) Algorithms for logit-based stochastic user equilibrium assignment. Transportation Res. Part B: Methodological 32(8):539–549.Crossref, Google Scholar
• Maher M, Hughes P (1997) A probit-based stochastic user equilibrium assignment model. Transportation Res. Part B: Methodological 31(4):341–355.Crossref, Google Scholar
• Mai T, Fosgerau M, Frejinger E (2015) A nested recursive logit model for route choice analysis. Transportation Res. Part B: Methodological 75:100–112.Crossref, Google Scholar
• Mark DM, McGranaghan M (1986) Effective provision of navigation assistance to drivers: A cognitive science approach. Proc. Auto Carto London, vol. 2 (Auto Carto London Ltd., London), 399–408.Google Scholar
• Mishra VK, Natarajan K, Padmanabhan D, Teo CP, Li X (2014) On theoretical and empirical aspects of marginal distribution choice models. Management Sci. 60(6):1511–1531.Link, Google Scholar
• Ordóñez F, Stier-Moses NE (2010) Wardrop equilibria with risk-averse users. Transportation Sci. 44(1):63–86.Link, Google Scholar
• Polus A (1979) A study of travel time and reliability on arterial routes. Transportation 8(2):141–151.Crossref, Google Scholar
• Powell WB, Sheffi Y (1982) The convergence of equilibrium algorithms with predetermined step sizes. Transportation Sci. 16(1):45–55.Link, Google Scholar
• Ridders C (1979) A new algorithm for computing a single root of a real continuous function. IEEE Trans. Circuits Systems 26(11):979–980.Crossref, Google Scholar
• Saad Y, Van Der Vorst HA (2001) Iterative solution of linear systems in the 20th century. Numerical Analysis: Historical Developments in the 20th Century (Elsevier, Amsterdam), 175–207.Google Scholar
• Scarf H (1958) A min-max solution of an inventory problem. Studies in the Mathematical Theory of Inventory and Production (Stanford University Press, Stanford, CA), 201–209.Google Scholar
• Sheffi Y (1985) Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods (Prentice-Hall, Upper Saddle River, NJ).Google Scholar
• Si BF, Zhong M, Zhang HZ, Jin WL (2010) An improved Dial’s algorithm for logit-based traffic assignment within a directed acyclic network. Transportation Planning Tech. 33(2):123–137.Crossref, Google Scholar
• Sklar A (1959) Fonctions de répartition ă n dimensions et leurs marges. Publications de l’Institut Statistique de l’Université de Paris 8:229–231.Google Scholar
• Stern E, Leiser D (1988) Levels of spatial knowledge and urban travel modeling. Geographical Anal. 20(2):140–155.Crossref, Google Scholar
• Wardrop J (1952) Some theoretical aspects of road traffic research. Proc. Institution Civil Engineers 2(1):325–378.Crossref, Google Scholar
• Watling D (2006) User equilibrium traffic network assignment with stochastic travel times and late arrival penalty. Eur. J. Oper. Res. 175(3):1539–1556.Crossref, Google Scholar
• Wong S (1999) On the convergence of Bell’s logit assignment formulation. Transportation Res. Part B: Methodological 33(8):609–616.Crossref, Google Scholar