Towards system optimum: finding optimal routing strategies in time-dependent networks for large-scale evacuation problems

Authors:
Gregor Lämmel;Gunnar Flötteröd
Affiliations:
Berlin Institute of Technology, TU Berlin, Transport Systems Planning and Transport Telematics, Berlin, Germany;Ecole Polytechnique Fédérale de Lausanne, Transport and Mobility Laboratory, Lausanne, Switzerland
Venue:
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Year:
2009

Citing 2
Cited 0

Multi-Agent Systems: An Introduction to Distributed Artificial Intelligence

Multi-Agent Systems: An Introduction to Distributed Artificial Intelligence
Capacity constrained routing algorithms for evacuation planning: a summary of results

SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases

Quantified Score

Hi-index	0.01

Visualization

Abstract

Evacuation planning crucially depends on good routing strategies. This article compares two different routing strategies in a multi-agent simulation of a large real-world evacuation scenario. The first approach approximates a Nash equilibrium, where every evacuee adopts an individually optimal routing strategy regardless of what this solution imposes on others. The second approach approximately minimizes the total travel time in the system, which requires to enforce cooperative behavior of the evacuees. Both approaches are analyzed in terms of the global evacuation dynamics and on a detailed geographic level.