Name
Abstract | ||
|---|---|---|
Given a multi-source and multi-sink transportation network, the contraflow-based method performs well in evacuation under complex capacity constraints on the roads in the network. This paper proposes a Contraflow-based algorithm based on Max-Flow Rate Priority strategy (CMFRP) to reconfigure the network to improve the evacuation performance. Firstly, the proposed algorithm generates candidate routes by the Dijkstra algorithm and determines an optimal evacuation route based on the max-flow rate priority strategy under capacity condition. Then, to simulate reasonable traffic control in the real world, CMFRP reconfigures the network structure and improves the upper bound capacities of selected roads to increase evacuee stream. Thus, the contraflow-based method could avoid serious congestion and accelerate the evacuation process. Experimental results indicate that CMFRP algorithm has a good performance on the trade of evacuation time and run time. It is also stable under different transportation network configurations. |
Year | Venue | Keywords |
|---|---|---|
2017 | 2017 13TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY (ICNC-FSKD) | evacuation route planning, heuristic algorithm, contraflow, transportation network |
Field | DocType | Citations |
Flow network,Mathematical optimization,Route planning,Computer science,Upper and lower bounds,Schedule,Dijkstra's algorithm,Network structure | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wu Ni | 1 | 0 | 0.34 |
| Dan Guo | 2 | 41 | 3.85 |
| Hailei Wang | 3 | 0 | 0.34 |
| Wenbo Li | 4 | 112 | 9.31 |