Solving Vehicle Routing Problem Based on Improved Genetic Algorithm

Abstract

In recent years, logistics distribution vehicle routing problem is a hot topic in logistics research. It is a NP problem and hard to get an optimal and satisfactory solution. The paper introduces removing-addition operator and excellent individual memory mechanism to the traditional genetic algorithm, so that the improved genetic algorithm can kee excellent individuals and maintain the population diversity The results of numerical simulation show that the improve genetic algorithm can make up the defects of the geneti algorithm easy to fall into local optimal solution and slow convergence speed, and effectively solve the logistics distribution vehicle routing problem.