Models and Algorithms on Contraflow Evacuation Planning Network Problems
Abstrak
After different disasters the evacuation planning support to remove the residence from accidental areas to safe destinations. Contraflow solutions minimize the congestion and make the traffic smooth during evacuation by reversing the required road directions from risk areas to safe places. Mathematical models and solution approaches appear for the maximum, the quickest and the earliest arrival contraflow problems in the literature. The research on contraflow reconfiguration has been motivated from tremendous applications improving both throughput and speed. This note briefly revisits the static and dynamic contraflow problems previously investigated. We also develop models and algorithms that obtain optimal solutions to the lexicographically maximum and the earliest arrival contraflow problems.
Topik & Kata Kunci
Penulis (2)
Urmila Pyakurel
T. N. Dhamala
Akses Cepat
- Tahun Terbit
- 2016
- Bahasa
- en
- Total Sitasi
- 55×
- Sumber Database
- Semantic Scholar
- DOI
- 10.21307/IJOR-2015-005
- Akses
- Open Access ✓