Generalized Contraflow for Evacuation Planning Problem

Authors

  • Urmila Pyakurel Tribhuvan University, Kathmandu, Nepal

DOI:

https://doi.org/10.3126/jnms.v1i1.42173

Keywords:

Evacuation planning, Lossy network, Generalized contraflow, Approximation Scheme

Abstract

The research in evacuation planning has been very much motivated due to the rapidly increased number of disasters world wide. It supports to remove the evacuees from dangerous areas to safe areas. Contraflow reconfiguration during evacuation make traffic smooth by reversing the required road directions from dangerous areas to safe areas that improve both flow and speed significantly. On lossy network, the generalized maximum dynamic contraflow and generalized earliest arrival contraflow problems have been solved efficiently with pseudo-polynomial time.

This paper focuses in analytical solutions on generalized contraflow for evacuation planning problem. The problems are considered on two terminal lossy networks. We solve the generalized maximum static contraflow problem in pseudo-polynomial time and compute its approximation solution in polynomial time. Moreover, we present a fully polynomial time approximation scheme (FPTAS) to compute an approximate generalized maximum dynamic contraflow solution.

Downloads

Download data is not yet available.
Abstract
37
PDF
32

Author Biography

Urmila Pyakurel, Tribhuvan University, Kathmandu, Nepal

Central Department of Mathematics

Downloads

Published

2018-02-11

How to Cite

Pyakurel, U. (2018). Generalized Contraflow for Evacuation Planning Problem. Journal of Nepal Mathematical Society, 1(1), 38–49. https://doi.org/10.3126/jnms.v1i1.42173

Issue

Section

Articles