These are the command line inputs used with the ACO algorithms and the results I got on Tabasco. The results have the name of the file with the gprof results in their description (the files are in gprofresults.tar.gz)

Elitist Ant System:

./acotsp -i lin318.tsp -v -t 30. -m 500 -b 5 -l 0 
Best Solution in try 9 is 45288
Best Solution was found after 400 iterations
(file is ewithoutlocal)
neighbour_choose_and_move_to_next is 71% of time

./acotsp -i lin318.tsp -v -t 30. -m 500 -b 5 -l 3
Best Solution in try 9 is 42144
Best Solution was found after 37 iterations
(file is ewithlocal)
three_opt_first is 82% of time while neighbour_choose_and_move_to_next is 12%

Max-min:

./acotsp -i lin318.tsp -l 0 -t 10. -a 1 -b 5 -e 0.5 -r 10 -x -m 500
Best Solution in try 9 is 43022
Best Solution was found after 139 iterations
(file is mmwithoutlocal)
neighbour_choose_and_move_to_next is 80% of time

./acotsp -i lin318.tsp -l 3 -t 10. -a 1 -b 5 -e 0.5 -r 10 -x -m 500 
Best Solution in try 9 is 42029
Best Solution was found after 10 iterations
(file is mmwithlocal)
three_opt_first is 79% of time with neighbour_choose_and_move_to_next is 16%

Rank-based:

./acotsp -i lin318.tsp -v -t 20. -m 500 -b 5 -l 0
Best Solution in try 9 is 45905
Best Solution was found after 79 iterations
(file is rbwithoutlocal)
neighbour_choose_and_move_to_next is 82% of time

./acotsp -i lin318.tsp -v -t 20. -m 500 -b 5 -l 3
Best Solution in try 9 is 42189
Best Solution was found after 9 iterations
(file is rbwithlocal)
three_opt_first is 68% of time while neighbour_choose_and_move_to_next is 24%