Solution to constrained test problems using cohort intelligence algorithm

13Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Most of the real world problems are inherently constrained in nature. There are several nature inspired algorithms being developed; however their performance degenerate when applied solving constrained problems. This paper proposes Cohort Intelligence (CI) approach in which a probability based constrained handling approach is incorporated. This approach is tested by solving four well known test problems. The performance is compared and discussed with regard to the robustness, computational cost, standard deviation and rate of convergence etc. The constrained CI approach is used here to solve few inequality based constrained problems. The solution to these problems indicates that the CI approach can be further efficiently applied to solve a variety of practical/real world problems.

Cite

CITATION STYLE

APA

Shastri, A. S., Jadhav, P. S., Kulkarni, A. J., & Abraham, A. (2016). Solution to constrained test problems using cohort intelligence algorithm. In Advances in Intelligent Systems and Computing (Vol. 424, pp. 427–435). Springer Verlag. https://doi.org/10.1007/978-3-319-28031-8_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free