CA-DE: Hybrid algorithm based on cultural algorithm and DE

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

Abstract

Optimization problems can be articulated by numerous practical problems. These glitches stance a test for the academics in the proposal of proficient procedures skilled in digging out the preeminent elucidation with the slightest computing cost. In this study, we worked on differential evolution and cultural algorithm, conglomerates the features of both the algorithms, and proposes a new evolutionary algorithm. This jointure monitors the complex collaboration amalgam of two evolutionary algorithms, where both are carried out in analogous. The novel procedure termed as CA-DE accomplishes an inclusive inhabitant that is pooled among both metaheuristics algorithms concurrently. The aspect of the recycled approval action in credence space is to update the information of the finest individuals with the present information. This collective collaboration arises among both the algorithms and is presented to mend the eminence of resolutions, ahead of the individual performance of both the algorithms. We have applied the newly proposed algorithm on a set of six standard benchmark optimization problems to evaluate the performance. The comparative results presented demonstrate that CA-DE has an encouraging accomplishment and expandable conducts while equated with new contemporary advanced algorithms.

Cite

CITATION STYLE

APA

Dixit, A., Kumar, S., Pant, M., & Bansal, R. (2019). CA-DE: Hybrid algorithm based on cultural algorithm and DE. In Advances in Intelligent Systems and Computing (Vol. 748, pp. 185–196). Springer Verlag. https://doi.org/10.1007/978-981-13-0923-6_16

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