TSP Solver based on Lin-Kernighan, Lin-Kernighan-Helsgaun, 2-opt, 3-opt, Tabu Search heuristics, all algorithms optimized by Numba (JIT-compiler)
-
Updated
Jun 22, 2022 - Python
TSP Solver based on Lin-Kernighan, Lin-Kernighan-Helsgaun, 2-opt, 3-opt, Tabu Search heuristics, all algorithms optimized by Numba (JIT-compiler)
Competitive C++ solution to the Travelling Salesperson 2D problem, that includes the implementation of 6 algorithms: greedy, Clarke-Wright, Christofides, 2-opt, 3-opt, and Lin-Kernighan (k-opt). Done as part of the project assignment in the *DD22440 Advanced Algorithms* course at KTH, by Prof. Danupon Nanongkai.
AI: First project of the Computer Science third-year about Artificial Intelligence.
Travelling salesman problem for India
Add a description, image, and links to the lin-kernighan-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the lin-kernighan-algorithm topic, visit your repo's landing page and select "manage topics."