New Genetic Algorithm for Min-Max Vehicle Routing Problem

Tailored to the individual demands and the diversified requirements in the real operation, this paper is focused on the min-max vehicle routing problem (MMVRP) to shorten the longest journey in the circuit. New genetic algorithm is used to get the optimization solution. First of all, use natural number coding so as to simplify the problem; apply insertion method so as to improve the feasibility of the solution. Secondly. use the individual amount control choice strategy so as to guard the diversity of group; apply improved route crossover operation to avoid destroying good gene parts. Finally, the good performance of improved algorithm can be proved by experiment calculation and concrete examples.