Genetic Algorithm for Vehicle Routing Problem with Time Windows

In this paper,we apply genetic algorithm to solve the vehicle routing problem with time windows.The traditional crossover operators,such as PMX,ER and CX lose their power if used for problems with multiple constraints. A directly encoding method is used and a new crossover operator based upon precedence relationship is proposed. The experimental results show that this genetic algorithm can suit for solving complexity problems.