Skip to content

About

M1 Project - Solving the TSP

Topics

Resources

Stars

0 stars

Watchers

1 watching

Forks

Latest commit

 

History

10 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Solving the TSP

Problem

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

Tested problem instances

  • bier127
  • fnl4461
  • gr666

Our heuristic Frankenstein

We merged various heuristics into 1:

  • 2-opt
  • Mutation
  • Crossover
  • Genetic
  • Simulated annealing

You can read the complete report [FR]: Frankenstein.pdf

Authors

Mr Alexandre Blansché provided the complete base repo.

Our Implemented solution is in the following folder: tree/main/src/tsp/projects/frankenstein

Supervising Professor

  • Alexandre Blansché

About

M1 Project - Solving the TSP

Topics

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages