Research On Vehicle Routing Problem With Soft Time Window

The vehicle routing problem is one of the most difficult problems of transport distribution and one important part of the logistics system optimization. For this, the domestic and overseas scholars make much extensive and in-depth research, and put forward solutions under different conditions. Every method has its advantages and disadvantages, also has its limitation and obstacle on application. It is an important research subject that how to effectively make full use of these methods to solve the actual problem, and serve the logistics distribution practice. Based on the complexity and diversity of the vehicle routing problem, to use the related software will be a necessary trend.In this paper, we study a vehicle routing problem with single distribution center, single car model, multiple suppliers and soft time windows. Firstly, we review the research of vehicle routing problem at home and abroad, especially for the VRP with soft time windows. Then introduce the general situation of logistic distribution center and vehicle problem. Next according to the problem we study, building the mathematical model. Lastly explain the Tabu search algorithm to solve the model in detail. Combining with a study case using MATLAB software. verify the effectiveness of the proposed model and algorithm.