ECE 559   Project #3

You are to solve an instance of a 90 city TSP. The cities are placed on a 
1000 x 1000 grid. The file 'data.dat' on the course webpage has the city 
locations. (The file has 180 lines; the first 90 lines are the x-coordinates 
and the last 90 lines are the y-coordinates.) You will have to calculate the
euclidean distance between all pairs of cities.

1. Design a (1,200)-ES to solve the TSP problem. The initial population 
must encode the tour [1 2 3 4 5 ... 88 89 90]. 

The only operator you may use is an inversion operator. The operator 
must be dynamically adapted or you will receive no credit!!! 

Plot an example run of your ES. (You will plot the best solution found to 
date versus the generation number.) Run your ES for 1000 generations.

2. Repeat problem 1 except design your own mutation operator. Whatever
operator you design, it must be dynamically adapted.