摘要
为能更好地解决交巡警服务平台的调度问题,利用图论和遗传算法的理论及方法,建立了交巡警服务平台调度模型。根据具体实验数据,利用该模型找到了交巡警管辖范围分配方案及全封锁的最佳调度方案。得出了服务平台到进出口最远节点的距离为8015.46米,最快需要用时480.93秒才能实现路口全封锁。同时,根据均衡度原则和出警时间最少原则,认为新增交巡警服务平台4个,其具体位置在91,61,66,52 4个节点处。
In order to better solve the scheduling problem of traffic and patrol police service platform, using the theory and method of graph theory and genetic algorithm, established a patrol service platform scheduling model. According to the specific experimental data, the use of the model had been jurisdiction assignment scheme of traffic and patrol police, and the optimal scheduling scheme of full blockade. It obtained that the farthest node distance of servicing platform to import and export is 8015.46 meters, and it realized the full blockade that the fastest need 480.93. At the same time, according to the principle of balance degree and the least time the police, it consider that traffic and patrol police service platform should be added four platforms, its location in the 91, 61,66,52 nodes.
出处
《电子设计工程》
2016年第15期32-34,共3页
Electronic Design Engineering
关键词
遗传算法
交巡警服务平台
最短路径
调度模型
genetic algorithm（GA）
traffic and patrol police service platform
shortest route
scheduling model
