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

基于改进粒子群算法的车辆路径问题研究
引用本文:罗耀.基于改进粒子群算法的车辆路径问题研究[J].交通科技与经济,2016(2):13-17.
作者姓名:罗耀
作者单位:兰州交通大学 交通运输学院,甘肃 兰州,730070
摘    要:针对标准粒子群算法在解决多维复杂优化问题中存在的“早熟”现象,以及算法后期出现的搜索精度下降、收敛速度降低等不足,对算法做出改进:引入微生物行为机制中的趋化、繁殖、迁移算子。最后,通过实例验证对比,表明改进粒子群算法在搜索效率和解的质量方面均优于遗传算法和基本粒子群算法。

关 键 词:车辆路径优化  时间窗  粒子群算法  细菌觅食算法

Research on Vehicle Routing Problem Based on Improved Particle Swarm Optimization Algorithm
Abstract:For the “premature” phenomenon of PSO in solving multidimensional complex optimization problems ,and those problems that appeared in the late of algorithm ,such as the reducing in the search accuracy and the insufficiency in the convergence rate and so on , the algorithm made improvements by introducing the chemotaxis ,breeding ,migration operator of microbial behavioral mechanisms .At last , verified by comparing instances , the improved particle swarm algorithm search efficiency in terms of quality of reconciliation are better than GA and PSO .
Keywords:vehicle routing problem  time windows  PSO  BFO
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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