The Traveling Salesman Problem (TSP) is one of the most famous NP-Complete problems. If somehow you have not heard of it, the general idea is this: Given a number of points on some coordinate system, is there a Hamiltonian cycle of length n? Though it has evolved now to asking for the smallest n, rather than a given n. The Gentior algorithm is specified in a 1990 paper by D’Ann Fuquay and Darrell Whitley, Genetic Algorithm Solutions for the Traveling Salesman Problem.