VRP Based on Improved Niche Isolation Genetic Algorithm

With the problems that traditional genetic algorithm is easy to converge untimely, and its searching efficiency will be lower in later stage of evolution, the paper designs an improved niche isolation genetic algorithm. This algorithm is based on niche isolation genetic algorithm and adopts migrating operator and simulated annealing theory. It not only keeps the diversity of the group, but also avoids getting into partial optimization. Simulation experiments and validity analysis of the algorithm are also given. The results prove it has good performance in solving vehicle routing problems (VRP).