A new asynchronous parallel evolutionary algorithm for function optimization

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

Abstract

This paper introduces a new asynchronous parallel evolutionary algorithm (APEA) based on the island model for solving function optimization problems. Our fully distributed APEA overlaps the communication and computation efficiently and is inherently fault-tolerant in a large-scale distributed computing environment. For the scalable BUMP problem, our APEA algorithm achieves the best solution for the 50-dimension problem, and is the first algorithm of which we are aware that can solve the 1,000,000- dimension problem. For other benchmark problems, our APEA finds the best solution to G7 in fewer time steps than [16,17], and finds a better solution to G10 than [17].

Cite

CITATION STYLE

APA

Liu, P., Lau, F., Lewis, M. J., & Wang, C. L. (2002). A new asynchronous parallel evolutionary algorithm for function optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2439, pp. 401–410). Springer Verlag. https://doi.org/10.1007/3-540-45712-7_39

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