检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:段鹏飞
机构地区:[1]蚌埠汽车士官学校装备保障系,安徽蚌埠233011
出 处:《军事交通学院学报》2014年第7期86-90,共5页Journal of Military Transportation University
摘 要:为充分反映城市道路交叉口的综合交通效益需求,以定周期信号为约束条件,建立以机动车延误、行人延误和停车率联合最小为目标的配时优化模型。针对传统求解算法收敛速度较慢且易受约束条件限制问题,采用一种约束粒子群算法。通过对非可行解添加惩罚函数,有效消除其对最优解搜索的干扰;针对传统粒子群算法易陷入局部最优解的缺点,引入改进的杂交算子,提高解空间的多样性,加快算法的收敛速度。对给出算法进行性能仿真,分析周期时长对优化目标的灵敏性,结果证明给出算法的有效性。To fully respond the need of comprehensive traffic benefits at urban intersection, the timing optimization model is built, which takes fixed - cycle signal as constraint and minimum vehicle delay, pedestrian delay and stopping rate as ob- jectives. To solve traditional algorithm' s problems of low convergence speed and liability to constraint, a CPS algorithm is employed. Through adding penalty function to the infeasible solution, the interference with optima searching is eliminated. Aiming at the disadvantage of traditional PSO algorithm, which is easy to trap in local optima, the improved crossover oper- ator is introduced, which improves the diversity of solution space and convergence speed. In the paper, the performance of the given algorithm is simulated and the sensibility of cycle time to optimization objectives is analyzed. The simulation result proves the effectiveness of the given algorithm.
分 类 号:U491.5[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7