Vehicle routing optimization algorithm based on time windows and dynamic demand

To provide the supplier with the minimizum vehicle travel distance in the distribution process of goods in three situations of new customer demand, customer cancellation service, and change of customer delivery address, based on the ideas of pre-optimization and real-time optimization, a two-stage planning model of dynamic demand based vehicle routing problem with time windows was established. At the pre-optimization stage, an improved genetic algorithm was used to obtain the pre-optimized distribution route, a large-scale neighborhood search method was integrated into the mutation operation to improve the local optimization performance of the genetic algorithm, and a variety of operators were introduced to expand the search space of neighborhood solutions; At the real-time optimization stage, a periodic optimization strategy was adopted to transform a complex dynamic problem into several static problems, and four neighborhood search operators were used to quickly adjust the route. Two different scale examples were designed for experiments. It is proved that the algorithm can plan the better route, and adjust the distribution route in time under the real-time constraints. Therefore, the proposed algorithm can provide theoretical guidance for suppliers to solve the dynamic demand based vehicle routing problem.