/Traveling-salesman-genetic-algorithm

Genetic Algorithm solution to the traveling salesman problem.

Primary LanguageJavaMIT LicenseMIT

Genetic Algorithm Solution to the Traveling Salesman Problem

This program uses a genetic algorithm to find approximate solutions to any given TSP.

The following methods are used in the algorithm:

  • Selection: Tournament Selection
  • Crossover: Ordered Crossover
  • Mutation: Gene Swapping

(Note: development of this project will most likely continue with python)