Simple (but heavily parameterized) tool for testing genetic algorithms on the traveling saleman problem. All parameters are optional, and have default values; the real value of this tool is to learn how various variables in genetic algorithm impact its efficacy.
bryanesmith/traveling-salesman-genetic-algorithms
master
Code
-
Clone
Use Git or checkout with SVN using the web URL.
Work fast with our official CLI. Learn more.
- Open with GitHub Desktop
- Download ZIP
Launching GitHub Desktop
If nothing happens, download GitHub Desktop and try again.
Launching GitHub Desktop
If nothing happens, download GitHub Desktop and try again.
Launching Xcode
If nothing happens, download Xcode and try again.
Launching Visual Studio Code
Your codespace will open once ready.
There was a problem preparing your codespace, please try again.
===== DESCRIPTION Simple (but heavily parameterized) tool for testing genetic algorithms on the traveling saleman problem. All parameters are optional, and have default values; the real value of this tool is to learn how various variables in genetic algorithm impact its efficacy. ===== DEPENDENCIES Requires Java 5 or later. ===== USAGE For usage information: java -Xmx512m -jar GeneticAlgorithm-TravelingSalesman.jar --help To run with all default values, simply don't pass any parameters: java -Xmx512m -jar GeneticAlgorithm-TravelingSalesman.jar
About
Simple (but heavily parameterized) tool for testing genetic algorithms on the traveling saleman problem. All parameters are optional, and have default values; the real value of this tool is to learn how various variables in genetic algorithm impact its efficacy.