Double Populations Genetic Algorithm for Vehicle Routing Problem

The standard Genetic Algorithm has been applied into Vehicle Routing Problem, and it has the common defects of early convergence and easily falling into local minimization. According to it, the double populations genetic algorithm is applied into Vehicle Routing Problems. During the course of optimization, two populations is initialization, each has its probability of crossover and mutation. After every iteration, the two populations exchange the better chromosome. It can break the balance of inter-population in the local minimization and escape the local minimization. According to computational experiment result, the double populations algorithm find the optimal or nearly optimal solution effectively in comparison with other meta-heuristic algorithms. So, it is an efficient method for Vehicle Routing Problem.