TravellingSalesman FSharp solution of the travelling salesman problem with a genetic algorithm with real time graphics.
Open ".sln"-Visual Studio solution file, compile and run.
From now on a window should open, where you can see the cities as black rectangles and their fist, totally random, interconnections. As well as you can see the network evolving. To get a final solution, you should have to wait 3-6 minutes.