Model and Solution for Non-conservation Flow Evacuation Planning Problem
DOI:
https://doi.org/10.3126/nmsr.v36i1-2.29966Keywords:
Network Flow, Flow Conservation, Preflow-Push Algorithm, Evacuation Planning ProblemAbstract
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
Downloads
Published
How to Cite
Issue
Section
License
Copyright © The Nepali Mathematical Sciences Report