Research on Open Vehicle Routing Problem with Time Windows Based on Improved Genetic Algorithm

According to the open vehicle routing problem (OVRP), a vehicle is not required to return to the distribution depot after servicing the last customer on its route. In this paper, the open vehicle routing problem with time windows (OVRPTW) is considered, and a mixed integer programming mathematic model of OVRPTW 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 OVRPTW. The experiment results show that the IGA can solve OVRPTW effectively.