Rachel Cavill
ABSTRACT
The dynamics of variable length representations in evolutionary computation have been shown to be complex and different from those seen in standard fixed length genetic algorithms. This paper explores a simple variable length genetic algorithm with multiple chromosomes and its underlying dynamics when used for the onemax problem. The changes in length of the chromosomes are especially observed and explanations for these fluctuations are sought.
- R. Cavill, S. Smith, and A. Tyrrell. Multi-chromosomal genetic programming. In Proceedings of Gecco, pages 1753--1761, 2005. Google Scholar
Digital Library
- R. Cavill, S. L. Smith, and A. M. Tyrrell. The performance of polyploid evolutionary algorithms is improved both by having many chromosomes and by having many copies of each chromosome on symbolic regression problems. In Proceedings of CEC, pages 935--941, 2005.Google ScholarCross Ref
- E. D. de Jong and D. Thierens. Exploiting modularity, hierarchy, and repetition in variable-length problems. In GECCO, pages 1030--1041, 2004.Google ScholarCross Ref
- I. Harvey. Species adaptation genetic algorithms: A basis for a continuing SAGA. In Proc. of the First European Conference on Artificial Life. MIT Press/Bradford Books, 1992.Google Scholar
- M. Nicolau and C. Ryan. Efficient crossover in the GAuGE system. In EuroGP Proceedings, volume 3003 of LNCS, pages 125--137, Coimbra, Portugal, 2004. Springer-Verlag.Google ScholarCross Ref
- C. Ryan, J. J. Collins, and M. O Neill. Grammatical evolution: Evolving programs for an arbitrary language. In EuroGP Proceedings, LNCS volume 1391, pages 83--95, Paris, 14-15 1998. Springer-Verlag. Google ScholarDigital Library
- C. Ryan, M. Nicolau, and M. O'Neill. Genetic algorithms using grammatical evolution. In LNCS, 2278:278--287, 2002. Google ScholarDigital Library
Index Terms
- Variable length genetic algorithms with multiple chromosomes on a variant of the Onemax problem
Recommendations
A new crossover mechanism for genetic algorithms with variable-length chromosomes for path optimization problems
A new crossover mechanism containing two operators is proposed.The new mechanism produces more cross point pairs than same point crossover.Our novel genetic algorithm has a desirable performance. Genetic Algorithm (GA) has found wide application in path ...
Genetic algorithm with variable length chromosomes for network intrusion detection
Genetic algorithm (GA) has received significant attention for the design and implementation of intrusion detection systems. In this paper, it is proposed to use variable length chromosomes (VLCs) in a GA-based network intrusion detection system. Fewer ...
Using messy genetic algorithms for solving the winner determination problem
GECCO '10: Proceedings of the 12th annual conference companion on Genetic and evolutionary computationThe paper presents a study on the application of messy genetic algorithms for the winner determination problem in the combinatorial auction realm. Messy genetic algorithms operate explicitly on building blocks in order to obtain good solutions. Since ...
Comments