Swarm Intelligence Algorithms

Step-by-step numerical example of ACO algorithm 11

98 // Update Pheromone

99 f o r ( i n t k=0; k<ant_pop ; k++)

100 {

101 f o r ( i n t s =0; s<nE ; s++)

102 {ANT0[ s ]= ant [ k ] [ s ] ; }

103 ANT0 [ nE]= ant [ k ] [ 0 ] ;

104 f o r ( i n t i =0; i <nE ; i ++)

105 {TAU[ ANT0 [ i ] ] [ ANT0[ i +1]]=TAU[ANT0 [ i ] ] [ ANT0[ i +1]]+(Q/ f i t n e s s [ k ] ) ; }

106 }

107 f o r ( i n t i =0; i <nE ; i ++)

108 {

109 f o r ( i n t j =0; j<nE ; j ++)

110 {TAU[ i ] [ j ]=(1−r ho ) ∗TAU[ i ] [ j ] ; }

111 }

112 cout<<b e s t _ f i t <<e n dl ;

113 }

114 // P r in t i ng b e s t s o l u t i o n

115 cout<<" B est ant : [ "<<be st_ant [ 0 ] ;

116 f o r ( i n t i =1; i