Rescuing and Evacuation Dual Route Planning-Supply Chain Management for Disasters of Unknown Scale

Rescuing and evacuation routes-planning of less conflicting is critical for dealing a disaster management problem. Efficient planning tools are needed to produce an emergency managing plan to rescues or to evacuate the affected people in event of natural disasters. By combining 4-node and 5-node Hamiltonian planar graphs, we proposed a Combo-Hamiltonian dual route (CHDR) for dealing with disasters of unknown scale in a hazardous area. We simulated and produced artificial disasters for testing and studying the effectiveness of rescuing and evacuating in a basic hazard block. Each disaster scenario contains an arbitrary disaster origin, two constructed CH routes, several possible exits, and 18 depots with materials of varied importance. To test our preparations, four key performance indices were used: Goodness of matching, conflicting degree, balance condition, and material handling cost. Simulation results show that the proposed CH dual route planning approach has a 24% chance of routes bumping into each other. Also, the system provides a balanced plan such that individual refugee can gain some supplies within less than 2% of the unit scale length of a basic hazard block. Finally, we compare the priority handling cost of the proposed rescuing and retreating plan and a randomly dual route.