摘要
为解决城市交通路网中容量的随机性对可靠性研究的影响问题,建立了随机流交通路网可靠性模型,提出了一种基于改进粒子群算法的交通路网可靠性评价方法,该方法能够搜索到满足条件的多个解,在算法中引入了一种转移机制可以有效地避免粒子陷入局部无目标搜索状态,又可保证全局搜索能力,最终能够搜索到路网在d需求量下的所有d-下界点以计算路网的可靠性。通过算例结果表明了该改进粒子群算法的可行性及准确性。
To solve the problem that randomicity of road network capacity affects research on reliability in traffic network, sto- chastic-flow road network reliability model is established. An algorithm of road network reliability evaluation based on im- proved PSO is proposed, and many solutions satisfied condition are found. A shifting mechanism is introduced to aviod particle objectless searching and ensure overall searching ability. Final target is to find all lower boundary point for d under d- demand in order to calculate road network reliability. Example demonstrates the feasibility and accuracy of the proposed algorithm at last.
出处
《计算机工程与设计》
CSCD
北大核心
2012年第3期1140-1144,共5页
Computer Engineering and Design
关键词
随机流路网
粒子群优化
可靠性
d-下界点
状态空间
stochastic-flow road network particle swarm optimization (PSO) reliability
lower boundary point for d state space