| | HITACHI HOME | UP | SEARCH | | |
This JAVA applet is based on the algorithm proposed in `A Fast TSP Solution using Genetic Algorithm' (Information Processing Society of Japan 46th Nat'l Conv., 1993).
You can see that the algorithm effectively solves the Traveling Salesman Problem. First, put `cities' by clicking the mouse in the following gray colored rectangle field and then push the `Start' button.
`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.
Try random cities, double circles