Emergency resources scheduling model & algorithm

Abstract

A reasonable allocation of emergency resources can decrease the effect area of the disaster, help victims in time, and reduce the disaster loss. It plays an important role in the whole process. In view of the urgency of transportation, this paper regards transport vehicles, goods and demand points as a network. Based on time windows, it presents a scheduling model for emergency resources with the shortest transportation distance as its goal and the vehicle load, the biggest trip mileage, the latest arrival time etc. as constraint conditions. The feasible solution can be found through ant colony algorithm, and the global search ability can be improved by using genetic algorithm. At last an example solved by ant colony algorithm and genetic algorithm is given to show the validity.