Constrained cohort intelligence using static and dynamic penalty function approach for mechanical components design

  title={Constrained cohort intelligence using static and dynamic penalty function approach for mechanical components design},
  author={Omkar Kulkarni and Ninad Kulkarni and Anand Jayant Kulkarni and Ganesh M. Kakandikar},
  journal={International Journal of Parallel, Emergent and Distributed Systems},
  pages={570 - 588}
AbstractMost of the metaheuristics can efficiently solve unconstrained problems; however, their performance may degenerate if the constraints are involved. [] Key Method The approaches have been tested by solving several constrained test problems. The performance of the SCI and DCI have been compared with algorithms like GA, PSO, ABC, d-Ds. In addition, as well as three real world problems from mechanical engineering domain with improved solutions. The results were satisfactory and validated the…
Cohort intelligence algorithm for discrete and mixed variable engineering problems
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.
Cohort intelligence with self-adaptive penalty function approach hybridized with colliding bodies optimization algorithm for discrete and mixed variable constrained problems
A new self-adaptive penalty function (SAPF) approach is proposed and incorporated into socio-inspired Cohort Intelligence (CI) algorithm, referred to as CI–SAPf, which is hybridized with Colliding Bodies Optimization (CBO) algorithm and are promising and computationally efficient when compared with other nature inspired optimization algorithms.
Predictive Modeling of a Flexible Robotic Arm using Cohort Intelligence Socio-Inspired Optimization
  • R. Sekhar, Pritesh Shah
  • Computer Science
    2020 1st International Conference on Information Technology, Advanced Mechanical and Electrical Engineering (ICITAMEE)
  • 2020
For similar fitting predictive models, the CI converges to the optimum model parameters much faster than GA, indicating the superiority of the socio-inspired CI metahueristic towards faster predictive modeling of complex robotic systems in industry.
Optimization of advanced manufacturing processes using socio inspired cohort intelligence algorithm
The optimization of process parameters of Ultrasonic machining (USM) and Abrasive water jetMachining (AWJM) processes to maximize the Material Removal Rate (MRR) using a socio inspired Cohort Intelligent (CI) algorithm.
Mesh smoothing of complex geometry using variations of cohort intelligence algorithm
A socio-inspired optimization approach referred to as cohort intelligence (CI) was investigated for mesh smoothing and the performance of follow best and roulette wheel variations of CI algorithm was observed to be satisfactory as compared to other variations of the algorithm.
Solution to Small Size 0–1 Knapsack Problem Using Cohort Intelligence with Educated Approach
The knapsack problem is solved using the same algorithm, but with an educated approach for the selection of the candidates, and optimal solution of each candidate is achieved by execution of different conditions of the approach.
Finite Element Mesh Smoothing Using Cohort Intelligence
Optimize-based smoothing method is proposed for the improvement of hexahedral mesh without any inverted elements using condition number-based objective function which defines qualities of individual elements in the hexahed mesh.
Application of Grasshopper Optimization Algorithm for Constrained and Unconstrained Test Functions
Grasshopper Optimization algorithm is one of the recent algorithm for optimization. This algorithm is swarm based nature inspired algorithm which mimics and mathematically models the behaviour of
Design of a fractional PIλDμ controller using the cohort intelligence method
The cohort intelligence (CI) method is used for the first time to optimize the parameters of the fractional proportionalintegral- derivative (PID) controller and the standard deviations demonstrated the robustness of the proposed algorithm in solving control problems.
Minimization of Clearance Variation of a Radial Selective Assembly Using Cohort Intelligence Algorithm
Selective assembly is a cost-effective approach to attaining necessary clearance variation in the resultant assembled product from the low precision elements and achieves convergence in less number of iterations and computational time compared to the other algorithms previously used to solve this problem.


Pressure Vessel Design Using the Dynamic Self-adaptive Harmony Search Algorithm
One of the most common benchmarking constrained chemical engineering problems; namely pressure vessel design, is considered and a modified DSHS algorithm is proposed to handle both types of variables utilizing a simple penalty function.
An exact penalty function-based differential search algorithm for constrained global optimization
By applying the idea of exact penalty function approach, a DS algorithm, where an S-type dynamical penalty factor is introduced so as to achieve a better balance between exploration and exploitation, is developed for constrained global optimization problems.
Constraint handling in Firefly Algorithm
The performance of the emerging metaheuristic swarm optimization technique of Firefly Algorithm when incorporated with the generalized constrained handling techniques such as penalty function method, feasibility-based rule and the combination of both, i.e. combined approach is compared.
Comparing bio-inspired algorithms in constrained optimization problems
A comparison of four bio- inspired algorithms with a similar constraint-handling mechanism (Deb's feasibility rules) to solve constrained optimization problems and the performance of traditional versions of each algorithm is analyzed.
A simple multimembered evolution strategy to solve constrained optimization problems
The proposed approach to solve global nonlinear optimization problems uses a simple diversity mechanism based on allowing infeasible solutions to remain in the population to find the global optimum despite reaching reasonably fast the feasible region of the search space.
Solving Constrained Optimization Problems Via Subset Simulation
This paper extends the application of Subset Simulation (SS), an advanced Monte Carlo algorithm for reliability analysis, to solve constrained optimization problems encountered in engineering to investigate the efficiency and robustness of the proposed algorithm.
Evolutionary Optimization of Constrained Problems
This chapter deals with a new approach which will utilize a log-dynamic penalty function method in the NES algorithm that has been proposed and tested in the previous chapter.
What Makes a Constrained Problem Difficult to Solve by an Evolutionary Algorithm
An empirical study about the features that prevent an Evolutionary Algorithm to reach the feasible region or even get the global optimum when it is used to solve global optimization constrained
Solving Constrained Optimization Problems Using Probability Collectives and a Penalty Function Approach
This paper demonstrates the theory of probability collectives (PC) in the collective intelligence (COIN) framework, supplemented with a penalty function approach for constraint handling and three benchmark problems have been solved.