Demonstration of
Traveling Salesman Problem by Genetic Algorithm
Keywords:
Genetic Algorithm, PMX, Roulette Wheel Selection,
Tournament Selection, CHC Selection, Elitism, TSP.
Algorithm:
Genetic Algorithm with PMX and Swap Mutation.
Main Characteristics:
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
Note:
If you see nothing below, you have to download
latest version
of Java Plug-in.
Annotations:
- RED LINES:
So far found best tour
- YELLOW
LINES: Best tour of current generation
- Current
Solution: Best route of current generation (the order of cities to
visit)
- OVERALL
BEST: So far found best route (the order of cities to visit)
Programmer:
Topon Kumar Paul, Department of Frontier Informatics,
The University of Tokyo, Japan
Email:
topon@ibalab,
topon91@YahooMail
ibalab=iba.k.u-tokyo.ac.jp;
YahooMail=yahoo.com
Copyright@2005,Topon
Kumar Paul. All rights reversed. Last update:01/14/2005 03:20:04 PM