An Improving Genetic Algorithm for Vehicle Routing Problem with Time Windows

摘要

In this paper, the vehicle routing problem with time windows (VRPTW) was considered, and a mixed integer programming mathematic model of VRPTW was proposed in detail. Meantime, an improved genetic algorithm (IGA) was proposed to overcome the shortcomings of premature convergence and slow convergence of conventional genetic algorithm (GA). The novel crossover-operator、 swapping operator and inversion operator as the core of IGA were constructed to solve VRPTW. The experiment results showed that the IGA can solve VRPTW effectively.