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

遗传算法求解VRP问题
引用本文:李向阳.遗传算法求解VRP问题[J].计算机工程与设计,2004,25(2):271-273,276.
作者姓名:李向阳
作者单位:华南理工大学,计算机科学与工程学院,广东,广州,510641
摘    要:在分析了许多求解固定车辆路径问题的优化算法后,提出了一种新的求解固定车辆路径问题的遗传算法。该算法的核心在于构建一种新的染色体编码,并且将“Inver-0ver”遗传操作算子与禁忌搜索算法结合起来,利用种群的信息引导种群的进化。引入动态非法检测来淘汰不合法个体,扩展了解空间并加快了搜索速度。经过大量的实例测试,该遗传算法增强了群体演化的质量,提高了算法收敛速度,能够找到比较好的近似最优解。

关 键 词:遗传算法  VRP问题  车辆路径问题  数学模型  禁忌搜索算法
文章编号:1000-7024(2004)02-0271-03

Genetic algorithm for VRP
LI Xiang-yang.Genetic algorithm for VRP[J].Computer Engineering and Design,2004,25(2):271-273,276.
Authors:LI Xiang-yang
Abstract:Based on the analysis of previous algorithms for VRP, a solution based on genetic algorithm is presented. Since the core of the genetic algorithm is the new construction of chromosome code and the combination of "Inver-Over" operator and tabu search. Dynamic illegal checking is proposed to expand solution space and accelerate search velocity. Many experimental results demonstrate that the new genetic algorithm has great robustness for VRP and optimal solutions have also been found.
Keywords:genetic algorithm  vehicle routing problem  inver-over operator  tabu search  dynamic illegal checking
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号