本文已被：浏览 1577次 下载 2931次
Received:April 15, 2015 Revised:June 11, 2015
Received:April 15, 2015 Revised:June 11, 2015
中文摘要: 在路网中,为了使用户的出行时间降到最低,提出一个适用于多OD对的路网的动态用户均衡离散模型,并应用蚁群算法求解动态用户均衡问题.通过设计一个算例,利用仿真得出路网中的流量分配数据,并和二次规划Frank-Wolfe算法求解的流量分配数据进行比较,最后得出蚁群算法在求解动态交通用户均衡问题时具有一定的优势.
中文关键词: 动态用户均衡 蚁群算法 Frank-Wolfe算法
Abstract:This paper presented a multi-OD dynamic user equilibrium model based on the road network, in order to enable users to minimize travel time in the network. It uses Ant Colony algorithm to solve the problem of dynamic user equilibrium. By designing a numerical example and employing simulation we obtain traffic flow distribution data which compared traffic flow distribution data of Frank-Wolfe algorithm in the road network. The conclusion is that Ant Colony algorithm has certainly advantage in solving the problem of dynamic traffic user equilibrium.
文章编号： 中图分类号： 文献标志码：
基金项目:
引用文本：
曹继英,安毅生,乔雄,赵金剑,杨丽娜.基于蚁群算法的动态用户均衡配流.计算机系统应用,2016,25(1):126-130
CAO Ji-Ying,AN Yi-Sheng,QIAO Xiong,ZHAO Jin-Jian,YANG Li-Na.Implementation of Dynamic User Equilibrium Model Based on Ant Colony Algorithm.COMPUTER SYSTEMS APPLICATIONS,2016,25(1):126-130
曹继英,安毅生,乔雄,赵金剑,杨丽娜.基于蚁群算法的动态用户均衡配流.计算机系统应用,2016,25(1):126-130
CAO Ji-Ying,AN Yi-Sheng,QIAO Xiong,ZHAO Jin-Jian,YANG Li-Na.Implementation of Dynamic User Equilibrium Model Based on Ant Colony Algorithm.COMPUTER SYSTEMS APPLICATIONS,2016,25(1):126-130
