Earliest Arrival Evacuation Planning: Two-Terminal Case

Authors

  • Ram Uday Sah Ratna Rajya Laxmi Campus (TU)
  • Shree Ram Khadka Central Department of Mathematics (TU)

DOI:

https://doi.org/10.3126/jacem.v2i0.16104

Keywords:

Evacuation problem, Flow over time, Earliest Arrival flow

Abstract

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

Download data is not yet available.
Abstract
766
PDF
697

Downloads

Published

2016-11-29

How to Cite

Sah, R. U., & Khadka, S. R. (2016). Earliest Arrival Evacuation Planning: Two-Terminal Case. Journal of Advanced College of Engineering and Management, 2, 57–62. https://doi.org/10.3126/jacem.v2i0.16104

Issue

Vol. 2 (2016)

Section

Articles

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.