Travelling salesman problem is the following:
A list of cities and their coordinates are given, and we have to find the shortest path through all cities.
Complete and detailed problem [FR]: mh_projet.pdf
- bier127
- fnl4461
- gr666
We merged various heuristics into 1:
- 2-opt
- Mutation
- Crossover
- Genetic
- Simulated annealing
You can read the complete report [FR]: Frankenstein.pdf
Mr Alexandre Blansché provided the complete base repo.
Our Implemented solution is in the following folder: tree/main/src/tsp/projects/frankenstein
- Alexandre Blansché