E. A. Eiben
M. Schoenauer
ABSTRACT
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.
- M. Arenas, P. Collet, A. Eiben, M. Jelasity, J. Merelo, B. Paechter, M. Preuss, and M. Schoenauer. A framework for distributed evolutionary algorithms. In J. M. Guervós, P. Adamidis, H. Beyer, J. F.-V. nas, and H. Schwefel, editors, Parallel Problem Solving from Nature - PPSN VII, 7th International Conference, Granada, Spain, September 7-11, 2002. Proceedings, number 2439 in Lecture Notes in Computer Science, LNCS, pages 665--675. Springer-Verlag, 2002. Google Scholar
Digital Library
- J. Berntsson. G2DGA: an adaptive framework for internet-based distributed genetic algorithms. In GECCO '05: Proceedings of the 2005 workshops on Genetic and evolutionary computation, pages 346--349, 2005. Google ScholarDigital Library
- E. Cantú-Paz. Topologies, migration rates, and multi-population parallel genetic algorithms. In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 1, pages 91--98, Orlando, Florida, USA, 13-17 July 1999. Morgan Kaufmann.Google Scholar
- E. Cantú-Paz. Efficient and Accurate Parallel Genetic Algorithms. Kluwer Academic Publishers, Norwell, MA, USA, 2000. Google ScholarDigital Library
- D. Doval and D. O'Mahony. Overlay networks: A scalable alternative for P2P. IEEE Internet Computing, 7(4):79--82, July/August 2003. Google ScholarDigital Library
- A. Eiben, E. Marchiori, and V. Valkó. Evolutionary algorithms with on-the-fly population size adjustment. In Parallel Problem Solving from Nature - PPSN VIII, volume 3242 of LNCS, pages 41--50, Birmingham, UK, September 2004. Springer-Verlag.Google Scholar
- A. E. Eiben and J. E. Smith. Introduction to Evolutionary Computing. Springer Verlag, 2003. Google ScholarDigital Library
- I. Hidalgo and F. Fernández. Balancing the computatione Evolutionary Computation, 2005. The 2005 IEEE Congress on, volume 2, pages 1645--1652. IEEE Press, 2005.Google ScholarCross Ref
- M. Jelasity, A. Montresor, and O. Babaoglu. Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst., 23(3):219--252, 2005. Google ScholarDigital Library
- M. Jelasity and M. van Steen. Large-scale newscast computing on the Internet. Technical Report IR-503, Vrije Universiteit Amsterdam, Department of Computer Science, Amsterdam, The Netherlands, October 2002.Google Scholar
- J. L. J. Laredo, P. Castillo, A. Mora, and J. Merelo. Estudio preliminar sobre auto adaptación en agentes evolutivos sobre arquitecturas heterogéneas. In XVII Jornadas de Paralelismo - XVII JP, pages 389--394, September 2006.Google Scholar
- J. Laredo, E. Eiben, M. Schoenauer, P. Castillo, A. Mora, F. Fernández, and J. Merelo. Self-adaptive gossip policies for distributed population-based algorithms, 2007. http://arxiv.org/abs/cs/0703117.Google Scholar
- E. Lawler, J. Lenstra, A. R. Kan, and D. Shmoys. The travelling salesman problem: A guided tour of combinatorial optimization. New York: Wiley and Sons, 1985.Google Scholar
- W. Lee. Parallelizing evolutionary computation: A mobile agent-based approach. Expert Systems with Applications, 32(2):318--328, 2007.Google ScholarCross Ref
- H. P. Nii. Blackboard systems: The blackboard model of problem solving and the evolution of blackboard architectures. AI Magazine, 7(2):38--53, 1986. Cited By (since 1996): 101. Google ScholarDigital Library
- R. Steinmetz and K. Wehrle. What is this peer-to-peer about? In R. Steinmetz and K. Wehrle, editors, Peer-to-Peer Systems and Applications, volume 3485 of Lecture Notes in Computer Science, pages 9--16. Springer, 2005.Google Scholar
- J.-P. Vacher, A. Cardon, F. Lesage, and T. Galinho. Genetic Algorithms in a Multi-Agent System. In Proceedings IEEE International Joint Symposia on Intelligence and Systems, pages 17--26, Rockville, MD, USA, 1998. Google ScholarDigital Library
- E. Viveros and B. Barán. Algoritmos genéticos asíncronos combinados para una red heterogénea de computadoras. In Conferencia Internacional de Ciencia y Tecnología parael Desarrollo, 1997. http://www.cnc.una.py/cms/invest/download.php?id=46205,66.Google Scholar
- S. Voulgaris, M. Jelasity, and M. van Steen. A robust and scalable peer-to-peer gossiping protocol. In Moro, Sartori, and Singh, editors, Agents and Peer-to-Peer Computing, volume 2872 of Lecture Notes in Computer Science (LNCS), pages 47--58. Springer Berlin/Heidelberg, 2004. Google ScholarDigital Library
- L. Wang, A. Maciejewski, H. Siegel, and V. Roychowdhury. A comparative study of five parallel genetic algorithms using the traveling salesman problem. In IPPS: 11th International Parallel Processing Symposium, pages 345--349. IEEE Computer Society Press, 1998. Google ScholarDigital Library
Comments