The Genetic Traveler
Drop cities, evolve routes, watch the traveling salesman problem get solved.
What is this?
An interactive evolutionary computing lab for the traveling salesman problem. You place cities on a map and a genetic algorithm evolves shorter and shorter routes between them.
How it works
Each candidate route is a chromosome. Selection, crossover, mutation and elitism compete across generations to shorten the tour, with optional 2-opt polishing. You can tune population, mutation rate, and the selection and crossover strategies live.