In this paper we propose an agent-based model of evolutionary algorithms (EAs) which extends seamlessly from concurrent single-host to distributed multi-host installations. Since the model is based on locally executable selection, we focus on the comparison of two selection mechanisms which accomplish with such a restriction: the classical tournament method and a new one called autonomous selection. Using the latter method the population size changes during runtime, hence it is not only interesting as a new selection mechanism, but also from the perspective of scalable networks.
['E. A. Eiben', 'Marc Schoenauer', 'J. L. J. Laredo', 'P. A. Castillo', 'A. M. Mora', 'J. J. Merelo']
Exploring selection mechanisms for an agent-based distributed evolutionary algorithm