Cohort intelligence algorithm for discrete and mixed variable engineering problems

TLDR: The performance of an emerging socio inspired metaheuristic optimization technique referred to as Cohort Intelligence (CI) algorithm is evaluated on discrete and mixed variable nonlinear constrained optimization problems.

Abstract: In this study, the performance of an emerging socio inspired metaheuristic optimization technique referred to as Cohort Intelligence (CI) algorithm is evaluated on discrete and mixed variable nonlinear constrained optimization problems. The investigated problems are mainly adopted from discrete structural optimization and mixed variable mechanical engineering design domains. For handling the discrete solution variables, a round off integer sampling approach is proposed. Furthermore, in order to deal with the nonlinear constraints, a penalty function method is incorporated. The obtained results are promising and computationally more efficient when compared to the other existing optimization techniques including a Multi Random Start Local Search algorithm. The associated advantages and disadvantages of CI algorithm are also discussed evaluating the effect of its two parameters namely the number of candidates, and sampling space reduction factor.