https://github.com/blackary/genetic-salesman

Solving the Travelling Salesman problem with a genetic algorithm
https://github.com/blackary/genetic-salesman

Last synced: 13 days ago
JSON representation

Solving the Travelling Salesman problem with a genetic algorithm

• Host: GitHub
• URL: https://github.com/blackary/genetic-salesman
• Owner: blackary
• Created: 2014-06-13T12:46:47.000Z (over 10 years ago)
• Default Branch: master
• Last Pushed: 2015-06-20T03:48:29.000Z (over 9 years ago)
• Last Synced: 2024-10-11T09:33:30.864Z (about 1 month ago)
• Language: Python
• Size: 318 KB
• Stars: 0
• Watchers: 2
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# genetic-salesman

Solving the Travelling Salesman problem with a genetic algorithm

This one is from a research project I did this summer involving Genetic Algorithms. In essence, the purpose of the program is to compare 3 solutions to the Travelling Salesman Problem:

1. A basic greedy algorithm, which I borrowed from another source

2. A basic genetic algorithm which I borrowed from another source and modified (to include periodic variability in mutation rates, etc.)

3. A hybrid algorithm in which I used the solution generated by the greedy algorithm as a seed value for the genetic algorithm

I then added code to run all three and compare them in terms of runtime and ultimate solution, and to collect data from a large number of runs and save it to a file. I also used PyGame to create a visual interface which shows the genetic algorithms working out solutions, then displays and compares the final solutions. 

**REQUIRES PYGAME TO RUN**