Travelling Salesman (Demo)
Find the shortest tour that visits every stop once.
Files stay in this browser tab. Select them again when reopening a draft.
Travelling Salesman Demo
Find the shortest closed tour through every point.
Each chromosome is a permutation of the points; fitness = total tour length (smaller is better).
Run This Yourself, for Free
Sign in to configure and launch a genetic algorithm against this problem, or bring your own.
Get started