Solution to the Traveling Tournament using simulated annealing
-
Updated
Mar 15, 2018 - Python
#
traveling-tournament
Here are 2 public repositories matching this topic...
This repo contains the implementation of an heuristic to solve the Traveling Tournament Problem (TTP), as well as the implementation of the Meta-heuristics' algorithm Iterated Local Search (ILS) satisfying the predefined contraints of the NP-hard problem.
np-hard heuristics metaheuristics combinatorial-optimization iterated-local-search traveling-tournament np-completeness
-
Updated
Jul 5, 2022 - Python
Improve this page
Add a description, image, and links to the traveling-tournament topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the traveling-tournament topic, visit your repo's landing page and select "manage topics."