Earliest Arrival Evacuation Planning: Two-Terminal Case
DOI:
https://doi.org/10.3126/jacem.v2i0.16104Keywords:
Evacuation problem, Flow over time, Earliest Arrival flowAbstract
Evacuation planning problem can be considered as a dynamic flow problem on the dynamic network. In a dangerous situation, as many individuals as possible should be rescued from a dangerous zone to a safety zone as quickly and efficiently as possible. The earliest arrival flow problem is to send a maximal amount of dynamic flow reaching the safety zone sink not only for the given time horizon, but also for any earlier moment of the time horizon. In this paper we discuss the optimization formulation of the earliest arrival evacuation planning problem with efficient solution procedure.
Journal of Advanced College of Engineering and Management, Vol. 2, 2016, page: 57-62
Downloads
Downloads
Published
How to Cite
Issue
Section
License
JACEM reserves the copyright for the published papers. Author will have right to use content of the published paper in part or in full for their own work.