基于遗传算法的车辆路径规划问题研究

The Research of the Model for Vehicle Routing Problem Based on Genetic Algorithm

本文研究了基于遗传算法(GA)的车辆路径规划问题(VRP),对传统遗传算法做了适当的改进,提出了邻域搜索的GA算法,采用独特的初始种群构成方法并通过站队替换法维持种群的规模。实验结果表明,该算法与拟退火及禁忌搜索算法相比具有优势。

This study considers the application of a genetic algorithm （GA） to the basic vehicle routing problem （VRP）. A hybrid of this GA with neighborhood search methods is different from the traditional GA. The hybrid GA carries out, with the initial population by a special means. The ranking replacement method is used, so that the size of the population remains constant. The experimental result show that the hybrid GA is competitive with tabu search and simulated annealing.