Solving the Travelling Salesman Problem (TSP) with Python

Johm Montgomery (ShowMeDo author) has started a very nice blog series on Solving the classic Travelling Salesman Problem (TSP) with Python.

So far there are 3 posts in the series:

• Tackling the travelling salesman problem: prologue – gives some background on John’s plans
• Tackling the travelling salesman problem: introduction – defines the TSP and ‘NP-Hard’-ness, discusses how to represent the problem in Python and looks at some of the evolutionary-programming tools that will be used in the solution
• Tackling the travelling salesman problem: hill-climbing – John introduces the concept of a ‘fitness landscape’, how a hill-climbing algorithm can traverse the landscape and how to write the hill-climber with Python

John is using a combination of Python code, explanation and graphics to show everything you need for this fascinating topic. Don’t forget to leave John a comment on his blog to let him know what you think.

To learn more about Python you can visit ShowMeDo’s list of Python videos which contains 94 Python tutorials including almost 2-hours worth of tuition in the Python Newbies on XP series.

Related posts:

1. Choosing a Python IDE – Which IDEs need covering?
2. New Java ShowMeDos: Writing Applets
3. New Java ShowMeDos: Parts 4 and 5 of Writing Applets