Improved differential evolution algorithm for capacitated vehicle routing problem
Aiming at the vehicle routing problem with capacity,an improved differential evolution algorithm(IDE)was pro-posed.Firstly,a new perturbation strategy is proposed for mutation and cross operation,and two kinds of neighborhood operators are designed to accelerate the convergence of the algorithm.Secondly,a diversity protection strategy is designed to prevent popula-tion uniformity in the later stage of the algorithm.Finally,two penalty factors are designed based on individual and global conver-gence to effectively punish infeasible solutions.The effectiveness of the proposed algorithm is verified by the simulation experi-ments of three CVRP problem examples,and the results are compared with other algorithms.