Skip to content

Latest commit

 

History

History
24 lines (22 loc) · 1 KB

File metadata and controls

24 lines (22 loc) · 1 KB

Solving the Travelling Salesman Problem in Python

Implemented techniques

  • Genetic Algorithm
  • Simulated Annealing
  • PSO: Particle Swarm Optimization
  • Divide and conquer
  • Dynamic Programming
  • Greedy
  • Brute Force

When the solution is found it is plotted using Matplotlib and for some algorithms you can see the intermediate results

Example visualizations

The following visualizations are all applied on the EIL51 dataset available through the TSP online library

Genetic Algorithm

Genetic Algorithm

Divide and Conquer

Divide and Conquer

Greedy

Greedy

PSO: Particle Swarm Optimization

Particle Swarm Optimization