Cooling schedules for optimal annealing
Mathematics of Operations Research
A faster strongly polynomial minimum cost flow algorithm
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
Shortest paths algorithms: theory and experimental evaluation
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Simulated annealing and combinatorial optimization
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Algorithms for Network Programming
Algorithms for Network Programming
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Evacuation planning: a capacity constrained routing approach
ISI'03 Proceedings of the 1st NSF/NIJ conference on Intelligence and security informatics
Vehicle Priority Selection Algorithm for Evacuation Planning
ICCSA '08 Proceeding sof the international conference on Computational Science and Its Applications, Part I
IEEE Transactions on Intelligent Transportation Systems
An evacuation planner algorithm in flat time graphs
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
A multi-valued discrete particle swarm optimization for the evacuation vehicle routing problem
ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I
Problem Decomposition for Evacuation Simulation Using Network Flow
DS-RT '12 Proceedings of the 2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part III
An agent based model for evacuation traffic management
Proceedings of the Winter Simulation Conference
Computers and Industrial Engineering
Understanding population displacements on location-based call records using road data
Proceedings of the Second ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems
| Hi-index | 0.00 |
Contraflow, or lane reversal, is a way of increasing outbound capacity of a real network by reversing the direction of inbound roads during evacuations. The contraflow is considered a potential remedy to solve congestions during evacuations in context of homeland security and natural disasters (e.g., hurricanes). Currently available contraflow algorithms only tackle a single-source and multiple-destinations situation. These approaches cannot handle a multiple-sources problem which is harder due to conflicts across the optimal paths from different sources.We formally define the evacuation situations using graph and flow theory and show the NP-completeness of the contraflow problem. We propose two capacity-aware global contraflow heuristics that produce contraflow configuration in the presence of conflicts among routes preferred by different source nodes. We evaluate proposed heuristics experimentally using synthetic networks as well as real world datasets. In addition, we provide algebraic cost model. Experimental results show that our contraflow heuristics can reduce evacuation time by 30% or more.