GA-EAM based hybrid algorithm

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

Abstract

The methods of searching optimal solutions are distinct in different evolutionary algorithms. Some of them do search by exploiting whereas others do by exploring the whole search space. For example Genetic Algorithm (GA) is good in exploitation whereas the Environmental Adaption Method (EAM) performs well in exploring the whole search space. Individually these algorithms have some limitations. In this paper a new hybrid algorithm has been proposed, which is created by combining the techniques of GA and EAM. The proposed algorithm attempts to remove the limitations of both GA and EAM and it is compared with some state-of-the-art algorithms like Particle Swarm Optimization-Time Variant Acceleration Coefficient (PSO-TVAC), Self-Adaptive Differential Evolution (SADE) and EAM on six benchmark functions with experimental results. It is found that the proposed hybrid algorithm gives better results than the existing algorithms. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Tripathi, A., Kumar, D., Mishra, K. K., & Misra, A. K. (2014). GA-EAM based hybrid algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8588 LNCS, pp. 13–20). Springer Verlag. https://doi.org/10.1007/978-3-319-09333-8_2

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