杂草算法在城市交通用户平衡问题中的应用
发布时间：2019-04-21 19:05
【摘要】：根据城市交通中用户平衡状态的演化特征,提出了一种求解用户平衡问题的新方法.该方法通过逐步添加最短路径以保证所有阻抗最小路径均被使用,并通过改进入侵杂草算法(IWO)来分配各路径上的流量,以实现交通网络上的用户平衡.通过求解单个复杂交通网络上的用户平衡问题,验证了该方法的有效性.在求解多个复杂交通网络上的用户平衡问题上,与连续平均法(MSA)进行对比,表明该新算法能更好地解决城市交通网络用户平衡问题.
[Abstract]:According to the evolution characteristics of user equilibrium in urban traffic, a new method to solve the user balance problem is proposed. By adding the shortest path step by step to ensure that all the minimum impedance paths are used, and by improving the intrusion weed algorithm (IWO) to allocate the traffic on each path to achieve the user balance on the traffic network. The effectiveness of the proposed method is verified by solving the user balance problem on a single complex traffic network. Compared with the continuous averaging method (MSA), the new algorithm can solve the user balance problem of urban traffic network better than that of the continuous average method in solving the problem of user balance in multiple complex traffic networks.
【作者单位】： 郑州大学电气工程学院;
【基金】：河南省基础与前沿技术研究计划资助项目(132300410420)
【分类号】：U491;TP18
，
本文编号：2462475
[Abstract]:According to the evolution characteristics of user equilibrium in urban traffic, a new method to solve the user balance problem is proposed. By adding the shortest path step by step to ensure that all the minimum impedance paths are used, and by improving the intrusion weed algorithm (IWO) to allocate the traffic on each path to achieve the user balance on the traffic network. The effectiveness of the proposed method is verified by solving the user balance problem on a single complex traffic network. Compared with the continuous averaging method (MSA), the new algorithm can solve the user balance problem of urban traffic network better than that of the continuous average method in solving the problem of user balance in multiple complex traffic networks.
【作者单位】： 郑州大学电气工程学院;
【基金】：河南省基础与前沿技术研究计划资助项目(132300410420)
【分类号】：U491;TP18
，
本文编号：2462475
本文链接：https://www.wllwen.com/kejilunwen/daoluqiaoliang/2462475.html
