Traveling Salesman Problem by Genetic Algorithm
Genetic Algorithm, PMX, Roulette Wheel Selection,
Tournament Selection, CHC Selection, Elitism, TSP.
Genetic Algorithm with PMX and Swap Mutation.
Dynamically city positions as well as other Genetic
Algorithm's parameters can be changed during execution of the algorithm.
User can set city locations by clicking on the drawing area one by one.
Go to: Description of Method
| User Manual |
IBA Laboratory |
The University of Tokyo
If you see nothing below, you have to download
of Java Plug-in.
- RED LINES:
So far found best tour
LINES: Best tour of current generation
Solution: Best route of current generation (the order of cities to
BEST: So far found best route (the order of cities to visit)
Topon Kumar Paul, Department of Frontier Informatics,
The University of Tokyo, Japan
Kumar Paul. All rights reversed. Last update:01/14/2005 03:20:04 PM