SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Modelling Distributed Real-Time Route Guidance Strategies in a Traffic Network that Exhibits the Braess Paradox
2 references·4 citing·23 second hop
Modelling Distributed Real-Time Route Guidance Strategies in a Traffic Network that Exhibits the Braess Paradox (1991)Modelling Distributed Real-Time Route Gui…Braess's paradox of traffic flow (1970)Braess's paradox of traffic f…Über ein Paradoxon aus der Verkehrsplanung (1968)Über ein Paradoxon aus der Ve…A microsimulation based analysis of the price of anarchy in traffic routing: The enhanced Braess network case (2021)A microsimulation based analy…Decentralized Route Guidance Architectures with User Preferences in Urban Transportation Networks (2014)Decentralized Route Guidance …Traffic Networks: Dynamic Traffic Routing, Assignment, and Assessment (2011)Traffic Networks: Dynamic Tra…Decentralized algorithms for multiple path routing in urban transportation networks (2007)Decentralized algorithms for …A BEHAVIORAL MODEL OF RATIONAL CHOICE (1955)Models of Man--Social and Rational (1958)Urban transportation networks: Equilibrium analysis with mathematical programming methods (1986)Disaggregate route choice models based on driver learning patterns and network experience (2011)Forecasting Travel in Urban America (2023)Studies in the Economics of Transportation. (1956)Studies in the Economics of Transportation. (1957)Braess' paradox: Some new insights (1997)An Iterative Algorithm to Determine the Dynamic User Equilibrium in a Traffic Simulation Model (1998)Discrete Choice Analysis: Theory and Application to Travel Demand. (1987)How bad is selfish routing? (2002)System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion (2005)SALA: A Self-Adaptive Learning Algorithm—Towards Efficient Dynamic Route Guidance in Urban Traffic Networks (2018)Optimal Routing of Traffic Flows with Length Restrictions in Networks with Congestion (2000)The genetical evolution of social behaviour. I (1964)A Theory of Fairness, Competition, and Cooperation (1999)Five Rules for the Evolution of Cooperation (2006)Bridging the user equilibrium and the system optimum in static traffic assignment: how the cooperation among drivers can solve the congestion problem in city networks (2021)AlphaRoute: Large-Scale Coordinated Route Planning via Monte Carlo Tree Search (2023)Nash Equilibrium and Stackelberg Approach for Traffic Flow Optimization in Road Transportation Networks—A Case Study of Warsaw (2023)The Economics of Urban Transportation (2007)Trafficking Networks and the Mexican Drug War (2015)Selfish Routing and the Price of Anarchy (2016)
this work references cited by second hop

References

  • 1968Über ein Paradoxon aus der Verkehrsplanung975 cited
  • 1970Braess's paradox of traffic flow210 cited

Cited by

  • 2021A microsimulation based analysis of the price of anarchy in traffic routing: The enhanced Braess network case15 cited
  • 2014Decentralized Route Guidance Architectures with User Preferences in Urban Transportation Networks14 cited
  • 2011Traffic Networks: Dynamic Traffic Routing, Assignment, and Assessment13 cited
  • 2007Decentralized algorithms for multiple path routing in urban transportation networks4 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work