首页 | 官方网站   微博 | 高级检索  
     

车辆路径问题的并行粒子群算法研究
引用本文:马慧民,吴勇,叶春明.车辆路径问题的并行粒子群算法研究[J].上海理工大学学报,2007,29(5):435-439,444.
作者姓名:马慧民  吴勇  叶春明
作者单位:1. 上海电机学院,经济管理学院,上海,200245
2. 上海理工大学,管理学院,上海,200093
基金项目:上海市高校选拔培养优秀青年教师科研项目;上海市重点学科建设项目
摘    要:设计了一种引入了模拟退火机制的并行粒子群算法.该算法结合了基本粒子群优化算法的快速寻优能力和模拟退火算法的概率突跳性,避免了基本粒子群优化算法易于陷入局部最优的缺点,提高了进化后期算法的收敛精度.将该算法用于解决车辆路径问题,实验结果表明该算法具有较好的性能.

关 键 词:并行粒子群算法  模拟退火机制  车辆路径问题
文章编号:1007-6735(2007)05-0435-05
修稿时间:2006-11-17

Research on parallel particle swarm optimization algorithm for vehicle routing problem
MA Hui-min,WU Yong,YE Chun-ming.Research on parallel particle swarm optimization algorithm for vehicle routing problem[J].Journal of University of Shanghai For Science and Technology,2007,29(5):435-439,444.
Authors:MA Hui-min  WU Yong  YE Chun-ming
Affiliation:1. Business School, Shanghai Dianji University, Shanghai 200245, China ; 2. Business School, University of Shanghai for Science and Technology, Shanghai 200093, China
Abstract:The proposed parallel particle swarm optimization(PSO) algorithm combines the fast optimum search ablity of original PSO with probability jump property of simulated annealing(SA).It can avoid trapping to local minima as compared with original PSO and improve the accuracy in the later evolution period.The proposed algorithm was applied to the vehicle routing problem.The experiment results verify that the new algorithm is effective.
Keywords:parallel particle swarm optimization  simulated annealing mechanism  vehicle routing problem
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《上海理工大学学报》浏览原始摘要信息
点击此处可从《上海理工大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号