This program implements meta heuristics from preconfigured algorithms and functions that can be mixed together.
To run on linux: ./run.sh '[OPTIONS]...'
-a
It indicates the algorithm to use.
Values: [hc (hill climbing), hcrr (hill climbing with random restarts), sahc (steepest ascent hill climbing), sahcr (steepest ascent hill climbing with replacement), rs (random search), sa (simulated annealing), ts (tabu search), fbts (feature based tabu search), g (genetic)]
Required
-i
Indicates the number of iterations for the algorithm, stopping criterion.
Value: Integer
Optional - Default: 1000
-nt
Indicates the number of tweaks for ajust the solution in some algorithms.
Value: Integer
Optional - Default: 10
-tl
Indicates the lenght of tabu search list in related algorithms.
Value: Integer
Optional - Default: 10
-tp
Indicates the temperature of fragmentation in simulated annealing related algorithms.
Value: Double
Optional - Default: 0.8
-p
Indicates the population size in population related algorithms.
Value: Integer
Optional - Default: 100
-f
It indicates the function that is applied the heuristics.
Values: [sp (sphere), st (step), sc (schwefel), rt (rastrigin), gr (griewank), ac (ackley)]
Required
-ll
Indicates the lower limint for the algorithm.
Value: Double
Optional - Default: -100
-ul
Indicates the upper limint for the algorithm.
Value: Double
Optional - Default: 100
-o
Indicates the optimal value for the function.
Value: Double
Optional - Default: 0
-sr
Indicates the search radio for the algorithm.
Value: Double
Optional - Default: 0.6
-d
Indicates the number of dimensions of the function.
Value: Integer
Optional - Default: 2
-t
It indicates the times that will be applied the metaheuristic.
Value: Integer
Optional - Default: 30
-s
It indicates the seed for randoms values.
Value: Long
Optional - Default: system nanotime
--help
More Help