Due to different disasters, natural or men made, world is facing the problem of massive damage of life and property. To save the life of maximum number of evacuees, an efficient evacuation planning is essential. Prioritization is the process of deciding the relative importance or urgency of things or objects. It helps to focus on the objectives and goals in an efficient way. Prioritized flow problems are applicable for large scale disaster management problems. Prioritization of evacuees on the basis of case sensitive or risk of life is one of the best and reliable way of evacuation planning. In this paper, we introduce the maximum evacuation planning problem with commodity (evacuee) priority ordering and develop multi-commodity flow model for priority based evacuation planning problem. We present polynomial time algorithms to solve the problem in static as well as dynamic flow models.
Submitted to OR Spectrum, 2020
View Commodity Prioritized Maximum Dynamic Multi-Commodity Flow Problem