Different result on different runs

trevlovett / Python-Ant-Colony-TSP-Solver

Solves the TSP using multithreaded ACO method

BSD 3-Clause "New" or "Revised" License

103 stars 49 forks source link

Different result on different runs #1

Open shakirak opened 11 years ago

shakirak commented 11 years ago

Hello

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

JoaoGFarias commented 8 years ago

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 commented 8 years ago

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.