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

带时间窗车辆路径问题的混合遗传算法
引用本文:刘志先.带时间窗车辆路径问题的混合遗传算法[J].钦州学院学报,2007,22(3):32-34.
作者姓名:刘志先
作者单位:钦州学院 数学与计算机科学系,广西 钦州535000
摘    要:针对标准遗传算法在解决带时间窗的车辆路径问题(VRPTW)时存在早熟收敛和易陷入局部极值点的特点,引入遗传算法与禁忌搜索结合的混合算法,同时对杂交算子进行了改进.算法既具有遗传算法的全局性和并行性,又具有禁忌搜索算法的爬山能力.实验表明,改进的混合算法具有计算效率高、收敛速度快等特点,是一种有效的方法.

关 键 词:车辆路径问题  遗传算法  时间窗  禁忌搜索  混合遗传算法
文章编号:1673-8314(2007)03-0032-03
修稿时间:2007-03-26

Hybrid Algorithm for Vehicle Routing Problem with Time Window
LIU Zhi-xian.Hybrid Algorithm for Vehicle Routing Problem with Time Window[J].Journal of Qinzhou University,2007,22(3):32-34.
Authors:LIU Zhi-xian
Institution:Dep. of Maths and Computer Science, Qinzhou University, Qinzhou 535000, China
Abstract:Considering the common defects of early convergence and easily falling into local minimization in solving Vehicle Routing Problem with standard Genetic Algorithm,the Genetic Tabu Search Algorithm(GTSA) was proposed to solve vehicle routing problems with time window,meanwhile,the crossover operator is improved.The new algorithm inherits the globalization and parallelism of genetic algorithm and the capability of mountain-climbing in tabu search algorithm.Experiments indicate that the improved hybrid algorithm is a effective approach characterized with excellent performance and rapid convergence.
Keywords:vehicle routing problem  genetic algorithm  time window  tabu search  hybrid genetic algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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