Search

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. [ABSTRACT FROM AUTHOR]