Harris hawks optimization

Escaping energy E = 2 E0 (1 - t / T), E0 ~ U(-1, 1). Exploration for |E| >= 1 perches on a random hawk or relative to the rabbit and the mean; exploitation uses soft or hard besiege, with or without progressive rapid dives built from Levy flights.

Usage

HarrisHawksOptimizer(f, bounds, n_pop = 20, max_iter = 200, seed = 0)

Arguments

f

Objective to minimise.

bounds

List of c(low, high) pairs or a two-column matrix.

n_pop

Population size.

max_iter

Iterations.

seed

Philox seed.

Value

list(x, fun, estimate, history, n_fev, method).

References

Heidari, A. A., Mirjalili, S., Faris, H., Aljarah, I., Mafarja, M. and Chen, H. (2019). Harris hawks optimization: algorithm and applications. Future Generation Computer Systems 97, 849-872.

Examples

HarrisHawksOptimizer(function(x) sum(x^2), list(c(-5, 5), c(-5, 5)), max_iter = 50)$fun
#> [1] 1.112362e-25