#!/usr/bin/env python
# Created by "Thieu" at 11:04, 21/07/2022 ----------%
# Email: nguyenthieu2102@gmail.com %
# Github: https://github.com/thieu1995 %
# --------------------------------------------------%
import numpy as np
from opfunu.benchmark import Benchmark
[docs]class Easom(Benchmark):
"""
.. [1] Jamil, M. & Yang, X.-S. A Literature Survey of Benchmark Functions For Global Optimization
Problems Int. Journal of Mathematical Modelling and Numerical Optimisation, 2013, 4, 150-194.
"""
name = "Easom Function"
latex_formula = r'f(x) = a - \frac{a}{e^{b \sqrt{\frac{\sum_{i=1}^{n}' +\
r'x_i^{2}}{n}}}} + e - e^{\frac{\sum_{i=1}^{n} \cos\left(c x_i\right)} {n}}'
latex_formula_dimension = r'd = 2'
latex_formula_bounds = r'x_i \in [-100, 100], \forall i \in \llbracket 1, d\rrbracket'
latex_formula_global_optimum = r'f(pi, pi) = -1'
continuous = True
linear = False
convex = True
unimodal = False
separable = True
differentiable = True
scalable = False
randomized_term = False
parametric = False
modality = False # Number of ambiguous peaks, unknown # peaks
def __init__(self, ndim=None, bounds=None):
super().__init__()
self.dim_changeable = False
self.dim_default = 2
self.check_ndim_and_bounds(ndim, bounds, np.array([[-100., 100.] for _ in range(self.dim_default)]))
self.f_global = -1.
self.x_global = np.pi * np.ones(self.ndim)
[docs] def evaluate(self, x, *args):
self.check_solution(x)
self.n_fe += 1
a = (x[0] - np.pi) ** 2 + (x[1] - np.pi) ** 2
return -np.cos(x[0]) * np.cos(x[1]) * np.exp(-a)
[docs]class ElAttarVidyasagarDutta(Benchmark):
"""
.. [1] Jamil, M. & Yang, X.-S. A Literature Survey of Benchmark Functions For Global Optimization
Problems Int. Journal of Mathematical Modelling and Numerical Optimisation, 2013, 4, 150-194.
"""
name = "El-Attar-Vidyasagar-Dutta Function"
latex_formula = r'f(x) = (x_1^2 + x_2 - 10)^2 + (x_1 + x_2^2 - 7)^2 + (x_1^2 + x_2^3 - 1)^2'
latex_formula_dimension = r'd = 2'
latex_formula_bounds = r'x_i \in [-500, 500], \forall i \in \llbracket 1, d\rrbracket'
latex_formula_global_optimum = r'f(3.40918683, -2.17143304) = 1.712780354'
continuous = True
linear = False
convex = True
unimodal = True
separable = False
differentiable = True
scalable = False
randomized_term = False
parametric = False
modality = False # Number of ambiguous peaks, unknown # peaks
def __init__(self, ndim=None, bounds=None):
super().__init__()
self.dim_changeable = False
self.dim_default = 2
self.check_ndim_and_bounds(ndim, bounds, np.array([[-500., 500.] for _ in range(self.dim_default)]))
self.f_global = 1.712780354
self.x_global = np.array([3.40918683, -2.17143304])
[docs] def evaluate(self, x, *args):
self.check_solution(x)
self.n_fe += 1
return ((x[0] ** 2 + x[1] - 10) ** 2 + (x[0] + x[1] ** 2 - 7) ** 2 + (x[0] ** 2 + x[1] ** 3 - 1) ** 2)
[docs]class EggCrate(Benchmark):
"""
.. [1] Jamil, M. & Yang, X.-S. A Literature Survey of Benchmark Functions For Global Optimization
Problems Int. Journal of Mathematical Modelling and Numerical Optimisation, 2013, 4, 150-194.
"""
name = "Egg Crate Function"
latex_formula = r'f(x) = x_1^2 + x_2^2 + 25 \left[ \sin^2(x_1) + \sin^2(x_2) \right]'
latex_formula_dimension = r'd = 2'
latex_formula_bounds = r'x_i \in [-5, 5], \forall i \in \llbracket 1, d\rrbracket'
latex_formula_global_optimum = r'f(0, 0) = 0'
continuous = True
linear = False
convex = True
unimodal = False
separable = True
differentiable = True
scalable = False
randomized_term = False
parametric = False
modality = False # Number of ambiguous peaks, unknown # peaks
def __init__(self, ndim=None, bounds=None):
super().__init__()
self.dim_changeable = False
self.dim_default = 2
self.check_ndim_and_bounds(ndim, bounds, np.array([[-500., 500.] for _ in range(self.dim_default)]))
self.f_global = 0.
self.x_global = np.array([0., 0.])
[docs] def evaluate(self, x, *args):
self.check_solution(x)
self.n_fe += 1
return x[0] ** 2 + x[1] ** 2 + 25 * (np.sin(x[0]) ** 2 + np.sin(x[1]) ** 2)
[docs]class EggHolder(Benchmark):
"""
.. [1] Jamil, M. & Yang, X.-S. A Literature Survey of Benchmark Functions For Global Optimization
Problems Int. Journal of Mathematical Modelling and Numerical Optimisation, 2013, 4, 150-194.
"""
name = "Egg Holder Function"
latex_formula = r'f(x) = \sum_{1}^{n - 1}\left[-\left(x_{i + 1}' +\
r'+ 47 \right ) \sin\sqrt{\lvert x_{i+1} + x_i/2 + 47 \rvert} - x_i \sin\sqrt{\lvert x_i - (x_{i + 1} + 47)\rvert}\right ]'
latex_formula_dimension = r'd \in N^+'
latex_formula_bounds = r'x_i \in [-512, 512], \forall i \in \llbracket 1, d\rrbracket'
latex_formula_global_optimum = r'f(512, 404.2319) = -959.640662711'
continuous = True
linear = False
convex = True
unimodal = False
separable = False
differentiable = True
scalable = True
randomized_term = False
parametric = False
modality = False # Number of ambiguous peaks, unknown # peaks
def __init__(self, ndim=None, bounds=None):
super().__init__()
self.dim_changeable = True
self.dim_default = 2
self.check_ndim_and_bounds(ndim, bounds, np.array([[-512., 512.] for _ in range(self.dim_default)]))
self.f_global = -959.640662711
self.x_global = np.zeros(self.ndim)
[docs] def evaluate(self, x, *args):
self.check_solution(x)
self.n_fe += 1
vec = (-(x[1:] + 47) * np.sin(np.sqrt(abs(x[1:] + x[:-1] / 2. + 47))) - x[:-1] * np.sin(np.sqrt(np.abs(x[:-1] - (x[1:] + 47)))))
return np.sum(vec)
[docs]class Exponential(Benchmark):
"""
.. [1] Jamil, M. & Yang, X.-S. A Literature Survey of Benchmark Functions For Global Optimization
Problems Int. Journal of Mathematical Modelling and Numerical Optimisation, 2013, 4, 150-194.
"""
name = "Exponential Function"
latex_formula = r'f(x) = -e^{-0.5 \sum_{i=1}^n x_i^2}'
latex_formula_dimension = r'd \in N^+'
latex_formula_bounds = r'x_i \in [-1, 1], \forall i \in \llbracket 1, d\rrbracket'
latex_formula_global_optimum = r'f(0,..,0) = -1'
continuous = True
linear = False
convex = True
unimodal = False
separable = False
differentiable = True
scalable = True
randomized_term = False
parametric = False
modality = False # Number of ambiguous peaks, unknown # peaks
def __init__(self, ndim=None, bounds=None):
super().__init__()
self.dim_changeable = True
self.dim_default = 2
self.check_ndim_and_bounds(ndim, bounds, np.array([[-1., 1.] for _ in range(self.dim_default)]))
self.f_global = -1
self.x_global = np.zeros(self.ndim)
[docs] def evaluate(self, x, *args):
self.check_solution(x)
self.n_fe += 1
return -np.exp(-0.5 * np.sum(x ** 2.0))
[docs]class Exp2(Benchmark):
"""
.. [1] Jamil, M. & Yang, X.-S. A Literature Survey of Benchmark Functions For Global Optimization
Problems Int. Journal of Mathematical Modelling and Numerical Optimisation, 2013, 4, 150-194.
"""
name = "Exp 2 Function"
latex_formula = r'f(x) = \sum_{i=0}^9 \left ( e^{-ix_1/10} - 5e^{-ix_2/10} - e^{-i/10} + 5e^{-i} \right )^2'
latex_formula_dimension = r'd = 2'
latex_formula_bounds = r'x_i \in [0, 20], \forall i \in \llbracket 1, d\rrbracket'
latex_formula_global_optimum = r'f(1, 10) = 0'
continuous = True
linear = False
convex = True
unimodal = False
separable = True
differentiable = True
scalable = False
randomized_term = False
parametric = False
modality = False # Number of ambiguous peaks, unknown # peaks
def __init__(self, ndim=None, bounds=None):
super().__init__()
self.dim_changeable = False
self.dim_default = 2
self.check_ndim_and_bounds(ndim, bounds, np.array([[0., 20.] for _ in range(self.dim_default)]))
self.f_global = 0.
self.x_global = np.array([1., 10.])
[docs] def evaluate(self, x, *args):
self.check_solution(x)
self.n_fe += 1
i = np.arange(10.)
vec = (np.exp(-i * x[0] / 10.) - 5 * np.exp(-i * x[1] / 10.) - np.exp(-i / 10.) + 5 * np.exp(-i)) ** 2
return np.sum(vec)
[docs]class Eckerle4(Benchmark):
"""
[1] Eckerle, K., NIST (1979). Circular Interference Transmittance Study.
[2] https://www.itl.nist.gov/div898/strd/nls/data/eckerle4.shtml
"""
name = "Eckerle 4 Function"
latex_formula = r'f(x) = '
latex_formula_dimension = r'd = 3'
latex_formula_bounds = r'0 <= x_1 <=20, 1 <= x_2 <= 20, 10 <= x_3 <= 600'
latex_formula_global_optimum = r'f(1.5543827178, 4.0888321754, 4.5154121844e2) = 1.4635887487E-03'
continuous = True
linear = False
convex = True
unimodal = False
separable = False
differentiable = True
scalable = False
randomized_term = False
parametric = False
modality = False # Number of ambiguous peaks, unknown # peaks
def __init__(self, ndim=None, bounds=None):
super().__init__()
self.dim_changeable = False
self.dim_default = 3
self.check_ndim_and_bounds(ndim, bounds, np.array([[0., 20.], [1., 20.], [10., 600.]]))
self.f_global = 1.4635887487E-03
self.x_global = np.array([1.5543827178, 4.0888321754, 4.5154121844e2])
self.a = np.asarray([1.5750000E-04, 1.6990000E-04, 2.3500000E-04,
3.1020000E-04, 4.9170000E-04, 8.7100000E-04,
1.7418000E-03, 4.6400000E-03, 6.5895000E-03,
9.7302000E-03, 1.4900200E-02, 2.3731000E-02,
4.0168300E-02, 7.1255900E-02, 1.2644580E-01,
2.0734130E-01, 2.9023660E-01, 3.4456230E-01,
3.6980490E-01, 3.6685340E-01, 3.1067270E-01,
2.0781540E-01, 1.1643540E-01, 6.1676400E-02,
3.3720000E-02, 1.9402300E-02, 1.1783100E-02,
7.4357000E-03, 2.2732000E-03, 8.8000000E-04,
4.5790000E-04, 2.3450000E-04, 1.5860000E-04,
1.1430000E-04, 7.1000000E-05])
self.b = np.asarray([4.0000000E+02, 4.0500000E+02, 4.1000000E+02,
4.1500000E+02, 4.2000000E+02, 4.2500000E+02,
4.3000000E+02, 4.3500000E+02, 4.3650000E+02,
4.3800000E+02, 4.3950000E+02, 4.4100000E+02,
4.4250000E+02, 4.4400000E+02, 4.4550000E+02,
4.4700000E+02, 4.4850000E+02, 4.5000000E+02,
4.5150000E+02, 4.5300000E+02, 4.5450000E+02,
4.5600000E+02, 4.5750000E+02, 4.5900000E+02,
4.6050000E+02, 4.6200000E+02, 4.6350000E+02,
4.6500000E+02, 4.7000000E+02, 4.7500000E+02,
4.8000000E+02, 4.8500000E+02, 4.9000000E+02,
4.9500000E+02, 5.0000000E+02])
[docs] def evaluate(self, x, *args):
self.check_solution(x)
self.n_fe += 1
vec = x[0] / x[1] * np.exp(-(self.b - x[2]) ** 2 / (2 * x[1] ** 2))
return np.sum((self.a - vec) ** 2)