| Distribution is an important element in modern logistics system. It includes picking up goods from distribution center and delivering goods to the customers on time. Among distribution business there are many optimizing strategies. The vehicle scheduling problem has great effect on improving distribution speed, quality of service and economy benefit. According to the number of distribution center, the vehicle scheduling problem can be divided into single-depot vehicle scheduling problem and multi-depots vehicle scheduling problem. The modern city logistics system usually has more than one depot. So this paper has both theoretical and practical value.As a NP-hard problem, the distribution routing plans of multi-depots vehicle scheduling problem will increase exponentially along with the adding of customers. So it becomes an important studying trend to solve the vehicle scheduling problem with heuristic algorithm. On the basis of building the model of multi-depots vehicle scheduling problem, this paper studies to solve the problem with ant colony algorithm.Focusing on multi-depots vehicle scheduling problem, this paper mainly includes the next contents:(1) This paper analyses the model of multi-depots vehicle scheduling problem solving with separation method, based on this analysis and combines with theory of holistic method , this paper introduces the model of multi-depots vehicle scheduling problem solving with the holistic method;(2) This paper adopts ant colony algorithm to solve the routing problem. At the same time combines with the separation method and holistic method this paper introduces the model of multi-depots vehicle scheduling problem solving with the ant colony algorithm.(3) Also this paper analyses the parameters of the ant colony algorithm, and improves the the ant colony algorithm based on Max-Min Ant System(4) Do research on the models introduced by this paper, and analyses the specialty of separation method and holistic method. |
PDF Full Text Request