IET Computers & Digital Techniques

Research Article

A Fast Fully Parallel Ant Colony Optimization Algorithm Based on CUDA for Solving TSP

Algorithm 3

Roulette selection mechanism.
 Begin:
  accumulative matrix V_csum [0] ← probability matrix P [0]
  for i:2 to number of unvisited cities
  V_csum [i] ← V_csum [i-1] + P [i]
  end for//calculating accumulative matrix
  flag ← -1
  for i:1 to number of unvisited cities
   temp ← random [0,1]
   if V_csum [i] ≥ temp
    flag ← i
   else
    continue
   end if
  end for
  if flag ! = -1
   selected city ← unvisited city [i-1]//selecting the ith city
  else
   selected city ← unvisited city [number of unvisited cities -1]
  end if
 End.