交巡警服务平台的设置与调度

Setting and Scheduling of Traffic Patrol Service Platform

研究了设置与调度交巡警服务平台的优化问题,并利用Floyd算法确定交通网中任意两节点间的最短路径长度。建立线性优化模型分配服务平台的管辖范围;通过多目标规划确定快速封锁中心城区出口的调度方案;针对重大刑案设计围堵算法,在全市范围内调遣服务平台,部署围堵方案。以出警超时的节点数少和各平台工作量均衡为评价标准,分析现有服务平台设置的合理性,并考虑增加或重新设置交巡警服务平台,建立优化模型,给出了解决问题的合理性方案。

This paper researches on the optimization problem of setting and scheduling traffic patrol service platform and uses Floyd algorithm to determine the shortest length between any two nodes in traffic network. It sets up a linear optimization model to deploy the jurisdiction scope; plans and determines the scheduling program of blocking the inner-city exits quickly; designs containment algorithm for severe crimes; reschedules service platform citywide and deploys containment plan. It analyses the expediency of current service platform and uses fewest nodes of the police action and the various platform workload balance as assessment standard, considering increasing or resetting the traffic service platform and building up optimization model to offer a reasonable plan to solve the problem.