论文部分内容阅读
研究了以出警时间作为依据的警力部署问题,并应用基于二元覆盖的集合覆盖模型和最大覆盖模型解决问题。在介绍这两类模型后,分析了最大覆盖模型的限定条件,即限定资源数量不大于集合覆盖模型求得的结果。在应用遗传算法对两种模型求解时,阐述了算法实现过程中关键问题的处理和求解最大覆盖模型时算法的改进方法,并以北京部分路网数据对实现的算法进行了验证。试验表明了遗传算法求解的不稳定性和偏差有限的特点,验证了最大覆盖模型应用的限定条件。提出在解决资源受限的警力部署问题时,应结合集合覆盖模型求得的结果应用最大覆盖模型求解。
The deployment of police force based on the time of police outage is studied, and the problem of police deployment based on binary coverage and the maximum coverage model is solved. After introducing these two types of models, the definition of the maximum coverage model is analyzed, that is, the limited resource quantity is not greater than the result obtained by the set coverage model. In the application of genetic algorithm to solve the two models, the key problems in the process of algorithm implementation and the improved method to solve the maximum coverage model are illustrated. The algorithm of partial road network in Beijing is verified. Experiments show that the genetic algorithm has the characteristics of instability and limited deviation, and validates the application of the maximum coverage model. It is proposed that when solving the problem of police deployment with limited resources, the maximum coverage model should be used to solve the problem based on the result of the set cover model.