摘要
建立了描述路段交通量变化的状态方程及相关约束,给出了一种新的动态系统最优配流算法。该算法通过在每个时段把车流分配至边际行程时间最小的路段上,从而最小化交通系统内车辆的总运行时间。该算法适用于多起点、多讫点以及O-D量随时间变化路网的动态系统最优交通分配,仿真结果验证了算法的有效性。
In this paper, state equations describing traffic volume change on links in road network are established, and a new algorithm for assigning traffic in an optimal way is introduced. The algorithm is to minimize total travel time in the whole network by assigning traffic flow to links that have the lowest marginal link travel time at every time period. The algorithm is applicable to large-scale road network with many to many origin-destination and time-dependent O-D volumes. Simulation results prove the validity of both the model and the algorithm.
出处
《交通与计算机》
2005年第3期1-4,共4页
Computer and Communications
基金
云南省自然科学基金资助项目(2003E0086M)
云南省教育厅自然科学研究基金资助项目(04Z277D)
