Multi-strategy Partheno-genetic Algorithm Based on Dynamic Reduction Mechanism for Solving CVRP Problem
Aiming at the problems of premature,slow convergence and low accuracy of traditional genetic algorithm in solving capacitated vehicle routing problem,a multi-strategy partheno-genetic algorithm based on dynamic reduction mechanism is proposed.The algorithm divides the optimization space based on similar individuals,and uses simulated annealing criterion to eliminate or update the lowest category subspace,which constitutes the reduction and movement mechanism of the optimization space.Based on partheno-genetic algorithm,a variety of genetic evolution strategies including intra-group,inter-group,global search,disturbance and jump strategy are designed Based on the three penalty factors of individual development,population evolution and overall convergence,the adaptive penalty function component is designed for the fitness function,which is more effective to punish the infeasible solution.Through the simulation experiments on three groups of CVRP problems,the results show that DRM-MSPGA algorithm is improved in population quality,global and local optimization ability,solution accuracy and convergence speed.
NETL
NSTL
万方数据
