Contrastive Analysis of Heuristic Algorithms for Covering Location Model of Traffic Patrol Police Deployment

According to whether the police resources have the maximum limit or not, the problem of traffic patrol police deployment is divided into two kinds: unlimited-resource and limited-resource problem, which could be solved by Set Covering Location Model and Maximum Covering Location Model respectively. In this paper, three heuristic algorithms, including Simulated Annealing Algorithm, Genetic Algorithm and Particle Swarm Optimization, are used to solve those models. Then part of the Beijing road network data is taken as an example to verify those algorithms. Finally, the advantages and disadvantages of those three algorithms are analyzed through contrasting the experimental result of those algorithms.