Network design to anticipate selfish evacuation routing
From MaRDI portal
Publication:339932
DOI10.1007/S13675-015-0057-4zbMATH Open1349.90093OpenAlexW2261634091MaRDI QIDQ339932FDOQ339932
Authors: K. Seekircher, A. 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
Recommendations
Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)
Cites Work
- A note on two problems in connexion with graphs
- 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?
- Über ein Paradoxon aus der Verkehrsplanung
- Mathematical Foundations of Computer Science 2003
- System optimal and user equilibrium time-dependent traffic assignment in congested networks
- System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
- A simulation model for emergency evacuation
- Agent-based modelling and simulation of urban evacuation: relative effectiveness of simultaneous and staged evacuation strategies
- Optimization and simulation of traffic flows in the case of evacuating urban areas
Cited In (3)
This page was built for publication: Network design to anticipate selfish evacuation routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339932)