Implementation matters: Programming best practices for evolutionary algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6692 LNCS, Issue PART 2, 2011, Pages 333-340

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

^a UNIVERSITY OF GRANADA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CHROMOSOME SIZE; EFFICIENT IMPLEMENTATION; PERFORMANCE IMPROVEMENTS; BEST PRACTICES; HEURISTIC OPERATORS;

HEURISTIC ALGORITHMS; MATHEMATICAL OPERATORS; NEURAL NETWORKS;

EVOLUTIONARY ALGORITHMS;

EID: 79957929915     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21498-1_42     Document Type: Conference Paper

References (24)

1. Merali, Z.: Computational science: Error, why scientific programming does not compute. Nature 467(7317), 775-777 (2010)
2. Merelo-Guervós, J.J.: A Perl primer for EA practitioners. SIGEvolution 4(4), 12-19 (2010)
3. Wall, L., Christiansen, T., Orwant, J.: Programming Perl, 3rd edn. O'Reilly & Associates, Sebastopol (2000)
4. Schwartz, R.L., Phoenix, T., foy, B.D.: Learning Perl, 5th edn. OŔeilly & Associates (2008)
5. Laredo, J., Castillo, P., Mora, A., Merelo, J.: Exploring population structures for locally concurrent and massively parallel evolutionary algorithms. In: Computational Intelligence: Research Frontiers, pp. 2610-2617. IEEE Press, Los Alamitos (2008)
6. Merelo-Guervós, J.J.: Algoritmos evolutivos en Perl. Ponencia presentada en el V Congreso Hispalinux, disponible en (November 2002), http://congreso.hispalinux.es/ponencias/merelo/ae-hispalinux2002.html
7. Merelo-Guervós, J.J.: OPEAL, una librería de algoritmos evolutivos en Perl. In: Alba, E., Fernández, F., Gómez, J.A., Herrera, F., Hidalgo, J.I., Merelo-Guervós, J.J., Sánchez, J.M. (eds.) Actas primer congreso español algoritmos evolutivos, AEB 2002, Universidad de Extremadura, pp. 54-59 (February 2002)
8. Arenas, M., Foucart, L., Merelo-Guervós, J.J., Castillo, P.A.: JEO: a framework for Evolving Objects in Java. In: [24], pp. 185-191, http://geneura.ugr.es/pub/papers/jornadas2001.pdf
9. Castellano, J., Castillo, P., Merelo-Guervós, J.J., Romero, G.: Paralelización de evolving objects library usando MPI. In: [24], pp. 265-270
10. Keijzer, M., Merelo, J.J., Romero, G., Schoenauer, M.: Evolving objects: A general purpose evolutionary computation library. In: Collet, P., Fonlupt, C., Hao, J.-K., Lutton, E., Schoenauer, M. (eds.) EA 2001. LNCS, vol. 2310, pp. 231-244. Springer, Heidelberg (2002)
11. Fogel, D., Bäck, T., Michalewicz, Z.: Evolutionary Computation: Advanced algorithms and operators. Taylor & Francis, Abington (2000)
12. Setzkorn, C., Paton, R.: JavaSpaces-An Affordable Technology for the Simple Implementation of Reusable Parallel Evolutionary Algorithms. Knowledge Exploration in Life Science Informatics, 151-160
13. Rummler, A., Scarbata, G.: eaLib - A Java Frameword for Implementation of Evolutionary Algorithms. Theory and Applications Computational Intelligence, 92-102
14. Wong, M., Wong, T.: Implementation of parallel genetic algorithms on graphics processing units. Intelligent and Evolutionary Systems, 197-216 (2009)
15. Schubert, T., Mackensen, E., Drechsler, N., Drechsler, R., Becker, B.: Specialized hardware for implementation of evolutionary algorithms. In: Genetic and Evolutionary Computing Conference, Citeseer, p. 369 (2000)
16. Merelo-Guervós, J.J., Castillo, P.A., Alba, E.: Algorithm: Evolutionary, a flexible Perl module for evolutionary computation. Soft Computing (2009), http://sl.ugr.es/000K (to be published)
17. Ventura, S., Ortiz, D., Hervás, C.: JCLEC: Una biblioteca de clases java para computación evolutiva. In: Primer Congreso Español de Algoritmos Evolutivos y Bioinspirador, pp. 23-30. Mérida, Spain (2002)
18. Ventura, S., Romero, C., Zafra, A., Delgado, J., Hervás, C.: JCLEC: a Java framework for evolutionary computation. Soft Computing-A Fusion of Foundations, Methodologies and Applications 12(4), 381-392 (2008)
19. Salomon, R.: Improving the performance of genetic algorithms through derandomization. Software - Concepts and Tools 18(4), 175 (1997)
20. Digalakis, J.G., Margaritis, K.G.: On benchmarking functions for genetic algorithms. International Journal of Computer Mathematics 77(4), 481-506 (2001)
21. Muhlenbein, H.: How genetic algorithms really work: I. mutation and hillclimbing. In: Munner, R., Manderick, B. (eds.) Proceedings of the Second Conference on Parallel Problem Solving from Nature (PPSN II). pp. 15-25. North-Holland, Amsterdam (1992)
22. Hoare, C.: Quicksort. The Computer Journal 5(1), 10 (1962)
23. Cole, R.: Parallel merge sort.In: 27th Annual Symposium on Foundations of Computer Science 1985, pp. 511-516 (1986)
24. UPV. In: Actas XII Jornadas de Paralelismo, UPV, Universidad Politécnica de Valencia (2001)