A Dynamic Step-size Adaptation Roach Infestation Algorithm for Constrained Engineering Optimization Problems

Engineering problems belong to a large and complex category of optimization problems with non-linear and nonconvex functions; conventional methods are no longer sufficient to handle such problems. Meta-heuristic optimization algorithms have been proved in literature for being able to tackle complex problems. A new meta-heuristic algorithm called dynamic step-size roach infestation optimization algorithm based on searching behaviour of cockroaches was published recently. A Simple Euler method was introduced into a roach infestation optimization algorithm for the enhancement of swarm stability and to allow a balance of exploitation and exploration. The results of the experiments, show its superiority over the existing algorithms. In this work the same method was applied; and modified to solve a constrained engineering problem. The results obtained from simulation processes are close to those obtained by other meta-heuristic methods.