The route optimization in logistic distribution based on improved ant colony algorithm

The calculation of the vehicle routing optimization in logistic distribution is a very complicated problem. Based on the conditional multi-vehicle logistic distribution model, this paper uses the improved ant colony algorithm to solve the problem of selecting the best route in the process of logistic distribution. By improving the updating rule of the overall pheromone and the local pheromone and comparing it to the traditional MAX-MIN ant colony algorithm, it can enhance the convergence speed of the algorithm and the overall searching capabilities. Finally, the paper successfully applies the improved ant colony algorithm to the optimization of multi-vehicle routing and scheduling in logistic distribution.