You can find the algorithm solving effectively the Traveling Salesman Problem. First, put `cities' by clicking mouse in the following gray colored rectangle field, and then push `Start' button.
Try following sample problems. Random 30 cities, Random 100 cities, Double circle 48 cities (type C), Double circle 48 cities (type O), Double circle 192 cities (type C), Double circle 192 cities (type O).
`Population' means the number of genes. In every generation `Selection' percent of genes are killed and the same number of genes are produced by crossover operations. And `2 opt' percent of genes are improved using a 2opt method.