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

求解车辆路径问题的改进遗传算法
引用本文:程林辉,王江晴.求解车辆路径问题的改进遗传算法[J].计算机工程与应用,2010,46(36):219-221.
作者姓名:程林辉  王江晴
作者单位:中南民族大学,计算机科学学院,武汉,430074
基金项目:国家自然科学基金,中南民族大学校基金
摘    要:车辆路径问题是一个典型的组合优化类问题,遗传算法是求解此类问题的方法之一。针对遗传算法容易出现“早熟”现象的问题,借鉴免疫算法通过抗体浓度抑制以保持种群多样性的优势以及模拟退火算法的个体选择策略,提出了一种改进的遗传算法,并将其用于解决车辆路径问题。实验验证了算法的有效性以及求解的效率和解的质量。

关 键 词:遗传算法  车辆路径问题  组合优化
收稿时间:2009-10-9
修稿时间:2009-11-26  

Improved genetic algorithm for vehicle routing problem
CHENG Lin-hui,WANG hang-qing.Improved genetic algorithm for vehicle routing problem[J].Computer Engineering and Applications,2010,46(36):219-221.
Authors:CHENG Lin-hui  WANG hang-qing
Affiliation:(College of Computer Science,South-Central University for Nationalities,Wuhan 430074,China )
Abstract:Vehicle routing problem is a typical combinational optimization problem.Genetic algorithm is one of the methods used to solve VRP.Aiming at the defects of premature convergence in the evolution process of genetic algorithmt,his thesis designs an improved genetic algorithmr,eferring the advantages of immune algorithm which uses antibody concentration re-striction to keep population diversity and the individual choice approach of simulated annealing algorithm.The improved ge-netic algorithm is used to solve VRP in the thesis.Some experiment data prove the effectiveness of the algorithm and authen-ticate the search efficiency and solution quality of the algorithm.
Keywords:genetic algorithm  vehicle routing problem  combinational optimization
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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