Direct link to the code, which is nice and clear to read (Genome / Population):<p><a href="https://github.com/janmonschke/Genetic-Algorithms/tree/gh-pages/coffeescripts" rel="nofollow">https://github.com/janmonschke/Genetic-Algorithms/tree/gh-pa...</a>
Suggestion: TSP is a combinatorial optimization problem and isn't well suited to GAs. You would be much better off using a method meant for combinatorial optimization: notably ant colony optimization.
Everyone seems to claim a better way to do it (myself included).<p>Here's a TSP challenge for you to prove yourselves: <a href="http://www.tsp.gatech.edu/data/usa/index.html" rel="nofollow">http://www.tsp.gatech.edu/data/usa/index.html</a><p>Deadline is July 4th, 2013 -- Price $500 & Honourable mention for finding the shortest path to the world's largest TSP problem.
Just ran through this quickly, I don't know too much about algorithms, so I can't judge GA's usefulness when compared to other methods, but it certainly seems like a cool/fun thing to implement.