Generation-free agent-based evolutionary computing

6Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

Metaheuristics resulting from the hybridization of multi-agent systems with evolutionary computing are efficient in many optimization problems. Evolutionary multi-agent systems (EMAS) are more similar to biological evolution than classical evolutionary algorithms. However, technological limitations prevented the use of fully asynchronous agents in previous EMAS implementations. In this paper we present a new algorithm for agent-based evolutionary computations. The individuals are represented as fully autonomous and asynchronous agents. Evolutionary operations are performed continuously and no artificial generations need to be distinguished. Our results show that such asynchronous evolutionary operators and the resulting absence of explicit generations lead to significantly better results. An efficient implementation of this algorithm was possible through the use of Erlang technology, which natively supports lightweight processes and asynchronous communication. © The Authors. Published by Elsevier B.V.

Cite

CITATION STYLE

APA

Krzywicki, D., Stypka, J., Anielski, P., Faber, Turek, W., Byrski, A., & Kisiel-Dorohinicki, M. (2014). Generation-free agent-based evolutionary computing. In Procedia Computer Science (Vol. 29, pp. 1068–1077). Elsevier. https://doi.org/10.1016/j.procs.2014.05.096

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