Genetic algorithms and Evolutionary computing - Project on the Travelling Salesman Problem (KU Leuven course H02D1A)
-
Updated
Oct 30, 2022 - Python
Genetic algorithms and Evolutionary computing - Project on the Travelling Salesman Problem (KU Leuven course H02D1A)
This repository offers solutions to the Traveling Salesman Problem through two algorithms: Dynamic Programming for precise results and the K-opt Heuristic for fast, near-optimal routes. Whether you prioritize accuracy or speed, our codebase simplifies TSP optimization for various applications.
Add a description, image, and links to the k-opt topic page so that developers can more easily learn about it.
To associate your repository with the k-opt topic, visit your repo's landing page and select "manage topics."