Emergency Rescue Vehicle Dispatch Planning Using a Hybrid Algorithm

This paper describes the emergency rescue vehicle transportation network within the entire rescue period, and imitates rescue vehicle to select rescue route and to allocate emergency resource. The presented emergency rescue vehicle dispatch model seeks to minimize rescue time as the first objective function, minimize delay cost as the second objective function and maximize lifesaving utility as the last objective function in disaster response operations. To solve the proposed multiple objective model, a hybrid algorithm named nondominated sorting genetic algorithm (NSGA-II) with ant colony algorithm and a NSGA-II with random crossover and mutation, which can find better initial solution, are presented. In order to further prove the validity of the model and algorithm, a more complicated case is cited. Computational results are reported to illustrate the performance of the proposed model and algorithm. Statistical analysis confirms that the proposed random crossover and mutation operator outperforms the original crossover and mutation operator. The sensitivity analysis proves which parameter is more important for objective function values.