Abstract
Semantic computing addresses the transformation of data, both structured and unstructured into information that is useful in application domains. One domain where semantic computing would be extremely effective is evacuation route planning, an area of critical importance in disaster emergency management and homeland defense preparation. Evacuation route planning, which identifies paths in a given transportation network to minimize the time needed to move vulnerable populations to safe destinations, is computationally challenging because the number of evacuees often far exceeds the capacity, i.e. the number of people that can move along the road segments in a unit time. A semantic computing framework would help further the design and development of effective tools in this domain, by providing a better understanding of the underlying data and its interactions with various design techniques. Traditional Linear Programming(LP) based methods using time expanded networks can take hours to days of computation for metropolitan sized problems. In this paper, we propose a new approach, namely a capacity constrained routing planner for evacuation route planning which models capacity as a time series and generalizes shortest path algorithms to incorporate capacity constraints. We describe the building blocks and discuss the implementation of the system. Analytical and experimental evaluations that compare the performance of the proposed system with existing route planners show that the capacity constrained route planner produces solutions that are comparable to those produced by LP based algorithms while significantly reducing the computational cost.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have