| 交巡警最短路径模型的建立 |
| |
| 引用本文： | 黎永壹.交巡警最短路径模型的建立[J].广西科学院学报,2016,32(1):30-35,41. |
| |
| 作者姓名： | 黎永壹 |
| |
| 作者单位： | 钦州学院电子与信息工程学院,广西钦州,535099 |
| |
| 基金项目： | 国家自然科学基金项目(51204071)，广东省科技计划项目(2012b010100019)，中央大学的基础研究基金项目(2013 zz0047)，广西教育科学“十二五”规划课题“慕课教学模式下高校教学资源信息化建设的研究”(2015C435)，广西高校科研项目“半连续动力系统几何理论及其害虫综合治理研究”(ZD2014137)资助。 |
| |
| 摘 要： | 【目的】提高一般SPFA算法(Shortest Path Faster Algorithm)的效率,缩短出警时间。【方法】用离散化道路法优化辖区分配策略,在道路上设置虚拟路口,把每条道路离散成若干个点,然后把这些新增加的点作为新的路口,由此得到新的道路地图。【结果】多次仿真实验数据显示离散化的优化策略可以缩短出警时间。【结论】基于离散化的改进SPFA算法提高了一般SPFA算法的效率,优化了服务平台,具有一定的实用价值。
|
| 关 键 词： | 交巡警 最短路径 出警问题 离散化 算法 优化策略 |
| 收稿时间： | 2015/11/10 0:00:00 |
Establishment of the Shortest Path Model for Traffic Patrol |
| |
| LI Yongyi.Establishment of the Shortest Path Model for Traffic Patrol[J].Journal of Guangxi Academy of Sciences,2016,32(1):30-35,41. |
| |
| Authors: | LI Yongyi |
| |
| Institution: | College of Electronic and Information Engineering, Qinzhou University, Qinzhou, Guangxi, 535099, China |
| |
| Abstract: | Objective]To improve the efficiency of the SPFA algorithm and shorten the re-sponse time.Methods]Discretization was proposed in this paper to optimize jurisdiction allo-cation 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. |
| |
| Keywords: | traffic patrol the shortest path police problem discretization algorithm optimi-zation strategy |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《广西科学院学报》浏览原始摘要信息 |
| 点击此处可从《广西科学院学报》下载免费的PDF全文 |
|
