A Simple Tabu Search Implementation


Assumes normalized search space which is (-1,1) in each dimension.
No local minimization techniques too. Damn sad.

Max Runs: Dimensions* (max 20): Evaluation Function: Function 1 - Goldstein & Price Function 2 - Branin RCOS Function 3 - Easom Function 4 - Rosenbrock (N) Function 5 - Shubert Function 6 - Hartmann (3) Function 7 - Zakharov (N) Function 8 - Mod.Himmelblau (1 + ($X[0]+$X[1]+1)**2 * (19-14*$X[0]+3*($X[0])**2-14*$X[1]+6*$X[0]*$X[1]+3*$X[1]*$X[1])) * (30 +(2*$X[0]-3*$X[1])**2*(18-32*$X[0]+12*$X[0]*$X[0]+48*$X[1]-36*$X[0]*$X[1]+27*$X[1]*$X[1])) Initial Points: Max Iterations: Neighbours: Rejection Radius: Tabu List Size: Promising List Size: Iteration Cutoff: