Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Polynomial time algorithms for some evacuation problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for Network Programming
Algorithms for Network Programming
A Computational Study of Cost Reoptimization for Min-Cost Flow Problems
INFORMS Journal on Computing
Evacuation route planning: scalable heuristics
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Evacuation planning: a capacity constrained routing approach
ISI'03 Proceedings of the 1st NSF/NIJ conference on Intelligence and security informatics
Capacity constrained routing algorithms for evacuation planning: a summary of results
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
| Hi-index | 0.00 |
Given a transportation network with capacity constraints, the initial occupancies and the destination nodes, evacuation route planning generates a set of evacuation routes and a schedule for the movement of people and vehicles along these routes, such that the evacuation is completed in the shortest possible time. This is a critical step in disaster emergency management and homeland defense preparation. In order to avoid the large storage and calculation costs brought by the time-expended-graph for transforming dynamic network flow problem to static network flow problem, the heuristic algorithm of the Capacity Constrained Route Planner (CCRP) is researched. One defect of the original CCRP algorithm is studied carefully and the new algorithm with longer route preferential is proposed to improve it. The result of the experiment shows the feasibility of the algorithm.