Search Results for author: Anand J Kulkarni

Found 7 papers, 0 papers with code

Solution to Advanced Manufacturing Process Problems using Cohort Intelligence Algorithm with Improved Constraint Handling Approaches

no code implementations16 Oct 2023 Aniket Nargundkar, Madhav Rawal, Aryaman Patel, Anand J Kulkarni, Apoorva S Shastri

Cohort Intelligence (CI) algorithm is a socio inspired optimization technique which is successfully applied for solving several unconstrained & constrained real-world problems from the domains such as design, manufacturing, supply chain, healthcare, etc.

Evolutionary Algorithms

Modified LAB Algorithm with Clustering-based Search Space Reduction Method for solving Engineering Design Problems

no code implementations4 Oct 2023 Ruturaj Reddy, Utkarsh Gupta, Ishaan Kale, Apoorva Shastri, Anand J Kulkarni

Furthermore, a Clustering-Based Search Space Reduction (C-SSR) method is proposed, making the algorithm capable to solve constrained problems.

A socio-physics based hybrid metaheuristic for solving complex non-convex constrained optimization problems

no code implementations2 Sep 2022 Ishaan R Kale, Anand J Kulkarni, Efren Mezura-Montes

The second algorithm combines CI-SAPF with the intrinsic properties of the physics-based Colliding Bodies Optimization (CBO) referred to CI-SAPF-CBO.

LAB: A Leader-Advocate-Believer Based Optimization Algorithm

no code implementations23 Apr 2022 Ruturaj Reddy, Anand J Kulkarni, Ganesh Krishnasamy, Apoorva S Shastri, Amir H. Gandomi

This manuscript introduces a new socio-inspired metaheuristic technique referred to as Leader-Advocate-Believer based optimization algorithm (LAB) for engineering and global optimization problems.

Multi-Cohort Intelligence Algorithm: An Intra- and Inter-group Learning Behavior based Socio-inspired Optimization Methodology

no code implementations1 May 2018 Apoorva S Shastri, Anand J Kulkarni

A Multi-Cohort Intelligence (Multi-CI) metaheuristic algorithm in emerging socio-inspired optimization domain is proposed.

Cannot find the paper you are looking for? You can Submit a new open access paper.