Improvement of Genetic Algorithm for Vehicle Routing Problems with Time Windows

Vehicle routing problem with time windows (VRPTW) is of crucial importance in today´s industries, especially in logistics distribution. Improvement of genetic algorithm (GA) using an optimized crossover operator is proposed by a complete undirected bipartite graph in order to find an optimal set of delivery routes satisfying the requirements and giving minimal total cost. We tested our algorithm with benchmark instances and compared it with some other heuristics in the literature. The results showed that the proposed algorithm is competitive in terms of the quality of the solutions found. It can be concluded that the proposed algorithm is competitive when compared with other heuristics in the literature.