Exploring selection mechanisms for an agent-based distributed evolutionary algorithm

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. Categories and Subject Descriptors I.2.8 [Computing Methodologies]: Artificial Intelligence— Problem Solving, Control Methods, and Search, Heuristic Methods ; C.2.4 [Computer Systems Organization]: COMPUTERCOMMUNICATION NETWORKS—Distributed Systems General Terms Algorithms Keywords self-adaptation, genetic algorithms, multi-agent systems, parallelization, performance analysis

• Type: Conference
• Year: 2007
• Where: GECCO
• Authors: A. E. Eiben, Marc Schoenauer, Juan Luís Jiménez Laredo, Pedro A. Castillo Valdivieso, Antonio Miguel Mora, Juan J. Merelo Guervós
• Keywords: Classical Tournament Method, GECCO 2007, Selection Mechanism, Terms Algorithms Keywords