Congestion control in spatial networks during disasters

Abstract

Extensive quantities of algorithms have been proposed to solve shortest path inquiry issues for static or time dependent spatial networks; be that as it may, these algorithms don’t perform well to discover the nearest shelter with fastest paths in a disaster circumstances. In a disasters, path figured through existing algorithms and saved as the fastest may end up harmed. ONSC approach provides optimal path in a disaster circumstance however doesn’t manage with congestion control. To tackle this issue, this paper proposes a strategy to diminish the travelling time with an existing dynamic network:display, which is called an Event dependent network, to represent a spatial network in a disaster which assist the general population with choose the optimal path by giving weight-factor(in percentage) of the congestion in the road network.