Towards System Optimum: Finding Optimal Routing Strategies in Time-Dependent Networks for Large-Scale Evacuation Problems
- 1 January 2009
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 532-539
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results2005
- Evaluation of Emergency Evacuation Strategies for Downtown Event Traffic Using a Dynamic Network ModelTransportation Research Record: Journal of the Transportation Research Board, 2005
- Emergency Evacuation Planning with Microscopic Traffic SimulationTransportation Research Record: Journal of the Transportation Research Board, 2004
- Foundations of Dynamic Traffic Assignment: The Past, the Present and the FutureNetworks and Spatial Economics, 2001
- Comparison of traffic assignments in evacuation modelingIEEE Transactions on Engineering Management, 1998
- An Iterative Algorithm to Determine the Dynamic User Equilibrium in a Traffic Simulation ModelInternational Journal of Modern Physics C, 1998
- System optimal and user equilibrium time-dependent traffic assignment in congested networksAnnals of Operations Research, 1995
- Non-Cooperative GamesAnnals of Mathematics, 1951