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

求解车辆路径问题的改进微粒群优化算法
引用本文:肖健梅,李军军,王锡淮.求解车辆路径问题的改进微粒群优化算法[J].计算机集成制造系统,2005,11(4):577-581.
作者姓名:肖健梅  李军军  王锡淮
作者单位:上海海事大学,电气自动化系,上海,200135;上海海事大学,电气自动化系,上海,200135;上海海事大学,电气自动化系,上海,200135
基金项目:国家自然科学基金资助项目(60074004),上海市教育委员会科研重点项目(04FA02)。~~
摘    要:微粒群优化算法是求解连续函数极值的一个有效方法。研究了用该算法求解车辆路径的问题。设计了求解车辆路径问题的一种新的实数编码方案,将车辆路径问题转化成准连续优化问题,并采用罚函数法处理约束条件。应用该微粒群优化算法求解了多个车辆路径问题的算例,并与遗传算法和双种群遗传算法进行了比较。计算结果表明,该算法可以更有效地求得车辆路径问题的优化解,是解决车辆路径问题的有效方法。

关 键 词:车辆路径问题  微粒群优化  实数编码  组合优化
文章编号:1006-5911(2005)04-0577-05
修稿时间:2004年11月15

Modified particle swarm optimization algorithm for vehicle routing problem1
XIAO Jian-mei,LI Jun-jun,WANG Xi-huai.Modified particle swarm optimization algorithm for vehicle routing problem1[J].Computer Integrated Manufacturing Systems,2005,11(4):577-581.
Authors:XIAO Jian-mei  LI Jun-jun  WANG Xi-huai
Abstract:Particle Swarm Optimization (PSO) algorithm is a powerful method to find the extremum of a continuous numerical function. A method based on PSO was researched to solve the discrete Vehicle Routing Problem (VRP). The VRP was changed into a quasi-continuous problem by designing a new real coding. Constrained terms in VRP were processed by the penalty function. This proposed algorithm was applied to illustrate its higher searching efficiency in comparison with standard genetic algorithm & double populations genetic algorithm for VRP. Simulation results of several VRP examples demonstrated the effectiveness of this algorithm.
Keywords:vehicle routing problem  particle swarm optimization  real coding  combination optimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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