关键词: 差分进化算法, 车辆路径问题, 贪心算法, NP问题, 进化算法

Abstract: As a new kind of evolutionary algorithm, Differential Evolution（DE） algorithm with the characteristics of remembering individual optimal solution and information sharing can be regarded as a real coded and excellent security greedy genetic algorithm. To solve the Vehicle Routing Problem（VRP）, which belongs to NP problems, the paper puts forward an improved differential evolution algorithm. A greedy algorithm is used to generate the initial population, legalized method is used to repair mutation, improved order crossover is used, then, after the mutation operator, a new selection mechanism is added in. The new algorithm is implemented in Matlab, the experimental results show that the improved differential evolution algorithm can efficiently solve the VRP.

Key words: Differential Evolution（DE）, Vehicle Routing Problem（VRP）, greedy algorithm, NP problem, evolutionary algorithm