Abstract:
In response phase of disaster management, immediate actions are taken by various organizations
to fulfill humanitarian needs. In a post-disaster scenario, the aim of disaster relief
team is to serve maximum people within time constraint but if by increase in little bit cost,
one can save more people then increase in cost can be taken positively. This dissertation
presents a web-based tool which finds the relief vehicle routes of real location and visualizes
it on the map in a hassle-free way. In addition to tackle the disaster scenario, two
approaches are proposed, namely priority based route find (PBRF) and hybrid route find
(HRF), for post-disaster relief supply. PBRF is location priority based algorithm, which is
efficient in terms of serving maximum people in a single trip but time associated to this approach
is longer. HRF is a hybrid algorithm of PBRF and distance based route find (DBRF),
a traditional algorithm of solving traveling salesman problem (TSP). Through various simulations
all three algorithms are compared in terms of time and number of people served.
Result shows that HRF is efficient compared to PBRF and DBRF.
