Research On Optimization Of Vehicle Routing Problem With Time Windows In Logistics Distribution Center

Vehicle Routing Problem is one of the most basic problems in combinatorial optimization, and it is also one of the most important research areas in logistics distribution in recent years. How to reduce transportation costs, improve transport efficiency and service quality, is significant for the entire logistics industry.This paper focuses on the study of vehicle routing problem with time windows. By analyzing the basic types, algorithms and the literature research of VRPTW, in addition to the limitations of time window and capacity constraints, this paper considers transport cost minimization and waiting time minimization into the VRPTW,and presents a bi-objective model. The core of this paper is to study the influence of uncertain factors in this model, and establish a robust corresponding model. We detailed discuss the situation when the uncertainty factors belong to an uncertainty set, and introduce two different robust optimization approaches: the robust optimization approach of Soyster, and the robust optimization approaches of Bental and Nemirovski. Then this paper allows that some uncertainty parameters, such as the demands of customers, travel time,service time, etc. are belong to an uncertainty polytope, and transform the bi-objective model under the uncertainty into its robust formulation.Finally, we use Genetic Algorithm to solve the model, and demonstrate the benefits of our robust optimization approach by analyzing the numerical experiments results.