Annealing Ant Colony Optimization with Mutation Operator for Solving TSP

Algorithm 3

The pseudocode for applying the mutation operator for TSP problem.

(1) begin

(2)   : For ant , generating mutation position

     random as ;

(3)   ;

(4)   if  ()  then

(5)    

(6)   else

(7)     

(8)    end

(9)   :  Exchanging and ;

(10)   :  Getting new ant ;

(11)  end