Lexicographic Earliest Arrival Contraflow Evacuation Problem on UPL-TTSP Network

Authors

  • Shree Ram Khadka Central Department of Mathematics, Tribhuvan University, Kathmandu, Nepal
  • Phanindra Prasad Bhandari Central Department of Mathematics, Tribhuvan University, Kathmandu, Nepal

DOI:

https://doi.org/10.3126/ijorn.v9i1.51842

Keywords:

Network contraflow, Capacitated vertices, Evacuation planning problem, Disaster management

Abstract

An evacuation plan proposes a way out for maximum utilization of an existing transportation system so that the safest tour and most efficient evacuation time of all expected evacuees could be ensured. This paper studies the auto-based earliest arrival contraflow problem modeled on network with capacitated intermediate vertices. The vertices serve as trans-shipment vertices as well as temporary shelters of given priority order. It also proposes an efficient solution procedure to the problem for the uniform path length two terminal series parallel (UPL-TTSP) network.  

Downloads

Download data is not yet available.
Abstract
30
PDF
36

Downloads

Published

2020-12-31

How to Cite

Khadka, S. R., & Bhandari, P. P. (2020). Lexicographic Earliest Arrival Contraflow Evacuation Problem on UPL-TTSP Network. International Journal of Operational Research/Nepal, 9(1), 1–7. https://doi.org/10.3126/ijorn.v9i1.51842

Issue

Vol. 9 No. 1 (2020)

Section

Articles

License

Copyright (c) 2020 International Journal of Operational Research/Nepal

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

CC BY: This license allows reusers to distribute, remix, adapt, and build upon the material in any medium or format, so long as attribution is given to the creator. The license allows for commercial use.