Closed jmejia8 closed 1 year ago
Possible implementation: set_inital_solutions
set_inital_solutions
# objective function f(x) = abs(x[1]) + x[2] + x[3]^2 # optimizer algo = ECA(N = 61) # one solution x0 = rand(3) set_inital_solutions!(algo, x0, f) # 30 solutions with dim 3 X0 = rand(30, 3) set_inital_solutions!(algo, X0, f) # 30 solutions and their fitness P0 = [ Metaheuristics.create_child(X0[i,:], f(X0[i,:])) for i in 1:30 ] set_inital_solutions!(algo, P0) optimize(f, bounds, ECA)
Possible implementation:
set_inital_solutions