作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (5): 17-19. doi: 10.3969/j.issn.1000-3428.2008.05.006

• 博士论文 • 上一篇    下一篇

基于时间窗的随机时变交通网络信号相位协调

袁二明1,蔡小强2,涂奉生3   

  1. (1. 南开大学信息技术科学学院,天津 300071;2. 香港中文大学,香港;3. 南开大学信息学院,天津 300071)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-03-05 发布日期:2008-03-05

Optimal Offsets Between Intersections in Stochastic Time-varying Traffic Network Based on Time-windows

YUAN Er-ming1, CAI Xiao-qiang2, TU Feng-sheng3   

  1. (1. College of Information Technology Science, Nankai University, Tianjin 300071; 2. Chinese University of Hong Kong, Hong Kong, China; 3. College of Information, Nankai University, Tianjin 300071)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-03-05 Published:2008-03-05

摘要: 交通网络是随机时变网络,用周期性时间窗模拟各路口信号灯控制,建立交通网络中路口相位差协调控制模型。时间窗的设定使只有规定行驶方向的车辆可以通行路口,其他车辆不可通行。为得到车辆在路口前等待状况,定义时间窗函数,该函数采用协调交通网络路口信号相位差的方法求得随机时变网络的最短期望路径。结合改进的SDOT算法和穷举法及遗传算法设计一种混合算法。对一个四路口小型交通网络进行了仿真研究,结果验证了求解算法的有效性。

关键词: 时间窗, 随机时变网络, 相位差, 最短路径

Abstract: Travel networks are stochastic, time-varying. A time constraint(repeated sequence of time-windows)network model is proposed to simulate the operations of traffic-light control. In each time-window, only the car in specified routes is allowed to pass (green light) and others and not allowed (red light). In order to get the condition of car in front of intersection, this paper gives a function of time-windows, and gets the shortest path of signal traffic network with time-windows and offsets between intersections. A mixed algorithm combining the SDOT algorithm and genetic algorithm is designed to solve the problem. The paper simulates a four-intersection traffic network, result shows the effectiveness of the algorithm.

Key words: time-windows, stochastic time-varying networks, offset between intersections, shortest path

中图分类号: