Sushil J. Louis -
Gong Li
-
Dept. of Computer Science
University of Nevada,
Reno, NV 89557
sushil@cs.unr.edu
li_g@cs.unr.edu
This paper uses modified genetic algorithms to attack the traveling salesman problem. Instead of starting from scratch, we inject the solutions of previously solved similar problems into the initial population of the genetic algorithm. We evaluate the performance of the genetic algorithm with a memory of previously solved similar problems on a number of traveling salesman problems. Preliminary results indicate that we can always get better performance with injection of previous solutions to similar problems.