Research And Application On Multi-depot Vehicle Scheduling Problem Based On Genetic Simulated Annealing Algorithm

Recent years, logistics considered as"third profit resource"has been developing rapidly. Among distribution business there are many optimizing strategies. And the optimizing vehicle routing and scheduling problem is the key part of logistics. Taking into account the research situation of the domestic and international vehicle routing problem and the logistics characteristics of China, we have done some researches and explorations on the models and algorithms of multi-depot and heterogeneous-vehicle vehicle routing problem with time windows, and developed a simulation system of the logistics delivery vehicle routing and scheduling to verify its effectiveness. This paper mainly includes the next contents:(1)This paper builds the model of multi-depot and heterogeneous-vehicle vehicle routing problem with time windows based on natural description.(2)We considered multi-depot and heterogeneous-vehicle vehicle routing problem as a complex combination optimization to solve. The aim at that problem, we constructed an improved genetic algorithm to solve it. On the other hand, an improved Route Crossover operator (RC') is introduced, though experiment and analysis, whose efficiency and performance is superior to single-point Crossover operator.(3) At length, a simulation system of optimizing scheduling logistic vehicles is developed.