Research On Vehicle Routing Problem Of Logistics Distribution Optimization Based On Ant Colony Algorithm

Logistics distribution is the core of the logistics and its key is vehicle routing optimization problem. Vehicle routing problem is widely used in transportation,logistics distribution, vehicle scheduling, industrial production scheduling and etc.Selecting a reasonable distribution route can improve the efficiency of logistics and reduce logistics cost. As efficiency of traditional logistics distribution is low but cost of it is high. There is pressing need of new scheme of vehicle routing optimization to reduce the vehicle distribution costs and improve the efficiency of logistics distribution.Vehicle routing optimization problem belongs to combinatorial optimization problems and its algorithm includes many and mainly divides into precision algorithm and heuristic algorithm, intelligent algorithm, etc. Traditional algorithm can only solve simple problems but more complex problems can be solved only through intelligent algorithm Ant colony algorithm is a kind of intelligent algorithm because it uses positive feedback principle and can accelerate optimization speed and convergence speed of the optimal solution more quickly. In this paper the ant colony algorithm is used to solve.TSP problem can be seen as a special case of vehicle routing problem(VRP) and on the basis of it much research on VRP problem is established. It is studied in this paper, its mathematical model is established, ant colony algorithm is used to solve it and simulation results is obtained by MATLAB.Then the concept, function and classification of the logistics distribution is introduced, etc. Thus it leads to vehicle routing optimization problem, and finally the different points between it and the TSP problem is compared.In this paper general vehicle routing problem is studied on the basis of predecessors’ research results. It found that delivery point of previous vehicle distribution problem is fixed and one car is through distribution point only once, as the distribution continued the goods on the vehicle is less and even light vehicle appear, so it leads to vehicles waste resources. In order to solve problems of distribution in the reality and to avoid or reduce the waste of transport resources a new scheme of vehicle routing optimization problem with carpooling is proposed in this paper and its mathematical model is established for concrete problems and then through examples of MATLAB simulation experimental conclusions are drawn. It indicates that this scheme can optimize VRP problem, improve the efficiency ofdistribution and reduce logistics cost, so it can be widely used in the fields related with vehicle routing optimization problem.