Research Article

Modified Backtracking Search Optimization Algorithm Inspired by Simulated Annealing for Constrained Engineering Optimization Problems

Table 3

Characters of the 13 benchmark functions.

Fun. Type (%) LI NI LE NE Active

g0113Quadratic0.000390006
g0220Nonlinear99.997311001
g0310Nonlinear0.000000011
g045Quadratic27.007906002
g054Nonlinear0.000020033
g062Nonlinear0.005702002
g0710Quadratic0.000335006
g082Nonlinear0.858102000
g097Nonlinear0.519904002
g108Linear0.002033003
g112Quadratic0.097300011
g123Quadratic4.76790000
g135Nonlinear0.000000123

Note. “” is the number of variables. “” represents feasibility ratio. “LI,” “NI,” “LE,” and “NE” represent linear inequality, nonlinear inequality, linear equality, and nonlinear equality, respectively. “Active” represents the number of active constraints at the global optimum.