Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (36): 219-221.DOI: 10.3778/j.issn.1002-8331.2010.36.061

• 工程与应用 • Previous Articles     Next Articles

Improved genetic algorithm for vehicle routing problem

CHENG Lin-hui,WANG Jiang-qing   

  1. College of Computer Science,South-Central University for Nationalities,Wuhan 430074,China
  • Received:2009-10-09 Revised:2009-11-26 Online:2010-12-21 Published:2010-12-21
  • Contact: CHENG Lin-hui

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

程林辉,王江晴   

  1. 中南民族大学 计算机科学学院,武汉 430074
  • 通讯作者: 程林辉

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 algorithm,this thesis designs an improved genetic algorithm,referring the advantages of immune algorithm which uses antibody concentration restriction to keep population diversity and the individual choice approach of simulated annealing algorithm.The improved genetic algorithm is used to solve VRP in the thesis.Some experiment data prove the effectiveness of the algorithm and authenticate the search efficiency and solution quality of the algorithm.

Key words: genetic algorithm, vehicle routing problem, combinational optimization

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

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

CLC Number: