| 改进的粒子群优化算法在随机需求车辆路径问题中的应用 |
| |
| 引用本文： | 王芳,丁海利,高成修.改进的粒子群优化算法在随机需求车辆路径问题中的应用[J].武汉大学学报(理学版),2007,53(1):41-44. |
| |
| 作者姓名： | 王芳 丁海利 高成修 |
| |
| 作者单位： | 武汉大学,数学与统计学院,湖北,武汉,430072 |
| |
| 摘 要： | 设计了一种求解随机需求车辆路径问题的改进的粒子群优化（PSO）算法．在算法后期将变异算子引入PSO算法，克服了基本PSO算法易陷入局部最优的缺点．数值模拟结果表明改进的PSO算法提高了全局搜索能力，求解效果优于基本PSO算法和遗传算法．
|
| 关 键 词： | 随机 车辆路径问题 变异算子 粒子群优化算法 |
| 文章编号： | 1671-8836(2007)01-0041-04 |
| 修稿时间： | 2006年2月14日 |
Advanced Particle Swarm Optimization for the Vehicle Routing Problem with Stochastic Demands |
| |
| WANG Fang,DING Haili,GAO Chengxiu.Advanced Particle Swarm Optimization for the Vehicle Routing Problem with Stochastic Demands[J].JOurnal of Wuhan University:Natural Science Edition,2007,53(1):41-44. |
| |
| Authors: | WANG Fang DING Haili GAO Chengxiu |
| |
| Abstract: | This paper studies the vehicle routing problem with stochastic demands(VRPSD),and devises an advanced PSO to solve this problem.By adding the mutation operator to the PSO algorithm in the later phase,the advanced PSO algorithm overcome the basic PSO's shortcoming of easily plunging into the local optimization.Experimental results indicate that the advanced PSO algorithm can improve the global convergence ability and is superior to basic PSO algorithm and genetic algorithm. |
| |
| Keywords: | stochastic vehicle routing problem mutation operator particle swarm optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
