Research On Several Types Of Vehicle Scheduling Problems

The vehicle scheduling problem has widely applied in the real life, and is also an important sector of the modern logistics distribution system. Thus, this paper has both theoretical and practical value. Several types of vehicle scheduling problems are discussed. The main results are listed in the following.In chapter 2, according to the characteristic of VSP with time window, the vehicles scheduling model with the capacity and time window restricted is found. The improved genetic algorithm is presented to solve it. By using the penalty function method, the time window and vehicle capacity restraints are turned to the objective functions. This algorithm also adopts the biggest retention cross to retain the fine characteristic of father generation. Numerical examples illustrate that the obtained algorithm is feasible and efficient.In chapter 3, the vehicles scheduling problem of logistics distribution without time requirement is also called the vehicle routing problem (VRP). This paper presents a hybrid particle swarm optimization algorithm (HPSO) to solve VRP. A chance -constraint model with the capacity of vehicle is founded. The VRP is changed into a quasi-continuous problem by designing a real number coding. Combined with dynamic neighborhood operator and the weight value of variable inertia, the obtained HPSO can find the global optimum. The results are compared with both standard PSO and genetic algorithm.In chapter 4, considering the vehicle scheduling problem of the emergency system, for multi-resource continuous consumption emergency system, a bi-level optimal mathematical model based on"the earliest emergency start-time"and"the fewest number of selected depots"is established. According to the degree of emergency demand, a certain weight for each resource is endowed. Thus emergency resources are arranged in a certain order. The algorithm based on the earliest emergency start-time and continuous consumption is proposed by using the given criteria, and the optimal scheduling scheme is obtained.Finally, this paper points out the problems of the further research.