Research On Optimizing Logistic Distribution Routing Problem

Logistic distribution is an operation linking with consumer directly, and takes account for considerable proportion in variable costs in logistics. The planning of vehicle routing in distribution will take great effect on the efficiency, cost and benefit, especially in distributing for multi consumer. A scientific and reasonable method to vehicle scheduling is an important operation in logistic distribution.Optimizing logistic distribution routing is a NP-hard problem. High effective exact algorithm is impossible to it. This paper studies on the optimizing logistic distribution routing problem and solves the problem using improved ant colony algorithm successively.The thesis is organized as follows:Chapter 1: Discuss the basic problem about logistic distribution and the relative research works. The main research aim and our work are also introduced.Chapter 2: First, describe the logistic distribution problem with mathematic expressions. Then, discuss the expressions of the constraints in logistic distribution and build the mathematical model.Chapter 3: After introducing the ant colony algorithm (ACA), a flow chart of solving logistic distribution problem with ACA is given. The advantage and disadvantage of ACA are also discussed in this part.Chapter 4: To improve the ACA, several methods are proposed. The result of experiments demonstrates that the optimal or nearly optimal solutions to the logistic distribution routing can be easily obtained by improved ant colony algorithm.Chapter 5: Summarize all achievements of this dissertation, review innovation points and defects, and give the further work in the future.