An Improved Genetic Algorithm for Vehicle Routing Problem of Non-full Load

摘要

The vehicle routing problem is a classical NP(Non-deterministic Polynomial) problem, and it is usually difficult to obtain the satisfied solution by the traditional method. On the basis of analysis of the existing genetic algorithm, the vehicle routing problems is solved through the improved mutation operator and the genetic algorithm of natural number coding scheme. Experiment result indicates that the algorithm can compute the optimal solution rapidly and it is an effective algorithm.