Strategic evacuation planning with pedestrian guidance and bus routing: a mixed integer programming model and heuristic solution

Summary This paper presents a mathematical model to plan emergencies in a densely populated urban zone where a certain numbers of pedestrians depend on transit for evacuation. The proposed model features an integrated operational framework, which simultaneously guides evacuees through urban streets...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of advanced transportation 2016-11, Vol.50 (7), p.1314-1335
Hauptverfasser: Heydar, Mojtaba, Yu, Jie, Liu, Yue, Petering, Matthew E. H.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Summary This paper presents a mathematical model to plan emergencies in a densely populated urban zone where a certain numbers of pedestrians depend on transit for evacuation. The proposed model features an integrated operational framework, which simultaneously guides evacuees through urban streets and crosswalks (referred to as “the pedestrian network”) to designated pickup points (e.g., bus stops), and routes a fleet of buses at different depots to those pick‐up points and transports evacuees to their destinations or safe places. In this level, the buses are routed through the so‐called “vehicular network.” An integrated mixed integer linear program that can effectively take into account the interactions between the aforementioned two networks is formulated to find the maximal evacuation efficiency in two networks. Because the large instances of the proposed model are mathematically difficult to solve to optimality, a two‐stage heuristic is developed to solve larger instances of the model. Results from hundreds of numerical examples analysis indicate that proposed heuristic works well in providing (near) optimal or feasibly good solutions for medium‐scale to large‐scale instances that may arise in real transit‐based evacuation situations in a much shorter amount of computational time compared with cplex (can find optimal/feasible solutions for only five instances within 3 hours of running). Copyright © 2016 John Wiley & Sons, Ltd.
ISSN:0197-6729
2042-3195
DOI:10.1002/atr.1403