Anisotropic selection in cellular genetic algorithms

GECCO 2006 - Genetic and Evolutionary Computation Conference

Volumn 1, Issue , 2006, Pages 559-566

  Verel, Sébastien ^a   Simoncini, David ^a   Collard, Philippe ^a   Clergue, Manuel ^a  

^a UNIVERSITÉ CÔTE D'AZUR   (France)

Author keywords

Combinatorial optimization; Evolutionary computation

Indexed keywords

ANISOTROPIC SELECTION (AS); CELLULAR GENETIC ALGORITHMS (CGA); QUADRATIC ASSIGNMENT PROBLEMS;

ANISOTROPY; BIODIVERSITY; CELLS; OPTIMIZATION;

GENETIC ALGORITHMS;

EID: 33750257600     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. E. Alba and B. Dorronsoro. The exploration/exploitation tradeoff in dynamic cellular genetic algorithms. In IEEE transactions on Evolutionnary Computation, volume 9, pages 126-142, 2005.
2. E. Alba and J. M. Troya. Cellular evolutionary algorithms: Evaluating the influence of ratio. In PPSN, pages 29-38, 2000.
3. J. R. C.E. Nugent, T.E. Vollman. An experimental comparison of techniques for the assignment of techniques to locations. Operations Research, 16:150-173, 1968.
4. W. Cedeño and V. R. Vemuri. On the use of niching for dynamic landscapes. IEEE International Conference on Evolutionary Computation, pages 1-6, 1997.
5. M. Giacobini, E. Alba, A. Tettamanzi, and M. Tomassini. Modeling selection intensity for toroidal cellular evolutionary algorithms. In GECCO, pages 3-11, 2004.
6. M. Giacobini, A. Tettamanzi, and M. Tomassini. Modelling selection intensity for linear cellular evolutionary algorithms. In P. L. et al., editor, Artificial Evolution, Sixth International Conference, Evolution Artificielle, EA 2003, Lecture Notes in Computer Science, pages 345-356, Marseille, France, October 2003. Springer.
7. D. E. Golberg and J. Richardson. Genetic algorithms with sharing for multimodal function optimization. International Conference on Genetic Algorithms, pages 41-49, 1987.
8. D. E. Goldberg and K. Deb. A comparative analysis of selection schemes used in genetic algorithms. In FOCA, pages 69-93, 1990.
9. K. A. D. Jong and J. Sarma. On decentralizing selection algorithms. In ICGA, pages 17-23, 1995.
10. T. Koopmans and M. Beckmann. Assignment problems and the location of economic activities. Econometrica, 25(1):53-76, 1957.
11. V. V. Migkikh, A. P. Topchy, V. M. Kureichik, and A. Y. Tetelbaum. Combined genetic and local search algorithm for the quadratic assignment problem.
12. B. Sareni and L. Krähenbühl. Fitness sharing and niching methods revisited. IEEE transactions on evolutionary computation, 2(3):1-9, 1998.
13. J. Sarma and K. A. De Jong. An analysis of the effects of neighborhood size and shape on local selection algorithms. In PPSN, pages 236-244, 1996.
14. P. Spiessens and B. Manderick. A massively parallel genetic algorithm: Implementation and first analysis. In ICGA, pages 279-287, 1991.