Dynamic network flow location models and algorithms for quickest evacuation planning (original) (raw)
2017, Journal of Industrial & Management Optimization
Dynamic network flow problems have wide applications in evacuation planning. From a given subset of arcs in a directed network, choosing the suitable arcs for facility location is very important in the optimization of flows in emergency cases. Because of the decrease in the capacity of an arc by placing a facility in it, there may be a reduction in the maximum flow or increase in the quickest time. In this work, we consider a problem of identifying the optimal facility locations so that the increase in the quickest time is minimum. Introducing the quickest FlowLoc problem, we give strongly polynomial time algorithms to solve the single facility case. Realizing NP-hardness of the multi-facility case, we develop a mixed integer programming formulation of it and give a polynomial time heuristic for its solution. Because of the growing concerns of arc reversals in evacuation planning, we introduce quickest Con-traFlowLoc problem and present exact algorithms to solve single-facility case and a heuristic to solve the multi-facility case, both of which have polynomial time complexity. The solutions thus obtained here are practically important, particularly in evacuation planning, to systematize traffic flow with facility allocation minimizing evacuation time.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.