
Source-code of ACO algorithm in C++ 9
52 f i t n e s s ( k ) = FUN_TSP ( [ an t0 ant0 (1 ) ] , nE , Di s t a n c e ) ;
53 i f f i t n e s s ( k ) < b e s t _ f i t % Checking f o r b e s t s o l u t i o n
54 best_ ant = ant0 ;
55 b e s t _ f i t = f i t n e s s ( k ) ;
56 end
57 ant ( k , : ) = ant 0 ; % S to r e ant0 to ant k
58 an t0 = [ ] ; % Res t ore ant0
59 end
60 %−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
61 % Update Phromone i n t e n s i t y at a l l t he c or n er s / pa th s
62 %−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
63 f o r k=1:ant_pop % ant k
64 ANT0 = [ ant ( k , : ) ant ( k , 1 ) ] ;
65 f o