ABSTRACT
The cohort intelligence (CI) algorithm is used to solve constrained optimization problems of thinning. The cohort here designates a group of candidates that are communicating and competing with each other to achieve their own individual goal, which is integrally common to all the candidates. This chapter explains the step-by-step procedure of how the algorithm works. Based on mathematical programming approaches, a constraint numerical optimization problem is transformed into an unconstrained numerical optimization problem. The main motive of using penalty factors is to favor the selection of feasible solutions over infeasible solutions. There are two types of penalty function methods: interior penalty function or barrier method and exterior penalty function method. The chapter also explains the manufacturing process of a sealing cover. The performance characteristic applied for sealing cover is thinning. The sealing cover has been selected for experimental validation to validate the results of the new proposed methodology.
