Selection of Rescuing Plan for Natural Disaster Zone

Abstract

Dijkstra’s Algorithm solves the problem of finding the shortest path from a point (the source) to a destination. This problem is sometimes called the single-source shortest path problem. In these days, the world become warmer day after day and the effect of that Global Warming problem, weather and natural change unpredictably. Because of the weather changes, unexpected disasters can happen. Those natural disasters may destroy all the living things, buildings and wealth. Therefore, disastrous recovery plans should have been planned. There are many requirements for the disastrous recovery such as time, manpower, money, transport, decision making quality and so on. In this paper, transport area of disastrous recovery will be specialized. In transport area, finding the shortest path to the destination is important as well as calculating the minimum cost, time and distance to arrive to the destination and performing the recovery plan.