Improved Algorithms Of The People-serving Police Station Location Problem

Since 2012,some provinces of China have begun to build people-serving police stations.The construction of the people-serving police stations is conducive to the coordination and perfection of the police service,is conducive to improving the ability to prevent and control emergencies,and can shock the lawless persons and enhance the security of the people and society.However,the location problem of the people-serving police stations is mainly referred to the coverage of the police force,which is based on a greedy strategy.And the location of people-serving police stations is often prone to unscientific and unreasonable problems such as overlapping police forces,resulting in waste of state finance and human resources.Therefore,scientifically planning the number and location of people-serving police stations is of great significance to optimize police resources,reduce expenditure and safeguard public security.It is necessary to research this problem in depth.Based on the research of facility location models and algorithms,this thesis analyzes the unique requirements and conditions of the people-serving police station location problem,summarizes the difference between the problem and general location problems,and analyzes the time complexity of heuristic algorithm fitness calculation.Based on the repeated calculation problem in the heuristic algorithm process,improved algorithms are designed,and the effect of the improved algorithms is verified by experiments.The specific work includes the following parts:1.Firstly,based on the characteristics of the police station location model itself,based on the modeling of the police station,a model conversion method was designed,and the feasibility of the method is verified by simulation experiments.The method can transform the coverage of the police forces from the irregular areas to a limited set of demand points,and in order to make the distribution of the police station more balanced,the connection costs between the police station and the demand point is designed,thereby converting the model to Un-Capacitated Facility Location model.2.aiming at the lack of research on the fitness calculation of existing heuristic algorithms,this thesis proposes improved algorithms based on the parallelization,the hash table and a resetting strategy.Through calculation test examples,it is proved that parallelization and the hash table speed up the algorithms and the resetting strategy improves solutions of the algorithms.