Timetabling Problem
-
Updated
Jan 8, 2018 - C
Timetabling Problem
Greedy, Greedy+LocalSearch(2-opt), Stocastic and GRASP implementations to solve the Symetric Travelling Salesman Problem (STSP). The TSP instances were taken from the TSPLIB website (http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/)
Add a description, image, and links to the local-search topic page so that developers can more easily learn about it.
To associate your repository with the local-search topic, visit your repo's landing page and select "manage topics."