An Improved Genetic Algorithm for Vehicle Routing Problem

Evolutionary algorithms, including genetic algorithm, usually appear premature convergence. In this paper, new crossover and mutation operators are introduced. This paper addresses an application of improved genetic algorithms (IGA) for solving the Vehicle Routing Problem (VRP). After the introduction of new genetic operators, diversity of population becomes abundant. The ability of global search is obviously improved in new algorithm. Simulations indicate that new genetic algorithm is competitive with other modern heuristics.