[1]孙华灿,李旭宏,刘艳忠,等.容量限制分配的蚁群优化算法[J].东南大学学报(自然科学版),2009,39(1):177-180.[doi:10.3969/j.issn.1001-0505.2009.01.034]
 Sun Huacan,Li Xuhong,Liu Yanzhong,et al.Ant colony optimization arithmetic of capacity restraint traffic assignment[J].Journal of Southeast University (Natural Science Edition),2009,39(1):177-180.[doi:10.3969/j.issn.1001-0505.2009.01.034]
点击复制

容量限制分配的蚁群优化算法()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
39
期数:
2009年第1期
页码:
177-180
栏目:
交通运输工程
出版日期:
2009-01-20

文章信息/Info

Title:
Ant colony optimization arithmetic of capacity restraint traffic assignment
作者:
孙华灿1 李旭宏1 刘艳忠1 于世军2
1 东南大学交通学院,南京 210096; 2 南京理工大学机械工程学院, 南京 210094
Author(s):
Sun Huacan1 Li Xuhong1 Liu Yanzhong1 Yu Shijun2
1 School of Transportation, Southeast University, Nanjing 210096, China
2 School of Mechanical Engineering, Nanjing University of Science and Technology, Nanjing 210094, China
关键词:
交通分配 容量限制 蚁群算法 网络平衡 出行行为
Keywords:
traffic assignment capacity restraint ant colony algorithm network equilibrium travel behavior
分类号:
U491.123
DOI:
10.3969/j.issn.1001-0505.2009.01.034
摘要:
针对交通规划实践中广泛使用的用户出行行为假设与现实脱节的不足,提出了用蚁群优化算法获取网络流量加载路径的配流新思想.分析了网络中用户出行的行为特征并与蚁群算法执行机制进行了比较,提出利用人工蚂蚁模拟网络中用户出行的可行性和合理性.给出了基于Ant-Cycle模型的容量限制分配思路和流程.设计采用双层迭代机制完成整个交通分配过程:使用内迭代构建完整的流量加载路径; 使用外迭代对路段阻抗进行修正,体现网络的拥挤效应,使网络分配趋于平衡.仿真算例与对比分析表明:该方法可以模拟交通系统的平衡状态,分配结果趋近用户平衡; 算法合理、有效.
Abstract:
Due to the unconformity of users’ travel behavior assumption to the reality in traditional traffic assignment models, a novel capacity restraint traffic assignment method based on ant colony algorithm(ACA)is developed. General logic of users’ travel behavior in trip path making was analyzed and contrasted to the ACA execution mechanism; the feasibility and the rationality of using ants to simulate travelers in urban network were discussed. The approach with its flow chart based on ant-cycle model is presented. Double-iterating mechanism is designed in the process of traffic assignment. Inner-iterating is employed to search the path for loading traffics, while the outer-iterating is used to revise each link’s time cost so as to reflect the congestion of the whole network. An example comparing with a previous research on user equilibrium traffic assignment model in a directed traffic network was carried out. The simulation results demonstrate that the proposed solution is feasible, and it can explain the network equilibrium state appropriately.

参考文献/References:

[1] 俞礼军,严宝杰.两类交通分配模型算法的关系及其应用[J].西安公路交通大学学报,2001,21(2):74-76.
  Yu Lijun,Yan Baojie.The relation between two types of traffic assignment models’ algorithm and its application[J].Journal of Xi’an Highway University,2001,21(2):74-76.(in Chinese)
[2] 黎新华,侯桂荣,莫辉辉,等.容量限制的交通分配优化方法研究[J].中南公路工程,2005,30(4):116-118,128.
  Li Xinhua,Hou Guirong,Mo Huihui,et al.An optimal method for capacity-constrained traffic assignments[J].Journal of Central South Highway Engineering,2005,30(4):116-118,128.(in Chinese)
[3] Colormi A,Dorigo M,Maniezzo V.An investigation of some properties of an ant algorithm [C] //Proceedings of the Parallel Problem Solving from Nature Conference.Brussels,Belgium,1992:509-520.
[4] Dorigo M,Maniezzo V,Colorni A.Ant system:optimization by a colony of cooperating agents [J].IEEE Transactions on Systems,Man,and Cybernetics-Part B,1996,26(1):29-41.
[5] Dorigo M,Birattari M,Stutzle T.Ant colony optimization[J].Computational Intelligence Magazine,2006,1(4):28-39.
[6] 王玫,朱云龙,何小贤.群体智能研究综述[J].计算机工程,2005,31(22):194-196.
  Wang Mei,Zhu Yunlong,He Xiaoxian.A survey of swarm intelligence[J].Computer Engineering,2005,31(22):194-196.(in Chinese)
