Ant Colony Algorithm Applies to the Optimization of Logistics Distribution Routine Problem
|School||Dalian Maritime University|
|Course||Management Science and Engineering|
|Keywords||Distribution routine Optimization Ant Colony Algorithm|
In the facets of logistics, distribution occupies the important position. The business enterprises not only make profits by this facet but also touch with the customer directly through this facet. The rise of the electronic commerce and the fast development of the Internet make logistic distribution incline to the diversification, namely small batch quantity and many batch begins to appear in the distribution of goods. The quality of the distribution, will affect the profits, figures of the business enterprises directly, and the customers’ satisfaction etc. Actually, there are so many factors which will influence the distribution, such as the establishment of the distribution plans, the establishment of the routine, goods whether arrive on time, Goods quantity whether exactitude and so on.The problem of optimizing logistics distribution routine is one of the most important problems in the distribution processes. Exploring the distribution routine always bases on the short path assisting time as the restriction conditions. King etc. make the research express that 6 % of the distribution distance and 12 % of the time have been lost. There are lots of factors which influence the problem, this paper mainly discusses from the angle of "send". Aiming at optimization the choice of the distribution routine, analysis some factors which relate to the problem, this paper establishes the mathematics model which matches the fact and converts the qualitative problem into quantitative problem.Ant colony optimization （ACO） algorithm is a new heuristic solution to the combinatorial optimization problem. Owing to its positive feedback and effective parallelization and strong lustiness, ACO has been applied in many fields. It is the point research problems of this paper that applying ant colony algorithm to solve the optimization of logistics distribution routine problem. Researching of actual meaning of the parameters in the ant colony system and the improvement of the parameters, we propose the solution of the logistics distribution problem base on ant colony algorithm.At last, we verify the accuracy by the system simulation. The result of the simulation shows that this algorithm can find an optimized routine under the restriction conditions, avoid unreasonable routine for drivers and provide some suggestions tologistics enterprises.