An improved cohort intelligence with panoptic learning behavior for solving constrained problems

Ganesh Krishnasamy, Anand J. Kulkarni, Apoorva S. Shastri

Research output: Chapter in Book/Report/Conference proceedingChapter (Book)Researchpeer-review

Abstract

In this paper, we present a new optimization algorithm referred to as Cohort Intelligence with Panoptic learning (CI-PL). This proposed algorithm is a modified version of Cohort Intelligence (CI), where Panoptic learning (PL) is incorporated into CI which makes every cohort candidate learn the most from the best candidate but at same time it does not completely ignore the other candidates. The PL is assisted with a new sampling interval reduction method based on the standard deviation between the behaviors of the cohort candidates. A variety of well-known set of unconstrained and constrained test problems have been successfully solved by using the proposed algorithm. The CI-PL approach produced competent and sufficiently robust results solving unconstrained, constrained, and engineering problems. The associated strengths, weaknesses, and possible real-world extensions are also discussed.
Original languageEnglish
Title of host publicationConstraint Handling in Metaheuristics and Applications
EditorsAnand J. Kulkarni, Efrén Mezura-Montes, Yong Wang, Amir H. Gandomi, Ganesh Krishnasamy
Place of PublicationSingapore Singapore
PublisherSpringer
Pages29-54
Number of pages26
Edition1st
ISBN (Electronic)9789813367104
ISBN (Print)9789813367098, 9789813367128
DOIs
Publication statusPublished - 2021

Cite this