Skip to content

Traveling salesman problem solver using self organizing maps

Notifications You must be signed in to change notification settings

ruiaraujo/Neurotic

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

The program is run from the command line with the parameters "number of neurons", "neighbourhood size", "number of iterations", "steps before outputting", "learning rate" and "path name"

The parameters are int, int, int, int, double, String

Example parameters would be:

50 30 500 50 0.3 ws.tsp

It works best with around 2:1 neuron to cities ratio and large (60% of neurons~) neighbourhood size for small problems and smaller (40%~ of neurons) sizes for larger problems.

NOTE: Whether or not Java interprets . or , as the proper way to separate decimals seem to be dependant of your regional settings. You might have to convert , to . to get it to run.

About

Traveling salesman problem solver using self organizing maps

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published