The Research On Optimization Of Transport Path Of Distribution Center

Following the fast development of market economy, as "The third source of profit", the logistics is day by day obvious to the economic activity influence, more and more brings to people's attention. In modern logistics, distribution is an important link directly connecting with consumers , and embodies the core competencies of enterprise. However, how to optimize the transport path of distribution center? this problem has been a hot topic which the scholar,consultation organization and the enterprise concern. Through the optimization of the transport path, we can improve the operational efficiency of enterprise and reduce distribution costs, achieve scientific logistics.This paper that based on the management, operations research, mathematics, science and related theory of systems science, completes the study of the optimization of the transport path on the basis of complete investigation, using dynamic programming, ACO algorithm, Saving mileage Algorithm and so on comprehensively. Dynamic programming is used to solve direct- distribution. ACO algorithm and saving mileage are used to solve distribution - distribution.Firstly, this paper introduces the logistics, distribution and the distribution center, and simple introduced the basic theory of modern logistics. To narrate the distribution ,this article in detail narrates the process of distribution,the relationship between distribution and transport. Distribution center is a logistics place realizing distribution function, and this article simply introduces categories of distribution center, with emphasis narrates the work link of distribution center, and finally putts forward the optimization concept and the principle of optimization about distribution transport path. Secondly, this paper analyzes and studies the problem of optimization about distribution center' transport path from two perspectives: one is direct-distribution and the other is distribution - distribution. On direct- distribution, the choice of path closely focus on the distribution network, our main Solving is the shortest Transport path in both certain and uncertain network. On uncertain network, through the construction of distribution network, we have proposed Shortest Path Search algorithm Based on the thinking of dynamic programming. On distribution-distribution, this paper establishes vehicle routing problem model from two perspectives: one is shortest transport path; the other is minimum transport costs. On the algorithm solving model, this paper introduces ACO algorithm, and makes a comparison between the ACO algorithm and other optimization algorithm, then points out its advantages. Finally, this paper uses improved ACO algorithm to solve vehicle routing problem model. ACO algorithm' main features are positive feedback and parallelism. Positive feedback makes the algorithm quickly discovered a better solution, and parallelism makes the algorithm easy to achieve parallel computing. But the algorithm easily trapped into local optimal solution and solved the problem more slowly, this paper constructed Max-Min ACO algorithm through the improvement and adjustment of ACO algorithm. Max-Min ACO algorithm Speeds up the convergence speed of Solution, and it can be faster convergence to the global optimal solution that has been verified by specific examples, all this reflects the relative superiority of improved ACO algorithm.