Optimization of VRR for Cold Chain with Minimum Loss Based on Actual Traffic Conditions

Algorithm 1

Initialize the coefficient variables and pheromone;

for iteration 1,…,M{

Initialize a taboo table and a start position for each ant.

for ant, 1,…,N{

Select the next node according to rules

The selected node is stored in the taboo table

If all nodes are stored in taboo tables, the iteration is completed, break;

The total cost is calculated

The local pheromone is updated

}

The global pheromone is updated

All ants’ total costs are compared

The current optimal solution is stored

}

The process is stopped and the current path with the shortest cost is output.