Model and Solution for Non-conservation Flow Evacuation Planning Problem

  • Shree Ram Khadka Tribhuvan University, Kathmandu, Nepal
  • Phanindra Prasad Bhandari Tribhuvan University, Kathmandu, Nepal
Keywords: Network Flow, Flow Conservation, Preflow-Push Algorithm, Evacuation Planning Problem

Abstract

Efficient evacuation plan with which a maximum evacuees can be sent as soon as possible from the disastrous place to the safe place is an important notion during the response phase of the disaster management. Such a plan in terms of optimization models has been extensively studied in a various scenarios, see [3]. The optimization models have been based on the flow conservation constraint which permits an evacuee to be taken out of the disastrous place only if it can be sent into the safe place. However, the evacuation plan model with no flow conservation can keep several evacuees in the relatively safe places besides the evacuees which could be sent into the safe place.

In this paper, we describe an optimization model for the evacuation plan based on the non-conservation flow constraint with an efficient solution procedure which keeps a maximum evacuees on the prioritized intermediate places besides a maximum evacuees into the specified safe place.

Downloads

Download data is not yet available.
Abstract
50
PDF
21

Author Biographies

Shree Ram Khadka, Tribhuvan University, Kathmandu, Nepal

Central Department of Mathematics

Phanindra Prasad Bhandari, Tribhuvan University, Kathmandu, Nepal

Central Department of Mathematics

Published
2019-12-31
How to Cite
Khadka, S., & Bhandari, P. (2019). Model and Solution for Non-conservation Flow Evacuation Planning Problem. The Nepali Mathematical Sciences Report, 36(1-2), 11-16. https://doi.org/10.3126/nmsr.v36i1-2.29966
Section
Articles