Partheno-genetic Algorithm Based on Polymorphic Mutation for Solving CVRP
Researchers proposed a partheno-genetic algorithm based on polymorphic mutation(PM-PGA)to solve the problems such as slow convergence and precocity when genetic algorithm was used to solve capacitated ve-hicle routing problem(CVRP).During the research process,the researchers grouped a variety of operators into lo-cal search,global search and random movement for population polymorphism,so as to enhance the population di-versity and improve the optimization ability.Meanwhile,the researchers adopted a hybrid jump strategy combining individual concentration control and Metropolis criterion so as to avoid falling into local optimality.Furthermore,the researchers designed an adaptive penalty function based on the number of iterations and vehicle overload so as to improve the quality of the solution.The result of simulation experiments on CVRP examples shows that the PM-PGA algorithm can significantly improve and enhance the convergence speed and solution accuracy.
万方数据
维普
