设置与调度交巡警服务平台的算法模型

Algorithm Model of Setting and Scheduling Traffic Patrol Service Platform

探讨了交巡警服务平台的合理设置与调度问题。建立时间最短模型和最大化均衡模型,得到不同目标下各平台所分配的管辖范围;以最长时间达最小值为指标,建立封锁中心城区的调度模型,进而以总时间最短为目标,建立修正模型;建立双目标规划(MOP)模型,通过设计的改进穷举法和随机搜索算法,给出了增加服务平台的方案;通过对平台资源分配的合理性讨论,利用模拟退火算法(SA),给出全市平台的重置方案;设计蜘蛛网模型,以网络包围圈的形式,通过外、内两区的有效控制,给出围堵重大刑案嫌犯的方案。

This paper discusses the reasonable setting and scheduling of traffic patrol service platform. This paper uses shortest time model and maximum equilibrium model to obtain the jurisdiction scope of each platform under different targets. Under the direction of maximum time with minimum value, we establish a scheduling model to block inner-city area and then establish a correction model with shortest total hour as the goal. Through brute-force method and random search algorithm, an MOP model is set up to increase service platform. Through reasonable discussion on platform resource allocation, using the simulated annealing algorithm（SA）, it offers the city＇ s platform reset program. A cobwebs model is designed in the form of network encirclement both outside and inside, there fore it offers a program against major criminal suspects.