Skip to content

Solve Traveling Salesman Problem Using Particle Swarm Optimization Algorithm

Notifications You must be signed in to change notification settings

wittfabian/tspnwithpso

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

59 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Solve Traveling Salesman Problem with Neighborhood Using Particle Swarm Optimization Algorithm

ellipse examle

Each ellipse represents the border of a town in the traveling salesman problem. In the special case with a neighborhood we do not consider the center of the town. We are interested in the question where should the traveler enter the city, if the ellipse represent the city limit.

Dataset _tspn2DE5_1 after PSO Dataset _tspn2DE5_1 after insertion heuristics (first step) and PSO (second step)

Min. distance: 191.858 in 244.789 ms.

references

About

Solve Traveling Salesman Problem Using Particle Swarm Optimization Algorithm

Resources

Stars

Watchers

Forks

Languages