-
摘要: 为了方便合理地分配交通量, 提出了交通量多路径分配的粒子群优化算法。算法的求解方法是在粒子群算法中构造了路径条数维的粒子空间, 每维对应一条可行性路线, 其值为对应路径所分配的交通量; 对粒子进行归一化处理, 使交通量守恒, 并进行交通量的多路径分配; 根据目标函数评价与筛选粒子, 直到满足终止条件。实例计算结果表明: 利用粒子群算法得到的目标函数值最小, 各路段分配的交通量没有超容量现象, 模型求解过程具有方向性, 对交通分配的网络规模无限制, 因此, 粒子群优化算法可行、合理。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.
-
[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.028Dong 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.021Ren 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.018Li 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.htmRen 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.htmXu 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.htmRen 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.020Si 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.htmYan 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.htmLiu 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 -
下载:
点击查看大图
图(2) / 表(4)
计量
- 文章访问数: 288
- HTML全文浏览量: 136
- PDF下载量: 831
- 被引次数: 0
