Research On Vehicle Routing Optimization Of Logistics Distribution Based On SA-ACO

With the in-depth development of the market economy, logistics, as " the third profit source ", plays an increasingly important role in production, distribution, circulation and consumption of various filed. As an important part of logistics which directly deals with customers, distribution makes a large portion in the cost of logistics. Distribution line makes a great impact on the delivery speed, cost and benefit especially that with a number of distribution users. Vehicle Routing with time window becomes a problem urgently needed to be solved. Therefore, the research on the optimization of vehicle routing with time window will be with certain theory meaning and practical value.Firstly, this thesis describes the research situation and problems, and introduces the basic theory of vehicle routing problem. Secondly, based on the vehicle routing problem with time window, this thesis analyzes the distribution characteristics and builds the relative cost functions in distribution. Then, in the perspective of distribution center, this thesis proposes a mathematical model to make the sum of the costs minimal. Thirdly, this thesis introduces the simulated annealing algorithm and the ant colony algorithm, and designs the simulated annealing algorithm-ant colony optimization algorithm to deal with the mathematical model proposed above. In the last, this thesis takes the distribution of supermarket chains in the city of Handan to be an instance, and verifies the feasibility and validity of the simulated annealing algorithm-ant colony optimization algorithm. In the instance, this thesis optimizes the distribution lines, vehicle scale and distribution time, and compares the result using the simulated annealing algorithm-ant colony optimization algorithm to the result using ant colony algorithm.