Solve Traveling Salesman Problem with Neighborhood Using Particle Swarm Optimization Algorithm
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 insertion heuristics (first step) and PSO (second step)
Min. distance: 191.858 in 244.789 ms.