Skip to content

Python implementation for TSP using Genetic Algorithms, Simulated Annealing, PSO (Particle Swarm Optimization), Dynamic Programming, Brute Force, Greedy and Divide and Conquer

License

Notifications You must be signed in to change notification settings

rameziophobia/Travelling_Salesman_Optimization

Repository files navigation

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

About

Python implementation for TSP using Genetic Algorithms, Simulated Annealing, PSO (Particle Swarm Optimization), Dynamic Programming, Brute Force, Greedy and Divide and Conquer

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages