Worksheet on a Genetic Algorith Search
The Traveling Salesman Problem
Using Random Processes to Find a Solution

                                             Name ______________

1. The next program can be found at /home/atlas1/ai/genetic2000.lsp.  
   SEE A DETAILED TRACE OF THE RUNNING OF THE PROGAM HERE

See a Step By Step approach here

2. The five cities involved here in the Traveling Salesman problem are
  Seattle, Portland, Spokane, Bellingham, and Wenatchee.

  Describe the Traveling Salesman problem that this genetic algorithm
  program is trying to solve.

3. Below is a map of the 5 cities. The program runs with these parameters:
    
     number of generations (ngenerations)
     number of mutations per generation (nmutations)
     number of crossovers per generation (ncrossovers)

Your're going to have to write the program before going to #4.  You don't have to use the core program above, genetic2000.lsp. 
More clarification/directions will follow shortly.

4.  Practice running the program and varying the number of each parameter in
  order to see the effect that each has in finding an optimum solution.  The 
  program defaults to 10 generations with 10 mutations and 10 crossovers for
  each generation.

   To view a detailed trace of the genetic algorithm process go here.

PART 2 ASSIGNMENT QUESTIONS ARE HERE