Abstract: Large numbers of algorithms have been proposed to solve shortest path query problems for static or time-dependent spatial networks; however, these algorithms do not perform well to find the nearest shelter with fastest paths in disaster situations. In disasters, path computed through existing algorithms and saved as the fastest might become damaged. ONSC approach provide optimal path in disaster situation but do not deal with congestion control. To solve this problem, this paper proposes a method to reduce the travelling time with an existing dynamic network model, which is called an event-dependent network, to represent a spatial network in a disaster which help the people to choose the optimal path by giving weight-factor(in percentage) of the congestion in the road network.
Keywords: congestion control, event dependent network, path planning, disaster management.