Various heuristic algorithms solving TSP. What TSP is all about you can find elsewhere. The plan is to implement Simulated Annealing first and look what happens. The bad guy is a TSP with a trivial solution e.g. all cities located on a circle. I really want to know how heuristic algorithms fail (or maybe not). The next algorithm to implement is at the time being unknown, there are many of them. Well, I'm pretty new to Python. It's so to say, my playground, cause just reading books is boring :(