Different result on different runs

[shakirak]

Hello

Every time I run the program (anttsp.py) gives different best paths.....Can you clarify please?

[JoaoGFarias]

Any meta-heuristic algorithm finds a close-optimal solution.
Probably, if you check the length of this paths, they will be:

• Near equal;
• Near to the optimal length

[topuchi13]

You can increase number of iterations in order to get more similar optimal solutions.

Bear in mind that starting points in every ACO type algorithm are chosen randomly, therefore two runs with exact same parameters can give different results.