https://github.com/diego999/travelling-salesman-problem

IA laboratory, TSP resolved with genetic algorithm, Bsc 6 HE-Arc 2013-2014
https://github.com/diego999/travelling-salesman-problem

Last synced: 8 months ago
JSON representation

IA laboratory, TSP resolved with genetic algorithm, Bsc 6 HE-Arc 2013-2014

• Host: GitHub
• URL: https://github.com/diego999/travelling-salesman-problem
• Owner: Diego999
• License: mit
• Created: 2014-01-17T10:02:16.000Z (almost 12 years ago)
• Default Branch: master
• Last Pushed: 2014-04-28T12:26:31.000Z (over 11 years ago)
• Last Synced: 2025-01-14T13:56:27.929Z (9 months ago)
• Language: Python
• Homepage:
• Size: 355 KB
• Stars: 0
• Watchers: 3
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
Travelling-salesman-problem

===========================

by Diego Antognini & Marco Aeberli

IA laboratory, resolved with genetic algorithm, Bsc 5 HE-Arc 2013-2014

**Selection**

30% of the population, tournament with pool size with of 10.

**Crossover**

80% of crossover, with the crossover operation from A Fast TSP Solver Using Genetic Algorithm in Java.

**Mutation**

30% of the new population mutate with a reverse path.

**Convergence criteria**

The algorithme stop executing itself if since 50 generations the best result hasn't changed.

## License

This code is distributed under the terms and conditions of the [MIT license](LICENSE).