Homework 8

Details

Implement the genetic algorithm for TSP. Use whichever crossover you would like to implement. The goal is to get the best solutions possible for the following graphs

1. K05 TSP (1325)
2. K09 TSP (1319)
3. K10 TSP (1320)
4. K12 TSP (1321)
5. K15 TSP (1322)
6. K20 TSP (1323)
7. K25 TSP (1324)
8. K30 TSP (1326)
9. K35 TSP (1327)
10. K40 TSP (1328)
11. K45 TSP (1329)
12. K50 TSP (1330)

Submit a brief write-up describing, initial population, including size, selection algorithm, mutation algorithm, crossover algorithm (the most important one). I am assuming your chromosome and fitness function are pretty standard.

Use Webhandin 385-HW8 to submit the 5 or so files you created/modified, your writeup, and a file containing the results in the following format:
name:id:cost:tour
Where name identifies who you are, id is the Algoraph puzzle ID, cost is the cost of the tour, and tour is the ordering of the vertices in your tour of that cost.