期刊文献+

一种随机邻阶点选择进化的交通控制优化方法

An Optimized Traffic Control Method Based on Random Neighbor Point Selection and Evolution
在线阅读 下载PDF
导出
摘要 传统的交通控制方法采用基于时间延迟的红绿灯调度方法和车辆限行,路径规划等简单的措施,无法针对实时的车辆信息进行不断调整和反馈达到最优效果。提出了一种基于随机邻阶点选择进化的交通控制优化方法,采用随机临界点模型将所有的分析对象车辆纳入分析范围,然后依据随机邻阶点选择进化的方法,对每个车辆的最佳全局路线进行选择进化,不断迭代,得出最优化的全局方法。采用实际的某地区交通进行测试实验,结果显示,采用基于随机邻阶点选择进化的方法,交通通行率提高46.8%,优化率提高34%,具有很好的指导意义。 An optimized traffic control method with random neighbor point selection and evolution was proposed, all the ve-hicles were included in the scope of analysis objects, and then the random neighbor point evolutionary approach was choose to select the best overall course of evolution for each vehicle constantly iteration, draw global optimization method, a region-al transportation actual was used to do test experiments, the results show that with random neighbor point choose evolution-based approach, the traffic pass rate increased 46.8%and the improvement rate was increased with 34%, it has good appli-cation for guidance.
出处 《科技通报》 北大核心 2014年第8期176-178,共3页 Bulletin of Science and Technology
基金 黑龙江省自然科学基金(F201204) 黑龙江省教育厅科学技术研究项目面上基金(12531756)
关键词 随机邻阶点 选择进化 交通控制 random neighbor point selection and evolution traffic control
作者简介 王崇(1981-),男,黑龙江齐齐哈尔人,硕士研究生,讲师,研究方向:网络安全。
  • 相关文献

参考文献5

二级参考文献49

  • 1Macker J P, Corson M S. Mobile Ad Hoc Networking and the IETF[J].Mobile Computing and Communications Review, 1998, 2(4): 9-15
  • 2Rajaraman R. Topology control and routing in Ad hoc network: a survey [J]. SIGACT News, 2002, 33(2) : 60-73
  • 3Liu Rui. Topology control for Ad hoc networks: [Ph D dissertation].S. University of Delaware, 2004
  • 4Santi P. Topology control in wireless Ad hoc and sensor networks [J].ACM Computing Surveys, 2005, 37(2) : 164-194
  • 5Rappaport T. Wireless Communications: principles and practice. second edition [M]. 北京:电子工业出版社,2004
  • 6Sen A, Huson M. A new model for scheduling packet radio networks [A]. In: IEEE INFOCOM [C]. Philadelphia, PA, USA: IEEE Press, 1996. 1116-1124
  • 7Penrose M. On k-connectivity for a geometric random graph [J]. Rand Struct Algorithm, 1999, 15(2): 145-164
  • 8Penrose M. A strong law for the longest edge of the minimal spanning tree. The Annals of Probability, 1999, 27 (1) : 246- 260
  • 9Santi P. The critical transmitting range for connectivity in mobile ad hoc networks [J]. IEEE Transactions on Mobile Computing, 2005, 4(3): 310-317
  • 10Jennings E, Okino C. Topology control for efficient information dissemination in ad-hoc networks [A].In: SPECTS' 02 [C]. San Diego, California, 2002. 1-7

共引文献127

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部