Research On Multi-depot Vehicle Routing Problem With Loading Constraints

Vehicle routing problem is the key problem in the logistics distribution optimization. It is crucial for reducing logistics cost, increasing the logistics efficiency, improve logistics service quality. For many years, vehicle routing problem has spawned many branches, one of them is multi-depot vehicle routing problem. Since multi-depot vehicle routing problem has been put forward, it was got the extensive attention of scholars, and abundant research results have been achieved after decades of research. But, the research of multi-depot vehicle routing problem seldom consider the loading constraints of the commodity. In the real distribution activities, there are various constraints about commodity loading, such as three-dimensional loading constraints, loading direction constraints, loading position constraints, volume constraints, first in last out constraints, loading stability constraints and loading fragility constraints, etc. Multi-depot vehicle routing problem which doesn’t take a full consideration of loading constraints may lead to the high cost and low efficiency of distribution activity.This thesis studies deeply about the model and algorithm of multi-depot vehicle routing problem with loading constraints. The main research work is as follows:First of all, introduce the thesis background, analyze both the domestic and foreign research status of multi-depot vehicle routing problem, loading problem and the research status of vehicle routing problem with loading constraints, put forward the research purpose and significance, expound research content and the section on schedule.Second, conduct the overall research of multi-depot vehicle routing problem with loading constraints. Expound the elements of multi-depot vehicle routing problem with loading constraints, analyze the modeling methods and solving algorithms of multi-depot vehicle routing problem with loading constraints, and put forward the research framework of multi-depot vehicle routing problem with loading constraints.Then, carry on the research of modeling methods and solving algorithms of multi-depot vehicle routing problem with loading constraints. Describe multi-depot vehicle routing problem with loading constraints, set up its mathematical model, and establish the heuristic algorithms based on the customers assignments, vehicle routing construction and commodity loading examination to get the initial solution of the heuristic algorithms, and use taboo search algorithm to search optimization of the whole solution space to obtain the satisfactory solution of multi-depot vehicle routing problem with loading constraints.Finally, application case. Solve the multi-depot vehicle routing problem with loading constraints of Enterprise Y by using the model and the hybrid taboo search algorithm, analyze the results, verify the feasibility and effectiveness of the model and algorithm and its project application value.