Experiments with machine learning

View project on GitHub

01. Traveling Salesman Problem

Traveling salesman problem solution using genetic algorithm.

Algorithm is written entirely in javascript and doesn't require any aditional libraries. To run locally open index.html file with any browser or use grunt reload, configuration files are included.

To add cities click on left grey panel, right panel will show current shortest path.
  • Salesmans - amount of salesmans to use, recommended between 10 - 50
  • Clean - clean everything and start from scratch
  • Start - start automatic algorithm execution at 20 evolutions per second
  • Step - move to next evolution
  • Stop - stop automatic algorithm execution, you still will be able to continue by clicking Start or Step