求解车辆路径问题的改进遗传算法  

Improved genetic algorithm for vehicle routing problem

作　　者：程林辉[1] 王江晴[1] 

机构地区：[1]中南民族大学计算机科学学院,武汉430074

出　　处：《计算机工程与应用》2010年第36期219-221,共3页Computer Engineering and Applications

基　　金：国家自然科学基金(No.60842004);中南民族大学校基金项目(No.YZQ07016)~~

摘　　要：车辆路径问题是一个典型的组合优化类问题,遗传算法是求解此类问题的方法之一。针对遗传算法容易出现"早熟"现象的问题,借鉴免疫算法通过抗体浓度抑制以保持种群多样性的优势以及模拟退火算法的个体选择策略,提出了一种改进的遗传算法,并将其用于解决车辆路径问题。实验验证了算法的有效性以及求解的效率和解的质量。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.

关 键 词：遗传算法 车辆路径问题 组合优化 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]