Abstract: The Traveling Salesman Problem (TSP) is a challenging combinatorial optimization problem classified as NP-hard. This paper investigates the performance of various meta-heuristic algorithms, ...

This is the C++ implementation for the Trigger Arc TSP competition hosted by the Metaheuristics Summer School organizers. In this technical report we detail the approach we took to solve the problem.

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community. Issues are used to track todos, bugs, feature requests, and more.

Abstract: This paper proposes and tests three simple algorithms that are capable of rapidly improving non-optimal paths for the Euclidean Travelling Salesman Problem (TSP).The ETSP is a special case ...