I'd like to implement two more constructive heuristics in order to understand how different initial solutions will affect the outcome of the local search.
[x] Cheapest Insertion: Add cheapest weight edge that doesn't form a subcycle and doesn't make a vertex have degree > 2.
[x] Random path: Simply permutate a vector 1:n, n being the number of vertices of the instance, close the loop by adding 1 and calculate the cost
I'd like to implement two more constructive heuristics in order to understand how different initial solutions will affect the outcome of the local search.