The Optimal Settings and Efficient Scheduling on Police Platform
Abstract
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 bipartite 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 blockade is designed with the optimistic blockade time being 8.015457minute.
