Network design to anticipate selfish evacuation routing

DOI10.1007/s13675-015-0057-4zbMath1349.90093OpenAlexW2261634091MaRDI QIDQ339932

K. Seekircher, Alf Kimms

Publication date: 11 November 2016

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-015-0057-4

zbMATH Keywords

network designtraffic flowevacuationselfish routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Related Items

Bi-objective safe and resilient urban evacuation planning

Cites Work

• A note on two problems in connexion with graphs
• Optimization and simulation of traffic flows in the case of evacuating urban areas
• A simulation model for emergency evacuation
• System optimal and user equilibrium time-dependent traffic assignment in congested networks
• How much can taxes help selfish routing?
• On the severity of Braess's paradox: designing networks for selfish users is hard
• How bad is selfish routing?
• Agent-based modelling and simulation of urban evacuation: relative effectiveness of simultaneous and staged evacuation strategies
• System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
• Mathematical Foundations of Computer Science 2003
• Über ein Paradoxon aus der Verkehrsplanung