Genetic TSP

For this assignment you will need working Graph and FromCSVFile implementations. Though FromCSVFile will not be directly by your implementation of the genetic algorithm, but will be used to test your code.

You are to implement Tao and Michalewicz' Inver-Over algorithm to find approximate solutions to the TSP. You can refer to the original paper here.

Functions

You will be implementing two different functions.

• GeneticTSPWithPop - an implementation of the Inver-Over algorithm, applied to a given "population" of candidate solutions
• GeneticTSP - create a random population of tours and calls the GeneticTSPWithPop to approximate a solution to the TSP

Some notes about the other parameters to both of the functions. The parameter inversionProb is the probability of doing a "mutation" i.e. this a number between 0 and 1. The other parameter maxIters is the maximum number of "generations" (outermost loop) the algorithm should run. For larger graphs, a maxIters value of 10,000 or more may be needed to achieve good results.