改进的粒子群算法在动态OD矩阵反推中的应用  

Application of improved particle swarm algorithm in dynamic OD matrix estimation

作　　者：杜长海[1] 黄席樾[1] 杨祖元[1] 唐明霞[1] 杨芳勋[1] 

机构地区：[1]重庆大学自动化学院,重庆400044

出　　处：《计算机工程与应用》2008年第34期234-238,共5页Computer Engineering and Applications

基　　金：重庆市科委自然科学基金No.2006BA6016~~

摘　　要：针对粒子群算法存在收敛速度慢和局部最优的问题,引入粒子间相对位置改进基于抗体浓度的概率选择公式,提出了一种带免疫机理的改进粒子群算法。粒子不仅根据个体极值和全局极值更新速度和位置,而且按一定概率以轮盘赌法选择某个粒子进行学习,以保持种群多样性,防止出现早熟停滞现象。并将其用于由路段流量反推OD矩阵的极大熵模型求解研究中,以重庆市某交叉路口为实例进行实验,结果表明:粒子群算法推算OD矩阵是有效、可行的,可以克服牛顿法严格依赖初始值的缺点;改进的粒子群算法比基本粒子群算法和基本遗传算法具有更好的全局寻优能力。Due to the disadvantage of slow convergence and local optimum of particle swarm algorithm,introducing relative distances among particles to improve probability selection formula,an improved particle swarm optimization with immune mechanism is proposed.Particles update their velocity and position not only by individual and global optima,but also by individual optima of a specific particle selected by roulette method according to certain probability,to keep the variety of the population and avoid precocity and stagnation.This algorithm is applied to solve the maximum entropy model,estimating OD matrix from traffic link flows.Through a test on a specific crossroad in Chongqing City,the experimental results show that particle swarm algorithm is feasible and effective for OD matrix estimation,overcomes the shortcoming of Newton＇s method that strictly depends on initial values, and the particle swarm algorithm has much higher capacity of optimization than basic particle swarm algorithm and basic genetic algorithm.

关 键 词：智能交通系统 OD矩阵 极大熵模型 粒子群优化 免疫算法 

分 类 号：U491.1[交通运输工程—交通运输规划与管理]