Hello everyone,

could someone please point me to a good tutorial about Genetic Algorithms and their application to Traveling Salesman Problems ?

FYI : I need it because I have to write a paper on NP-Complete problems and I thought I'd start with something everyone knows, being the TSP problem.

Thanks.

http://en.wikipedia.org/wiki/Traveling_salesman_problem
is a good starting point, but are you specifically looking at 'genetic algorithms' ? or just solving tsp's ?

Both actually,

the paper is about NP-Complete problems and the TSP is an NP-Complete problem, so basically it will be about TSP's, but I know Genetic Algorithms is a good method for approaching near-perfect results of problems in the NP Class, so I would like to know more about it, so I can demonstrate this method in my paper.

Hello,

maybe you didn't see it, but at the bottom of caesums wikipedia-link the last link goes to gp-solutions for the tsp.

bye, Erik