Claudeworks!|

Travelling Salesman Problemv0.4

1
Generate a map
Use the Cities slider and "Generate New Map" to create a random map of British towns.
2
Draw your route
Click the start city (black center dot) first, then click cities in order to build your path. Your distance updates in real time.
3
Run the GA
Adjust Population, Mutation, Elites, Stagnation, Diversity, and Speed, then press Start. Watch the red route evolve on the map.
4
Compare with exact solver
With ≤20 cities, enable the Exact checkbox. The blue dashed route shows the branch-and-bound solver's progress toward the true optimum.
5
Analyze elites
Pause the GA to see the Elite Analysis panel. Click an elite to show its route in orange. Yellow = shared by some elites, green = shared by all.
6
Experiment
Try high vs. low mutation rates, different diversity levels, or more cities. The convergence chart shows how your choices affect the algorithm.

Comments & Suggestions

Log in to post comments and join the conversation.

Loading comments...