1. Genetic Algorithms and TSP Thomas Jefferson Computer Research Project by Karl Leswing

2. Genetic Algorithms Effective in Optimization Problems Classified as a global search heuristic Inspired by Evolutionary Biology  Inheritance  Mutation  Selection  Crossover

3. Traveling Salesman Given a number of cities and the costs of traveling from any city to any other city, what is the cheapest round- trip rout that visits each city exactly once and then returns to the starting city.

4. Traveling Salesman Continued O(N!)‏ Dynamic Programming down to O((n^2)*2^n)‏ Find Near Optimal Solutions

5. Current Work

6. Current Work Continued Double Point Crossover Roulette Selection  Unique Fitness Algorithm Single Point Mutation  Mutation Rate Variable Effectiveness  Solve 50 City TSP in less than one minute

7. Extensions Selections  Tournament  Elitism Matrix Encoding Mutations  Double Point  Cycle 3 Dimension  Open GL Weighted Paths