车辆路径问题的一种先寻路后分组算法

针对车辆路径问题（VRP）设计了一种元启发式算法。引入先寻路、后分组的策略，首先对顾客点序列采用Lehmer编码，设计辅助算子进行变异操作，用差分进化算法求出基于所有节点的TSP解，然后根据运货量的约束条件将其切割成VRP解。再通过禁忌搜索改进解，得到的结果再次作为初始解之一进入算法循环。仿真计算得到了最优解，结果表明该算法是有效的。

A Route-first Cluster-second Heuristic for Vehicle Routing Problem

The paper presents a metaheuristic algorithm for vehicle routing problem based on a route-first cluster-second heuristic. Lehmer code is used to represent custom nodes for mutation operations before getting a hamilton circuit solution by differential. The set of TSP solutions are split into VRP solution set according to vehicle capacity constraints. Finally, the improved solution by tabu search is taken as one of the initial solutions to restart a new algorithm iteration. Best solutions are achieved in computational experiments, which demonstrates that the proposed method performs well.