网络分析在GIS出警路径规划中的研究与应用

发布时间：2019-03-02 16:37

【摘要】： 快速出警是防范和打击严重危害国家安全和社会治安秩序案件的基础。除了报警信息的及时响应为出警人员提供正确的出警路线之外,最短出警距离也是保障最短时间内到达现场的基本要素。通常不可能在所有街道、路口都部署警力,定点巡警守候岗及巡警对其管辖区域进行巡逻的动与静相结合就构成了适应快速出警要求的主要途径。本文应用网络分析方法,针对如何找出一条最佳路径使得警察尽快到达报警点,如何合理设立巡逻定点守候岗保证该定点岗能在规定时间内到达高发案地区,以及给出一个巡逻路径使得巡警遍历管辖区域内的所有街道而遍历的路径最短等三个方面的问题提出了研究。首先,分析了GIS系统的特征,建立了GIS数学模型,并对网络分析的基础最短路径算法进行了讨论,采用4叉堆排序和划分子图法,以南宁市区实际地理情况为示例,证明了所提出改进算法的有效性。其次,在改进的Dijkstra算法基础上,采用线性规划的方法,利用计算机对巡警定点守候岗的分布进行了求解,为应用线性规划的方法对巡警定点守候点的部署分析提供了基础。应用解决中国邮递员问题的求解思路,给出了应用Hungary方法求解巡逻路线的步骤。同时,对Hungary方法进行了改进,避免了该算法中因任意选取零元而导致死循环的问题。在此基础上,建立了解决巡警在其管辖区域内巡逻最优路径规划的求解方法。试验结果表明,相关算法即使对南宁市全市区进行求解也可以很好地收敛,是一个有效的算法。文中所建立理论方法在公安GWP系统的应用示例表明了其良好的应用价值。
[Abstract]:Rapid police call is the basis of preventing and combating serious harm to national security and public order. In addition to the timely response of the alarm information, the shortest alarm distance is also the basic factor to ensure the shortest time to arrive at the scene in addition to providing the correct way for the alarm personnel to get to the scene. It is usually impossible to deploy police forces on all streets and junctions. The combination of static and dynamic patrolling of the designated patrol guard and patrol police to the area under its jurisdiction constitutes the main way to adapt to the requirements of rapid alarm. This paper applies the network analysis method, aiming at how to find the best way to make the police reach the alarm point as soon as possible, how to set up the patrol fixed-point guard post reasonably to ensure that the fixed-point post can reach the high-incidence area within the specified time. A patrolling path is given to make the patrolling police traverse all the streets in the jurisdiction area and the shortest traversing path is put forward. Firstly, the characteristics of GIS system are analyzed, the mathematical model of GIS is established, and the basic shortest path algorithm of network analysis is discussed. The effectiveness of the improved algorithm is proved. Secondly, on the basis of the improved Dijkstra algorithm, the linear programming method is used to solve the distribution of patrol alarm fixed-point guard posts, which provides a basis for the deployment analysis of patrol-alarm fixed-point guard points by using the linear programming method. In this paper, the method of solving the Chinese postman problem is presented, and the steps of solving the patrol route by using the Hungary method are given. At the same time, the Hungary method is improved to avoid the problem of dead loop due to the arbitrary selection of zero elements in the algorithm. On the basis of this, a method to solve the optimal path planning of patrolling police in the area under its jurisdiction is established. The experimental results show that the related algorithm can converge well even if it is used to solve the whole urban area of Nanning, and it is an effective algorithm. The application example of the theory and method in the public security GWP system shows its good application value.
【学位授予单位】：上海交通大学
【学位级别】：硕士
【学位授予年份】：2007
【分类号】：D631;P208

【相似文献】