[1]李晓君,赵晓蕾,赵洪銮,等.一种改进的粒子群算法在交通分配上的应用[J].计算机技术与发展,2023,33(04):140-145.[doi:10. 3969 / j. issn. 1673-629X. 2023. 04. 021]
 LI Xiao-jun,ZHAO Xiao-lei,ZHAO Hong-luan,et al.Application of an Improved Particle Swarm Algorithm in Traffic Assignment[J].,2023,33(04):140-145.[doi:10. 3969 / j. issn. 1673-629X. 2023. 04. 021]
点击复制

一种改进的粒子群算法在交通分配上的应用()

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
33
期数:
2023年04期
页码:
140-145
栏目:
人工智能
出版日期:
2023-04-10

文章信息/Info

Title:
Application of an Improved Particle Swarm Algorithm in Traffic Assignment
文章编号:
1673-629X(2023)04-0140-06
作者:
李晓君1 赵晓蕾2 赵洪銮1 3 宿梦梦1 邹 炜1
1. 山东建筑大学 计算机科学与技术学院,山东 济南 250101;
2. 山东建筑大学 建筑城规学院,山东 济南 250101;
3. 天津城建大学 理学院,天津 300384
Author(s):
LI Xiao-jun1 ZHAO Xiao-lei2 ZHAO Hong-luan1 3 SU Meng-meng1 ZOU Wei1
1. School of Computer Science and Technology,Shandong Jianzhu University,Jinan 250101,China;
2. School of Architecture and Urban Planning,Shandong Jianzhu University,Jinan 250101,China;
3. School of Science,Tianjin Chengjian University,Tianjin 300384,China
关键词:
简化的粒子群算法非线性递减惯性权重莱维飞行单一 OD 对多路径路网用户最优模型
Keywords:
simplified particle swarm optimizationnonlinear decreasing inertia weightLevy flightsingle OD to multipath road networkuser equilibrium model
分类号:
TP301.6
DOI:
10. 3969 / j. issn. 1673-629X. 2023. 04. 021
摘要:
针对粒子群算法收敛速度慢、求解精度低和算法在迭代后期容易陷入局部最优的问题,首先,采用仅以位置项来控制粒子进化方向的简化粒子群算法,以此避免粒子速度过大时导致的粒子发散的现象;其次,引入随迭代次数增加自适应改变的线性惯性权重来消除惯性分量的影响,同时引入莱维飞行策略来改变粒子位置以帮助粒子逃离局部最优;最后,通过四种测试函数对固定权重的粒子群算法、标准粒子群算法和改进算法的性能进行比较。 实验证明,改进后的算法在收敛速度、精度和稳定性上都有所提升。 在验证了改进算法的有效性后,使用改进后的算法求解单一 OD 对多路径路网的用户最优模型并与标准粒子群算法求解结果进行对比,改进后的算法求解结果更加稳定均衡,验证了算法的可行性。
Abstract:
Aiming at the problems of slow convergence speed, low solution accuracy, and easy to fall into local optimum?
in the lateriteration of particle swarm optimization,we firstly adopt a simplified particle swarm optimization algorithm that only uses the positionterm to control the evolution direction of particles,so as to avoid the?
problem of particle divergence caused by excessive particle speed.Secondly,the linear inertia weight that adaptively changes with the increase of the number of iterations is introduced to eliminate theinfluence of?
the inertial component,and the Levy flight strategy is introduced to change the particle position to help the particle escapefrom the local optimum. Finally,through four test function,we compare the performance of?
fixed-weight particle swarm optimization,standard particle swarm optimization and improved algorithms. Experiments show that the improved algorithm has improved convergencespeed,accuracy and stability. After verifying the effectiveness of the improved algorithm,the improved algorithm is used to solve the userequilibrium model of a single OD to a multi-path road network and compared with the results of the standard particle swarm optimizationalgorithm. The results of the improved algorithm are more stable and balanced. The feasibility of the improved algorithm is verified.
更新日期/Last Update: 2023-04-10