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

带时间窗车辆路径问题的混合粒子群算法
引用本文:张丽艳,庞小红,夏蔚军,吴智铭,梁硕.带时间窗车辆路径问题的混合粒子群算法[J].上海交通大学学报,2006,40(11):1890-1894,1900.
作者姓名:张丽艳  庞小红  夏蔚军  吴智铭  梁硕
作者单位:上海交通大学,自动化系,上海,200240
基金项目:国家自然科学基金资助项目(70071017)
摘    要:将粒子群优化算法与模拟退火算法结合,提出了一种求解车辆路径问题的混合粒子群算法.实例计算及与遗传算法比较的结果表明:应用混合粒子群算法可以快速地求得带时间窗车辆路径问题的优化解;该算法是一种求解离散组合优化问题的有效方法.

关 键 词:车辆路径问题  离散粒子群算法  模拟退火算法  混合粒子群优化算法
文章编号:1006-2467(2006)11-1890-05
收稿时间:2005-11-22
修稿时间:2005-11-22

A Hybrid Particle Swarm Optimization Algorithm for Vehicle Routing Problem with Time Windows
ZHANG Li-yan,PANG Xiao-hong,XIA Wei-jun,WU Zhi-ming,LIANG Shuo.A Hybrid Particle Swarm Optimization Algorithm for Vehicle Routing Problem with Time Windows[J].Journal of Shanghai Jiaotong University,2006,40(11):1890-1894,1900.
Authors:ZHANG Li-yan  PANG Xiao-hong  XIA Wei-jun  WU Zhi-ming  LIANG Shuo
Institution:Dept. of Automation, Shanghai Jiaotong Univ. , Shanghai 200240, China
Abstract:A novel hybrid particle swarm optimization(PSO) algorithm for vehicle routing problem(VRP) was proposed.The hybrid PSO,combined with a simulated annealing algorithm,can avoid being trapped in a local optimum by using probability searching.The experimental results prove the high efficiency of the hybrid PSO.It is supposed that the hybrid PSO will be an effective method for discrete combinatory problems.
Keywords:vehicle routing problem(VRP)  discrete particle swarm optimization  simulated annealing algorithm  hybrid particle swarm optimization algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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