In this paper I will discuss a genetic approach to fi nding near-optimal soltu- ions to Traveling Salesman Problems. I will also discuss how using a heuristic to generate an initial pool aff ects the run time and solutions found by my program. Lastly, I will discuss the diffi culties in creating a program to fi nd near-optimal solutions to asymmetric traveling salesman problems.