[7] Liu Zhishuo,Shen Jinsheng,Chai Yueting.Hybrid multiple ant colonies algorithm for capacitated vehicle routing problem[J]. Journal of System Simulation,2007,19(15):3513-3520.
[8] D’Acierno Luca,Montella Bruno,De Lucia Fortuna.A stochastic traffic assignment algorithm based on ant colony optimization[C] //The Fifth International Workshop on Ant Colony Optimization and Swarm Intelligence.Brussels,Belgium,2006:25-36.
[9] 徐勋倩,王亚萍.用蚂蚁算法处理固定需求交通平衡分配问题[J].南通工学院学报:自然科学版,2004,3(2):24-27.
  Xu Xunqian,Wang Yapin.Solving traffic equilibrium assignment problem of fixed traffic demand with ant algorithm[J]. Journal of Nantong Institute of Technology:Natural Science,2004,3(2):24-27.(in Chinese)
[10] 侯立文,蒋馥.一种基于蚂蚁算法的交通分配方法及其应用[J].上海交通大学学报,2001,35(6):930-933.
  Hou Liwen,Jiang Fu.Method of traffic allocation based on ant algorithm and its application[J]. Journal of Shanghai Jiaotong University,2001,35(6):930-933.(in Chinese)
[11] 王素欣,高利,崔小光,等.交通分配的粒子群优化算法[J].交通运输工程学报,2007,7(5):98-122.
  Wang Suxin,Gao Li,Cui Xiaoguang,et al.Particle swarm optimization arithmetic of traffic assignment[J]. Journal of Traffic and Transportation Engineering,2007,7(5):98-122.(in Chinese)

相似文献/References:

[1]王炜.多路径交通分配模型的改进及节点分配算法[J].东南大学学报(自然科学版),1994,24(6):21.[doi:10.3969/j.issn.1001-0505.1994.06.004]
 wang Wei.Improved Model of Multipath Assignment and Quick Algorithm───Node Assignment Algorithm[J].Journal of Southeast University (Natural Science Edition),1994,24(1):21.[doi:10.3969/j.issn.1001-0505.1994.06.004]
[2]王炜.路段交通量与O—D出行量互算关系的研究[J].东南大学学报(自然科学版),1988,18(1):68.[doi:10.3969/j.issn.1001-0505.1988.01.008]
 Wang Wei (Department of Civil Engineering).The Research on Mutual Calculation Relation between the Link Volumes and the O-D Trip Volumes[J].Journal of Southeast University (Natural Science Edition),1988,18(1):68.[doi:10.3969/j.issn.1001-0505.1988.01.008]
[3]黎冬平,陈峻,晏克非.带容量限制的城市出租车服务站点选址模型[J].东南大学学报(自然科学版),2009,39(2):394.[doi:10.3969/j.issn.1001-0505.2009.02.039]
 Li Dongping,Chen Jun,Yan Kefei.Location model for urban taxi service lots with capacity-limitation[J].Journal of Southeast University (Natural Science Edition),2009,39(1):394.[doi:10.3969/j.issn.1001-0505.2009.02.039]
[4]王炜,曲大义,朱中.城市交通网络综合平衡交通分配模型研究[J].东南大学学报(自然科学版),2000,30(1):117.[doi:10.3969/j.issn.1001-0505.2000.01.023]
 Wang Wei,Qu Dayi,Zhu Zhong.On the Models of Integrated-Equilibrium Trip Assignment in Urban Traffic Network[J].Journal of Southeast University (Natural Science Edition),2000,30(1):117.[doi:10.3969/j.issn.1001-0505.2000.01.023]
[5]蒋阳升,林曦,安定,等.考虑随机性和服务水平的地铁站自动售票机仿真优化配置[J].东南大学学报(自然科学版),2014,44(2):430.[doi:10.3969/j.issn.1001-0505.2014.02.036]
 Jiang Yangsheng,Lin Xi,An Ding,et al.Simulation optimization of ticket vending machines’ configuration in metro station considering randomness and level of service[J].Journal of Southeast University (Natural Science Edition),2014,44(1):430.[doi:10.3969/j.issn.1001-0505.2014.02.036]

备注/Memo

备注/Memo:
作者简介: 孙华灿(1982—),男,博士生; 李旭宏(联系人),男,博士,教授,博士生导师,lixuhong@seu.edu.cn.
引文格式: 孙华灿,李旭宏,刘艳忠,等.容量限制分配的蚁群优化算法[J].东南大学学报:自然科学版,2009,39(1):177-180.
更新日期/Last Update: 2009-01-20