Algorithm 1. CSD_IACO.

Begin

Input();

Initial a max_ttl; Ant_count; Variable declaration;

while (step < max_ttl)

{

For (int i=0; i<ant_count; i++)

{

$\mathrm{M}\mathrm{I}\mathrm{N}\mathrm{\_}\mathrm{T}\mathrm{T}\mathrm{L}=\frac{\cos t_i}{\text{edge\_max\_speed}}$

pher_edge[i][ant[i][1]]=pher_edge[i][ant[i][1]]+dep_phr;

pher_edge[i][ant[i][1]]=pher_edge[i][ant[i][1]]-MIN_TTL*dep_phr;

}

for(int i=0;i<ant_count; i++)

next step(i);

step++;

end while

}

Best ant pheromone => detect maximum pheromone in all machine

Post process results and visualization;

end