Volume 7 Issue 5
. 
Turn off MathJax
Article Contents
Article Navigation >  Journal of Traffic and Transportation Engineering  > 2007  >  7(5): 97-100
WANG Su-xin, GAO Li, CUI Xiao-guang, CHEN Xue-mei, GU Li-fang. Particle swarm optimization arithmetic of traffic assignment[J]. Journal of Traffic and Transportation Engineering, 2007, 7(5): 97-100.
Citation: WANG Su-xin, GAO Li, CUI Xiao-guang, CHEN Xue-mei, GU Li-fang. Particle swarm optimization arithmetic of traffic assignment[J]. Journal of Traffic and Transportation Engineering, 2007, 7(5): 97-100.
shu

Particle swarm optimization arithmetic of traffic assignment

  • 1.

    School of Mechanical and Vehicular Engineering, Beijing Institute of Technology, Beijing 100081, China

  • 2.

    Beijing Chinasoft International Information Technology Co.Ltd., Beijing 100081, China

  • 3.

    Hebei Deli Engineering Design Consultation Co.Ltd., Shijiazhuang 050021, Hebei, China

More Information
  • Author Bio:

    Wang Su-xin(1976-), female, doctoral student of engineering, +86-335-8075125, wsx96@126.com

    Gao Li(1959-), male, professor, +86-10-68914582-12, ligaobit@bit.edu.cn

  • Received Date: 2007-01-21
  • Publish Date: 2007-10-25
    Abstract
  • In order to assign traffic volume rationally and expediently, a particle swarm optimization arithmetic (PSOA) of traffic volume multipath assignment was put forward.In the arithmetic, multidimensional particle space was constructed, every dimension was a feasible path, and its value was the assigned traffic volume on corresponding path; particle was united to make traffic volume conservation, and traffic volume multipath assignment was processed by PSOA; particles were circularly evaluated and filtered according to an optimal aim function, so that terminating qualification was satisfied.Computation result shows that the aim function value gained by using the arithmetic is least, the assigned traffic volume of every path is its capacity, the solving process of the arithmetic has optimization direction property and has no limit to net scale, so the arithmetic is feasible and rational.

     

    • FullText(HTML)
  • loading
    • References(15)
  • [1]
    Li Feng, Wang Shu-ning. Determining route traffic flows for traffic assignment problem with Frank-Wolfe algorithm[C]//IEEE. Proceedings of IEEE Intelligent Vehicles Symposium. Las Vegas: IEEE Press, 2005: 669-673.
    [2]
    董敬欣, 吴建平. 基于神经网络的交通平衡求解算法[J]. 系统仿真学报, 2005, 17(6): 1 380-1 383. doi: 10.3969/j.issn.1004-731X.2005.06.028

    Dong Jing-xin, Wu Jian-ping. Solution of traffic equilibrium status with neural network[J]. Journal of System Simulation, 2005, 17(6): 1 380-1 383. (in Chinese) doi: 10.3969/j.issn.1004-731X.2005.06.028
    [3]
    任刚, 王炜. 基于转向的Logit交通分配算法[J]. 交通运输工程学报, 2005, 5(4): 101-105. doi: 10.3321/j.issn:1671-1637.2005.04.021

    Ren Gang, Wang Wei. Turn-based algorithm for Logit traffic assignment[J]. Journal of Traffic and Transportation Engineering, 2005, 5(4): 101-105. (in Chinese) doi: 10.3321/j.issn:1671-1637.2005.04.021
    [4]
    李军, 辛松歆, 蔡铭. 基于拓扑处理的Logit型网络加载算法[J]. 中国公路学报, 2005, 18(4): 87-90. doi: 10.3321/j.issn:1001-7372.2005.04.018

    Li Jun, Xin Song-xin, Cai Ming. Algorithm for Logit network loading problem based on topological sorting[J]. China Journal of Highway and Transport, 2005, 18(4): 87-90. (in Chinese) doi: 10.3321/j.issn:1001-7372.2005.04.018
    [5]
    任刚, 王炜. 可直接计算转向流量的改进型DI AL交通分配算法[J]. 中国公路学报, 2005, 18(4): 83-86. https://www.cnki.com.cn/Article/CJFDTOTAL-ZGGL200504016.htm

    Ren Gang, Wang Wei. Improved DIAL's traffic assignment algorithm for directly computation on turning flows[J]. China Journal of Highway and Transport, 2005, 18(4): 83-86. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-ZGGL200504016.htm
    [6]
    Li Run-mei, Li Wei. The application of genetic algorithm to dynamic traffic assignment[C]//IEEE. Proceedings of IEEE Intelligent Vehicles Symposium. Las Vegas: IEEE Press, 2005: 827-832.
    [7]
    徐勋倩, 王亚萍. 用蚂蚁算法处理固定需求交通平衡分配问题[J]. 南通工学院学报: 自然科学版, 2004, 3(2): 24-27. https://www.cnki.com.cn/Article/CJFDTOTAL-NGZK200402007.htm

    Xu Xun-qian, Wang Ya-ping. 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) https://www.cnki.com.cn/Article/CJFDTOTAL-NGZK200402007.htm
    [8]
    Mahut M. A heuristic algorithm for simulation-based dynamic traffic assignment[C]//IEEE. Proceedings of IEEE Intelligent Transportation Systems. Vienna: IEEE Press, 2005: 239-244.
    [9]
    任刚, 王炜. 带转向延误的非对称多模式用户平衡模型及算法[J]. 中国公路学报, 2006, 19(2): 80-85. https://www.cnki.com.cn/Article/CJFDTOTAL-ZGGL200602013.htm

    Ren Gang, Wang Wei. Model and algorithm for asymmetric multimodal user equilibrium with turn delays[J]. China Journal of Highway and Transport, 2006, 19(2): 80-85. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-ZGGL200602013.htm
    [10]
    四兵锋, 孙壮志, 赵小梅. 基于随机用户平衡的混合交通网络流量分离模型[J]. 中国公路学报, 2006, 19(1): 93-98. doi: 10.3321/j.issn:1001-7372.2006.01.020

    Si Bing-feng, Sun Zhuang-zhi, Zhao Xiao-mei. Mixed traffic network flow-split model based on stochastic user equilibrium[J]. China Journal of Highway and Transport, 2006, 19(1): 93-98. (in Chinese) doi: 10.3321/j.issn:1001-7372.2006.01.020
    [11]
    颜佑启, 欧阳建湘. 最短路-最大流交通分配法[J]. 中国公路学报, 2005, 18(4): 91-95. https://www.cnki.com.cn/Article/CJFDTOTAL-ZGGL200504018.htm

    Yan You-qi, Ouyang Jian-xiang. Traffic volume assignment method with maximum flow of minimum distance[J]. China Journal of Highway and Transport, 2005, 18(4): 91-95. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-ZGGL200504018.htm
    [12]
    Kennedy J, Eberhart R C. Particle swarmopti mization[C]//IEEE. Proceedings of IEEE International Conference on Neural Networks. Piscataway: IEEE Press, 1995: 1 942-1 948.
    [13]
    Eberhart R C, Shi Y. Particle swarmopti mization: developments, applications and resources[C]//IEEE. Proceedings of the 2001 Congress on Evolutionary Computation. Piscataway: IEEE Press, 2001: 81-86.
    [14]
    Maurice C, Kennedy J. The particle swarm-explosion, stability, and convergence in a multidi mensional complex space[J]. IEEE Transactions on Evolutionary Computation, 2002, 6(1): 58-73. doi: 10.1109/4235.985692
    [15]
    刘炳全, 黄崇超. 一种新的路径生成式Logit交通分配算法[J]. 系统工程, 2006, 24(2): 41-45. https://www.cnki.com.cn/Article/CJFDTOTAL-GCXT200602008.htm

    Liu Bing-quan, Huang Chong-chao. A novel path-generating Logit traffic assignment algorithm[J]. Systems Engineering, 2006, 24(2): 41-45. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-GCXT200602008.htm
    • Relative Articles
    • Supplements(0)
    • Cited By
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索
    Get Citation
    PDF
    XML

    Article Metrics

    Article views (239) PDF downloads(828) Cited by()
    Proportional views
    Related

    Copyright《Journal of Traffic and Transportation Engineering》编辑部陕ICP备05001904号-1

    Address ：Editorial Department of Journal of Traffic and Transportation Engineering, Chang 'an University, Middle Section of South Second Ring Road, Xi 'an, Shaanxi（710064） Tel：029-82334388 Email：jygc@chd.edu.cn

    All visit:Today's visit:

    Supported by: Beijing Renhe Information Technology Co. Ltd    

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return