Travelling Salesman Optimization Save
Python implementation for TSP using Genetic Algorithms, Simulated Annealing, PSO (Particle Swarm Optimization), Dynamic Programming, Brute Force, Greedy and Divide and Conquer
Project README
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
Divide and Conquer
Greedy
PSO: Particle Swarm Optimization
Open Source Agenda is not affiliated with "Travelling Salesman Optimization" Project. README Source: rameziophobia/Travelling_Salesman_Optimization
Stars
65
Open Issues
2
Last Commit
10 months ago
License
Open Source Agenda Badge
