Research Article
Modified Backtracking Search Optimization Algorithm Inspired by Simulated Annealing for Constrained Engineering Optimization Problems
Table 3
Characters of the 13 benchmark functions.
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
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. |