首页 | 本学科首页   官方微博 | 高级检索  
     

基于蚁群算法的动态用户均衡配流
引用本文:曹继英,安毅生,乔雄,赵金剑,杨丽娜. 基于蚁群算法的动态用户均衡配流[J]. 计算机系统应用, 2016, 25(1): 126-130
作者姓名:曹继英  安毅生  乔雄  赵金剑  杨丽娜
作者单位:长安大学信息工程学院, 西安 710064,长安大学信息工程学院, 西安 710064,西安理工大学自动化与信息工程学院, 西安 710048,长安大学信息工程学院, 西安 710064,长安大学信息工程学院, 西安 710064
摘    要:在路网中,为了使用户的出行时间降到最低,提出一个适用于多OD对的路网的动态用户均衡离散模型,并应用蚁群算法求解动态用户均衡问题.通过设计一个算例,利用仿真得出路网中的流量分配数据,并和二次规划Frank-Wolfe算法求解的流量分配数据进行比较,最后得出蚁群算法在求解动态交通用户均衡问题时具有一定的优势.

关 键 词:动态用户均衡  蚁群算法  Frank-Wolfe算法
收稿时间:2015-04-15
修稿时间:2015-06-11

Implementation of Dynamic User Equilibrium Model Based on Ant Colony Algorithm
CAO Ji-Ying,AN Yi-Sheng,QIAO Xiong,ZHAO Jin-Jian and YANG Li-Na. Implementation of Dynamic User Equilibrium Model Based on Ant Colony Algorithm[J]. Computer Systems& Applications, 2016, 25(1): 126-130
Authors:CAO Ji-Ying  AN Yi-Sheng  QIAO Xiong  ZHAO Jin-Jian  YANG Li-Na
Affiliation:College of Information Engineering, Chang'an University, Xi'an 710064, China,College of Information Engineering, Chang'an University, Xi'an 710064, China,School of Automation and Information Engineering, Xi'an University of Technology, Xi'an 710048, China,College of Information Engineering, Chang'an University, Xi'an 710064, China and College of Information Engineering, Chang'an University, Xi'an 710064, China
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.
Keywords:dynamic user equilibrium  ant colony algorithm  Frank-Wolfe algorithm
点击此处可从《计算机系统应用》浏览原始摘要信息
点击此处可从《计算机系统应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号