Evacuation Route Optimization based on Tabu Search Algorithm and Hill-climbing Algorithm

Abstract

An optimization model for network evacuation route planning is constructed by taking into consideration the strategies of using reverse lane and eliminating intersection conflicts to minimize the total evacuation time in the dangerous areas. The optimization model is a bi-level model. The upper-level is to find optimized sub-network configuration of roadway section with lane reversal by the tabu search algorithm; the lower-level uses the hill-climbing algorithm to get the optimal routing plan with intersection crossing conflicts elimination. In order to prove the validity of the model and algorithm, this paper uses a simple example to illustrate its advantages.The calculation result shows that to solve the problem of evacuation route, the optimization algorithm designed in this paper not only can achieve an excellent computing result, but also has a better computational efficiency, a faster convergence rate and a relatively stable computing result.