Study On Multi-depots, Multi-distribution Centers Vehicle Routing Problems With Full-truckload

In this paper, two multi-depots, multi-distribution centers vehicle routing problem with full-truckload are researched.This paper is divided into five parts, Chapter 1 is an introduction, it introduces the background and the research status at home and abroad of the full-truckload vehicle routing problems, as well as introduces the main contents of this paper. Chapter 2 briefly describes the vehicle routing problem and the methods to solve it, especially the main theoretical method of GA. Chapter 3 studies a multi-depots, multi-distribution centers, semi-open vehicle routing problem with full-truckload, in this problem, the vehicles can return to the distribution center for secondary distribution if their driving distances are less or equal to the driving distance restriction, the mathematics model and the solving algorithm for this problem are given, the algorithm is realized by MATLAB, and an example is presented to illustrate the algorithm. Chapter 4 researches a multi-depots, multi-distribution centers, closed vehicle routing problem with full-truckload, the only difference between this problem and that in Chapter 3 is that the vehicles must be back to their starting depots after they finish their distribution tasks. The mathematics model for this problem is established, an algorithm to solve it is given, the algorithm is realized by MATLAB, and an example is presented to illustrate the algorithm. At the last of this paper, we summarize the problems studied in this paper and discuss the directions for future research.