Exploring population structures for locally concurrent and massively parallel Evolutionary Algorithms

2008 IEEE Congress on Evolutionary Computation, CEC 2008

Volumn , Issue , 2008, Pages 2605-2612

  Laredo, J L J ^a   Castillo, P A ^a   Mora, A M ^a   Merelo, J J ^a  

^a UNIVERSITY OF GRANADA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

AGENT MODELS; ALGORITHM SPEEDS; ASYNCHRONY; BASE-LINES; CANONICAL GENETIC ALGORITHMS; CELLULAR EVOLUTIONARY ALGORITHMS; COMPLETE GRAPHS; CORE PROCESSORS; DISCRETE OPTIMIZATION PROBLEMS; EMPIRICAL RESULTS; EXPERIMENTAL EVALUATIONS; GOSSIP PROTOCOLS; NEIGHBOURHOOD; PARALLEL EVOLUTIONARY ALGORITHMS; PEER-TO-PEER NETWORKS; POPULATION STRUCTURES; SINGLE THREADS; THREADING MODELS;

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTER ARCHITECTURE; COMPUTER NETWORKS; GENETIC ALGORITHMS; GRAPH THEORY; PARALLEL ALGORITHMS; SCHEDULING; TOPOLOGY;

EVOLUTIONARY ALGORITHMS;

EID: 55749100981     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2008.4631148     Document Type: Conference Paper

References (22)

1. A. E. Eiben and J. E. Smith, Introduction to Evolutionary Computing. SpringerVerlag, 2003.
2. M. Tomassini, Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time (Natural Computing Series). Secaucus, NJ, USA: Springer-Verlag New York, Inc., 2005.
3. E. Cantú-Paz, Efficient and Accurate Parallel Genetic Algorithms, Norwell, MA, USA: Kluwer Academic Publishers, 2000.
4. J. Grefenstette, "Parallel adaptive algorithms for function optimization," Vanderbilt University, Computer Science Department, Nashville, Tech. Rep. CS-81-19, 1981.
5. R. Steinmetz and K. Wehrle, "What is this peer-to-peer about?" in Peer-to-Peer Systems and Applications, ser. Lecture Notes in Computer Science, R. Steinmetz and K. Wehrle, Eds., vol. 3485. Springer, 2005, pp. 9-16.
6. E. Cantú-Paz, "Topologies, migration rates, and multi-population parallel genetic algorithms," in Proceedings of the Genetic and Evolutionary Computation Conference, vol. 1. Orlando, Florida, USA: Morgan Kaufmann, 13-17 July 1999, pp. 91-98.
7. W. R. M. U. K. Wickramasinghe, M. van Steen, and A. E. Eiben, "Peer-to-peer evolutionary algorithms with adaptive autonomous selection," in GECCO'07: Proceedings of the 9th annual conference on Genetic and evolutionary computation. New York, NY, USA: ACM Press, 2007, pp. 1460-1467.
8. J. L. J. Laredo, E. A. Eiben, M. Schoenauer, P. A. Castillo, A. M. Mora, and J. J. Merelo, "Exploring selection mechanisms for an agent-based distributed evolutionary algorithm," in GECCO V7: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation. New York, NY, USA: ACM Press, 2007, pp. 2801-2808.
9. M. Giacobini, M. Tomassini, A. Tettamanzi, and E. Alba, "Selection intensity in cellular evolutionary algorithms for regular lattices," IEEE Transactions on Evolutionary Computation, vol. 9, no. 5. pp. 489-505, 2005.
10. M. Giacobini, E. Alba, A. Tettamanzi, and M. Tomassini, "Modeling selection intensity for toroidal cellular evolutionary algorithms," in GECCO'04: Proceedings of the 2004 conference on Genetic and evolutionary computation, ser. LNCS. Springer Berlin / Heidelberg, 2004, pp. 1138-1149.
11. M. Giacobini, M. Tomassini, and A. Tettamanzi, "Takeover time curves in random and small-world structured populations," in GECCO'05: Proceedings of the 2005 conference on Genetic and evolutionary computation. New York, NY, USA: ACM, 2005, pp. 1333-1340.
12. M. Preuss and C. Lasarczyk, "On the importance of information speed in structured populations." in PPSN, ser. Lecture Notes in Computer Science, vol. 3242. Springer, 2004, pp. 91-100. [Online], Available: http://dblp.uni-trier.de/db/conf/ppsn/ppsn2004.html#PreussL04
13. M. Giacobini, M. Preuss, and M. Tomassini, "Effects of scale-free and small-world topologies on binary coded self-adaptive CEA," in Evolutionary Computation in Combinatorial Optimization - EvoCOP 2006, ser, LNCS, J. Gottlieb and G. R. Raidl, Eds., vol. 3906. Budapest: Springer Verlag, 10-12 April 2006, pp. 85-96.
14. M. Jelasity and M. van Steen, "Large-scale newscast computing on the Internet," Vrije Universiteit Amsterdam, Department of Computer Science, Amsterdam, The Netherlands, Tech. Rep. IR-503, October 2002. [Online], Available: http://www.cs.vu.nl/pub/papers/globe/IR-503.02.pdf
15. D. Doval and D. O'Mahony, "Overlay networks: A scalable alternative for P2P," IEEE Internet Computing, vol. 7, no. 4, pp. 79-82, July/August 2003.
16. M. Jelasity, A. Montresor, and O. Babaoglu, "Gossip-based aggregation in large dynamic networks," ACM Trans. Comput. Syst., vol. 23, no. 3, pp. 219-252, 2005.
17. S. Voulgaris, M. Jelasity, and M. van Steen, A Robust and Scalable Peer-to-Peer Gossiping Protocol, ser. Lecture Notes in Computer Science. Springer Berlin / Heidelberg, 2004, vol. 2872, pp. 47-58.
18. B. Dorronsoro, E. Alba, M. Giacobini, and M. Tomassini, "The influence of grid shape and asynchronicity on cellular evolutionary algorithms," in IEEE International Conference on Evolutionary Computation, Y. Shi, Ed. Portland, Oregon: IEEE Press, June 20-23 2004, pp. 2152-2158. [Online]. Available: citeseer.ist.psu.edu/dorronsoro04influence.html
19. D. Watts and S. Strogatz, "Collective dynamics of 'small-world' networks," Nature, vol. 393, pp. 440-442, 1998.
20. D. E. Goldberg, K. Deb, and J. Horn, "Massive multimodality, deception, and genetic algorithms," in Parallel Problem Solving from Nature, 2, R. Manner and B. Manderick, Eds. Amsterdam: Elsevier Science Publishers, B. V., 1992. [Online]. Available: http://citeseer.ist.psu.edu/ 133799.html
21. F. MacWilliams and N. Sloane, The Theory of Error-Correcting Codes. North-Holland: Amsterdam, 1977.
22. S. Droste, T. Jansen, and I. Wegener, "A natural and simple function which is hard for all evolutionary algorithms," in IEEE International Conference on Industrial Electronics, Control and Instrumentation, IEC0N. Piscataway, NJ: IEEE Press, 2000, pp. 2704-2709.