Research on Cold Chain Logistics Distribution Route Based on Ant Colony Optimization Algorithm

Algorithm 1

Establishing the optimal logistics distribution path optimization problem corresponding to the directed graph.

	Initialize the ant colony, place all ants on the node respectively, and the initial pheromones on all paths are the same;
Iteration times NC = 0;
Calculate the probability of each ant choosing the next crawling node, and crawl to the next node according to the calculation results;
Update the pheromone on the path between adjacent nodes;
Update the pheromone on the entire path after all ants crawl the entire path;
Iteration times NC = NC + 1;
: then, output the optimal logistics distribution path;