杂草算法在城市交通用户平衡问题中的应用  

Application of Invasive Weed Optimization Algorithm to the User Equilibrium Problem of the Urban Traffic

作　　者：曾庆山[1] 刘巍[1] 

机构地区：[1]郑州大学电气工程学院,河南郑州450001

出　　处：《郑州大学学报（工学版）》2015年第1期10-14,共5页Journal of Zhengzhou University（Engineering Science）

基　　金：河南省基础与前沿技术研究计划资助项目(132300410420)

摘　　要：根据城市交通中用户平衡状态的演化特征,提出了一种求解用户平衡问题的新方法.该方法通过逐步添加最短路径以保证所有阻抗最小路径均被使用,并通过改进入侵杂草算法(IWO)来分配各路径上的流量,以实现交通网络上的用户平衡.通过求解单个复杂交通网络上的用户平衡问题,验证了该方法的有效性.在求解多个复杂交通网络上的用户平衡问题上,与连续平均法(MSA)进行对比,表明该新算法能更好地解决城市交通网络用户平衡问题.Based on the evolutionary character of user equilibrium of the urban traffic,a new method which can solve the user equilibrium problem is presented. This method ensures all paths which have the minimum resistance are used by adding the shortest path step by step,and realize the user equilibrium of the urban traffic by distributing the flow of paths based on improved invasive weed optimization algorithm（ IWO）. The effectiveness is verified by solving the user equilibrium problems of one complex urban traffic network. It proves that the new algorithm can get better solution of the user equilibrium problem after comparing it with the method of successive algorithm（ MSA） in solving the user equilibrium problems of some complex urban traffic networks.

关 键 词：城市交通 演化特征 用户平衡 杂草入侵算法 连续平均法 

分 类 号：TP399[自动化与计算机技术—计算机应用技术]