检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华南理工大学,广州510640
出 处:《交通与计算机》2008年第4期47-50,共4页Computer and Communications
基 金:"十一五"国家科技支撑计划重点项目(批准号:2006BAJ18B01)资助
摘 要:就建立关联交叉口优化控制系统的一种实现方法,给出了动态关联交叉口的定义,提出了复杂关联交叉口的优化策略,在此基础上以关联交叉口群一个周期内延误最小为目标建立了优化模型,并设计了关联交叉口实时优化控制系统。模型的求解和运算效率高,有利于建立实时的区域交通控制系统。仿真实验证明了所提出的方法在系统延误方面优于传统方法。In this paper, a method to implement optimization control system for correlative intersection was discussed. A definition for dynamic correlative intersection was proposed. Optimization strategies for complicated correlative grouped intersections were put forward. Based on these strategies, an optimal offset model aiming at the minimal delay of vehicles within one cycle was proposed. A real-time optimization control system for dynamic correlative intersection was designed. The algorithm can satisfy the demand of real-time traffic control. Thus, the model is highly efficient in solution and calculation, and can be used in establishing real-time coordinate control system for urban regions. The simulation shows that the method proposed in this paper is more effective in reducing delay of vehicles than traditional way used in correlative grouped intersections.
关 键 词:系统设计 基本优化单元 最小延误 复杂关联交叉口群
分 类 号:U491[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117