Abstract
Models and Algorithms on Contraflow Evacuation Planning Network Problems
Highlights
Given an evacuation network, the contraflow problem is a challenging issue of finding a network reconfiguration with ideal lane directions satisfying the given constraints that optimizes the given objective
Heuristics, optimization and simulation techniques taking into account of macroscopic and microscopic behavioral characteristics deal with contraflow for this transportation network, an acceptable contraflow solution even approximately is a lacking due to very high computational costs
DYNAMIC CONTRAFLOW PROBLEMS We introduce the lexicographically maximum dynamic contraflow (LMDCF) and the earliest arrival contraflow (EACF)
Summary
The contraflow problem is a challenging issue of finding a network reconfiguration with ideal lane directions satisfying the given constraints that optimizes the given objective. The transit-based models are initiated with vehicle routine problem whereas the integrated strategy contains non-contraflow to shorten the strategy setup time, full-lane contraflow to minimize the evacuation network capacity and bus contraflow to realize the transit cycle operation. Kim et al (2008) present a greedy heuristic that finds high quality solutions and a bottleneck relief heuristic for large scale evacuations where the evacuation time has been improved by at least 40 percent with at most 30 percent of the total arc reversals. They showed that the problem of minimizing the evacuation time
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
