基于GCOA算法的带时间窗车辆路径规划问题研究

Research on Vehicle Routing Problem with Time Windows Based on GCOA Algorithm

GCOA算法是对遗传算法的重大改良,不仅加快了遗传算法的收敛速度,而且从一定程度上避免了遗传算法陷入局部最优,并增大了遗传算法获得最优解的能力。本文首先介绍了GCOA算法,然后通过具体问题的解决对比传统遗传算法与GCOA算法,得出GCOA算法在收敛速度及结果优化两方面的有效性,最后将GCOA算法应用于求解VRPTW问题上,得出最优化结论。

The GCOA algorithm is an important improvement of the genetic algorithm,which not only speeds up the convergence speed of the genetic algorithm,but also avoids the genetic algorithm falling into the local optimum to some extent,and increases the ability of the genetic algorithm to obtain the optimal solution.This paper first introduced the GCOA algorithm,and then,by comparing the traditional genetic algorithm and GCOA algorithm through the solution of specific problems,obtained the effectiveness of GCOA algorithm in convergence speed and result optimization;finally,GCOA algorithm was applied to solve VRPTW problem,and obtained the optimization conclusion.