Geometric differential evolution for combinatorial and programs spaces

Evolutionary Computation

Volumn 21, Issue 4, 2013, Pages 591-624

  Moraglio, A ^a   Togelius, J ^b   Silva, S ^c  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b IT UNIVERSITY OF COPENHAGEN   (Denmark)

^c INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

Combinatorial spaces; Differential evolution; Genetic programming; Principled design of search operators; Representations; Theory

Indexed keywords

COMBINATORIAL SPACES; DIFFERENTIAL EVOLUTION; REPRESENTATIONS; SEARCH OPERATORS; THEORY;

GENETIC PROGRAMMING; GEOMETRY; STRING SEARCHING ALGORITHMS; VECTOR SPACES;

EVOLUTIONARY ALGORITHMS;

ALGORITHM; ARTICLE; COMPUTER PROGRAM; GAME;

ALGORITHMS; GAME THEORY; SOFTWARE;

EID: 84887157250     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/EVCO_a_00099     Document Type: Article

References (28)

1. Caprara, A. (1997). Sorting by reversals is difficult. In Proceedings of the 1st Annual International Conference on Computational Molecular Biology, pp. 75-83.
2. Ekart, A., and Nemeth, S. Z. (2000). A metric for genetic programs and fitness sharing. In Proceedings of the European Conference on Genetic Programming, EuroGP'2000, pp. 259-270.
3. Gong, T., and Tuson, A. L. (2007). Differential evolution for binary encoding. In Soft Computing in Industrial Applications (pp. 251-262). Berlin: Springer-Verlag.
4. Kauffman, S. (1993). Origins of order: Self-organization and selection in evolution. Oxford, UK: Oxford University Press.
5. Kennedy, J., and Eberhart, R. C. (1997). A discrete binary version of the particle swarm algorithm. In Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, Computational Cybernetics and Simulation, pp. 4104-4108.
6. Kennedy, J., and Eberhart, R. C. (2001). Swarm intelligence. San Mateo, CA: Morgan Kaufmann.
7. Koza, J. R. (1992). Genetic programming:On the programming of computers by means of natural selection. Cambridge, MA: MIT Press.
8. Langdon, W., and Poli, R. (2002). Foundations of genetic programming. Berlin: Springer-Verlag.
9. Moraglio, A. (2007). Towards a geometric unification of evolutionary algorithms. Ph.D. thesis, University of Essex, UK.
10. Moraglio, A., Di Chio, C., and Poli, R. (2007). Geometric particle swarm optimization. In Proceedings of the European Conference on Genetic Programming, pp. 125-136.
11. Moraglio, A., Di Chio, C., Togelius, J., and Poli, R. (2008). Geometric particle swarm optimization. Journal of Artificial Evolution and Applications, doi: 10.1155/2008/143624.
12. Moraglio, A., and Poli, R. (2004). Topological interpretation of crossover. In Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1377-1388.
13. Moraglio, A., and Poli, R. (2005). Geometric landscape of homologous crossover for syntactic trees. In Proceedings of IEEE Congress on Evolutionary Computation, pp. 427-434.
14. Moraglio, A., and Poli, R. (2006a). Product geometric crossover. In Proceedings of Parallel Problem Solving from Nature Conference, pp. 1018-1027.
15. Moraglio, A., and Poli, R. (2006b). Inbreeding properties of geometric crossover and nongeometric recombinations. In Proceedings of the Workshop on the Foundations of Genetic Algorithms, pp. 1-14.
16. Moraglio, A., and Poli, R. (2011). Topological crossover for the permutation representation. Intelligenza Artificiale 5(1):49-70.
17. Moraglio, A., and Togelius, J. (2007). Geometric PSO for the Sudoku puzzle. In Proceedings of the Genetic and Evolutionary Computation Conference, pp. 118-125.
18. Moraglio, A., and Togelius, J. (2009). Geometric differential evolution. In Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 1705-1712.
19. Moraglio, A., Togelius, J., and Lucas, S. (2006). Product geometric crossover and the Sudoku puzzle. In Proceedings of IEEE Congress on Evolutionary Computation, pp. 470-476.
20. O'Neill, M., and Brabazon, A. (2006). Grammatical differential evolution. In Proceedings of the 2006 International Conference on Artificial Intelligence, pp. 231-236.
21. Onwubolu, G. C., and Davendra, D. (Eds.). (2009). Differential evolution: A handbook for global permutation-based combinatorial optimization. Berlin: Springer.
22. Pampara, G., Engelbrecht, A. P., and Franken, N. (2006). Binary differential evolution. In Proceedings of the IEEE Congress on Evolutionary Computation, pp. 1873-1879.
23. Price, K. V., Storm, R. M., and Lampinen, J. A. (2005). Differential evolution: A practical approach to global optimization. Berlin: Springer.
24. Storn, R., and Price, K. (1997). Differential evolution a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11(4):341-359.
25. Syswerda, G. (1989). Uniform crossover in genetic algorithms. In Proceedings of the Third International Conference on Genetic Algorithms, pp. 2-9.
26. Togelius, J., De Nardi, R., and Moraglio, A. (2008). Geometric PSO+GP = particle swarm programming. In Proceedings of the Congress on Evolutionary Computation (CEC), pp. 3594-3600.
27. Whitley, D., Starkweather, T., and Shaner, D. (1991). Travelling salesman and sequence scheduling: Quality solutions using genetic edge recombination. In L. Davis (Ed.), Handbook of Genetic Algorithms (pp. 350-372). New York: Van Nostrand Reinhold.
28. Yato, T. (2003). Complexity and completeness of finding another solution and its application to puzzles. Master's thesis, University of Tokyo, Japan.