Traveling Salesman Simulator

During my master I programmed a simulator for the traveling salesman problem. The simulator uses a genetic algorithm for route determination.

It has the following feature set:

  • Freely definable parameters
    • Amount of cities
    • Population size
    • Sub-population size
    • Mutation rate
    • Dynamic adaption of parameter during simulation runs
  • Graphical route canvas
  • Storage for shortest routes found during a session
  • Acoustic signal in the event of shorter route identification

The simulator can be downloaded here (Apache 2.0 licence).