Algorithm Study Of Conference Location And Police Car Patrolling Problems

Conference location and police car patrolling problems are typical location problems. And location problem is the important part of Operations Research and Management discipline. The first chapter presents the background of the location problem, including their classification and the development. It also explains the main work of this paper.The second chapter presents the conference location problem. Conference location problem belongs to discrete location and 1 - median location problem. Using the network shortest path algorithm processing data, this paper establish double objective optimization model of conference location problem, and solve it respectively with restraint method and the genetic algorithm. Moreover, considering transfer fees, we give the optimal meeting practical location decision.The third chapter introduces the police car patrolling problem. In static situation, the police car patrols question belongs to center location problems and also belongs to covering problems. The scheme of static the police car layout is obtained by using the genetic algorithm. In dynamic circumstances, the police car patrolling problem is dynamic location problem. The police patrol model is established with the police patrol effect index constraint, a series of patrol schemes are given by using the genetic algorithm and computer simulation.Finally, we consider a case study about the Tianhe district of the Guangzhou city. The results show the effectiveness of the model and algorithm. The police patrol routes have good arrival rate and concealment. At the same time, a good result is obtained using a greedy algorithm.