A Strategic Markovian Traffic Equilibrium Model for Capacitated Networks

References

• Akamatsu T (1996) Cyclic flows, Markov process and stochastic traffic assignment. Transportation Res. Part B: Methodological 30(5):369–386.Crossref, Google Scholar
• Andreatta G , Romeo L (1988) Stochastic shortest paths with recourse. Networks 18(3):193–204.Crossref, Google Scholar
• Arıkan U , Ahipasaoglu SD (2017) On the existence and convergence of the Markovian traffic equilibrium. Technical report, Singapore University of Technology and Design, Singapore.Google Scholar
• Baillon JB , Cominetti R (2008) Markovian traffic equilibrium. Math. Programming 111(1-2):33–56.Crossref, Google Scholar
• Beckmann M , McGuire CB , Winsten CB (1956) Studies in the Economics of Transportation (Yale University Press, New Haven, CT).Google Scholar
• Boyce D , Janson B , Eash R (1981) The effect on equilibrium trip assignment of different link congestion functions. Transportation Res. Part A: General 15(3):223–232.Crossref, Google Scholar
• Boyles SD , Tang S , Unnikrishnan A (2015) Parking search equilibrium on a network. Transportation Res. Part B: Methodological 81:390–409.Crossref, Google Scholar
• Dafermos S (1980) Traffic equilibrium and variational inequalities. Transportation Sci. 14(1):42–54.Link, Google Scholar
• Daganzo CF , Sheffi Y (1977) On stochastic models of traffic assignment. Transportation Sci. 11(3):253–274.Link, Google Scholar
• De Cea J , Fernández E (1993) Transit assignment for congested public transport systems: An equilibrium model. Transportation Sci. 27(2):133–147.Link, Google Scholar
• Dial RB (1971) A probabilistic multipath traffic assignment model which obviates path enumeration. Transportation Res. 5(2):83–111.Crossref, Google 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.Crossref, 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:70–80.Crossref, Google Scholar
• Guélat J , Florian M , Crainic TG (1990) A multimode multiproduct network assignment model for strategic planning of freight flows. Transportation Sci. 24(1):25–39.Link, Google Scholar
• Khani A (2013) Models and solution algorithms for transit and intermodal passenger assignment (development of fast-trips model). PhD thesis, The University of Arizona, Tucson.Google Scholar
• Kurauchi F , Bell MG , Schmöcker JD (2003) Capacity constrained transit assignment with common lines. J. Math. Model. Algorithms 2(4):309–327.Crossref, Google Scholar
• Larsson T , Patriksson M (1995) An augmented Lagrangian dual algorithm for link capacity side constrained traffic assignment problems. Transportation Res. Part B: Methodological 29(6):433–455.Crossref, Google Scholar
• Larsson T , Patriksson M (1999) Side constrained traffic equilibrium models, analysis, computation and applications. Transportation Res. Part B: Methodological 33(4):233–264.Crossref, Google Scholar
• Marcotte P , Nguyen S , Schoeb A (2004) A strategic flow model of traffic assignment in static capacitated networks. Oper. Res. 52(2):191–212.Link, Google Scholar
• Nie Y , Zhang H , Lee DH (2004) Models and algorithms for the traffic assignment problem with link capacity constraints. Transportation Res. Part B: Methodological 38(4):285–312.Crossref, Google Scholar
• Patriksson M (2004) Algorithms for computing traffic equilibria. Networks Spatial Econom. 4(1):23–38.Crossref, Google Scholar
• Polychronopoulos GH , Tsitsiklis JN (1996) Stochastic shortest path problems with recourse. Networks 27(2):133–143.Crossref, Google Scholar
• Rambha T , Boyles SD , Unnikrishnan A , Stone P (2018) Marginal cost pricing for system optimal traffic assignment with recourse under supply-side uncertainty. Transportation Res. Part B: Methodological 110:104–121.Crossref, Google Scholar
• Sheffi Y (1985) Urban Transportation Networks , vol. 6 (Prentice-Hall, Englewood Cliffs, NJ).Google Scholar
• Spiess H , Florian M (1989) Optimal strategies: A new assignment model for transit networks. Transportation Res. Part B: Methodological 23(2):83–102.Crossref, Google Scholar
• Unnikrishnan A , Waller ST (2009) User equilibrium with recourse. Networks Spatial Econom. 9(4):575–593.Crossref, Google Scholar
• Wardrop JG (1952) Some Theoretical Aspects of Road Traffic Research (Institution of Civil Engineers, London).Crossref, Google Scholar
• Wie BW , Tobin RL , Carey M (2002) The existence, uniqueness and computation of an arc-based dynamic network user equilibrium formulation. Transportation Res. Part B: Methodological 36(10):897–918.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