交巡警最短路径模型的建立*
Establishment of the Shortest Path Model for Traffic Patrol


黎永壹
LI Yongyi
(钦州学院电子与信息工程学院,广西钦州   535099)
(College of Electronic and Information Engineering,Qinzhou University,Qinzhou,Guangxi,535099,China)


摘要
:【目的】提高一般SPFA算法(Shortest Path Faster Algorithm)的效率,缩短出警时间。【方法】用离散化道路法优化辖区分配策略,在道路上设置虚拟路口,把每条道路离散成若干个点,然后把这些新增加的点作为新的路口,由此得到新的道路地图。【结果】多次仿真实验数据显示离散化的优化策略可以缩短出警时间。【结论】基于离散化的改进SPFA算法提高了一般SPFA算法的效率,优化了服务平台,具有一定的实用价值。
关键词:交巡警   最短路径   出警问题   离散化   算法   优化策略
中图分类号:TP391       文献标识码:A       文章编号:1002-7378(2016)01-0030-06
Abstract:【Objective】To improve the efficiency of the SPFA algorithm and shorten the response time.【Methods】Discretization was proposed in this paper to optimize jurisdiction allocation strategy. In virtual crossing the roads, every road discreted into several points, and then put the new increase point as the new intersection, which resulted the new road map.【Results】After many experiments, data proved that optimized discretization strategy can shorten the response time .【Conclusion】Improved SPFA algorithm based on discretization can improve the efficiency of the SPFA algorithm and optimizes the service platform, which has certain practical value.
Key words:traffic patrol,the shortest path,police problem,discretization,algorithm,optimization strategy

 

*国家自然科学基金项目(51204071),广东省科技计划项目(2012b010100019),中央大学的基础研究基金项目(2013 zz0047), 广西教育科学“十二五”规划课题“慕课教学模式下高校教学资源信息化建设的研究”(2015C435)和广西高校科研项目“半连续动力系统几何理论及其害虫综合治理研究”(ZD2014137)资助。

 

PDF全文下载cbimg.cnki.net/Editor/2016/0214/gxkx/c13a3946-7246-4b2b-83b4-6ec19604f843.pdf

发布日期:2016/2/14