警务平台的优化设置及高效调度

The Optimal Settings and Efficient Scheduling on Police Platform

利用Floyd算法及就近原则,首先建立了以点集为管辖范围、以出警时间最短、工作量相对均衡、总工作量最小为目标函数的多目标0-1整数规划模型,然后将原网络图转化为对偶图,建立了以路集为管辖范围的多目标0-1整数规划模型.此外,在一个平台的警力最多封锁一个路口的前提下,设计了快速全面封锁的方案,得到了8.015min的最佳封锁时间.

Using the Floyd algorithm and the principle of proximity, a multi-objective 0-1 integer programming model is firstly established based on the principle of point set as the jurisdiction scope, minimal police dispatching time, the relatively balanced workload and the minimal overall workload. Secondly, after the original network diagram is transformed into a bipar- tite graph, the multi-objective 0-1 integer programming model is established based on the jurisdiction of edge set. In addition, when the police force of a platform can only block an intersection, a rapid and comprehensive solution for comprehensive block ade is designed with the optimistic blockade time being 8. 015457minute.