Research On Two Periodic Vehicle Routing Problems

Modern logistics has been recognized as an important part of enterprise cost saving and competitive power, which has attracted more and more attention in recent years. Logistics will play an important role in the future market competition, and because most plans are drawn up periodically, so the periodic vehicle routing problem is more close to reality, thus it has been studied extensively.In this paper, two kinds of periodic vehicle routing problem are studied.The paper is divided into five parts. Chapter 1 introduces the research status of the periodic vehicle routing problem and the main contents of this paper. Chapter 2 introduces the vehicle routing problem, several classification methods, the constraint conditions of the vehicle routing problem and some algorithms for solving the periodic vehicle routing problem. Chapter 3 researches a periodic vehicle routing problem with backhauls, builds the nonlinear mixed integer programming model for this problem, then gives a improved C-W saving algorithm which is simple and easy operation to solve this problem, and implement the improved C-W saving algorithm by MATLAB. Finally, an example is given to illustrate the algorithm. Chapter 4 studies a multi-vehicles open periodic vehicle routing problem with fuel consumption, a nonlinear mixed integer programming model of this problem is given, and a improved nearest neighbor algorithm is presented, the algorithm is implemented by MATLAB, an example is given to illustrate the algorithm. At the end of this paper, the future research direction of the periodic vehicle routing problem is discussed.