We presented an efficient Genetic Algorithm program for
solving the Travelling Salesman Problem. The program
produced good results for various problem sizes but run time
increases with increasing number of cities. We found that the
population should be tuned to match the problem size (not
arithmetically). To get very good solutions a tradeoff must be
made between runtime and the solution quality.