Fitness uniform deletion: A simple way to diversity

GECCO 2005 - Genetic and Evolutionary Computation Conference

Volumn , Issue , 2005, Pages 1271-1278

  Legg, Shane ^a   Hutter, Marcus ^a  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

Genetic algorithms; Population diversity

Indexed keywords

GENETIC ALGORITHMS; OPTIMIZATION; ROBUSTNESS (CONTROL SYSTEMS); SYSTEMS ANALYSIS;

OPTIMISATION METHODS; POPULATION DIVERSITY;

PROBLEM SOLVING;

EID: 32444438300     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1068009.1068216     Document Type: Conference Paper

References (20)

1. D. Applegate, W. Cook, and A. Rohe. Chained Lin-Kernighan for large traveling salesman problems. Technical report, Department of Computational and Applied Mathematics, Rice University, Houston, TX, 2000.
2. J. Beasley. Or-library. mscmga.ms.ic.ac.uk/jeb/orlib/scpinfo.html, 2003.
3. J. Beasley and P. Chu. A genetic algorithm for the set covering problem. European Journal of Operational Research, 94:392-404, 1996.
4. R. J. Collins and D. R. Jefferson. Selection in massively parallel genetic algorithms. In Proc. Fourth International Conference on Genetic Algorithms, San Mateo, CA, 1991. Morgan Kaufmann Publishers.
5. P. Crescenzi and V. Kann. A compendium of NP optimization problems. www.nada.kth.se/~viggo/problemlist/compendium.html, 2003.
6. S. Forrest and M. Mitchell. What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation. Machine Learning, 13(2-3):285-319, 1993.
7. D. Goldberg and R. L. Alleles. Loci and the traveling salesman problem. In Proc. International Conference on Genetic Algorithms and their Applications, pages 154-159. Lawrence Erlbaum Associates, 1985.
8. D. E. Goldberg and J. Richardson. Genetic algorithms with sharing for multi-modal function optimization. In Proc. 2nd International Conference on Genetic Algorithms and their Applications, pages 41-49, Cambridge, MA, July 1987. Lawrence Erlbaum Associates.
9. H. H. Hoos and T. Stützte. SATLIB: An Online Resource for Research on SAT. In SAT 2000, pages 283-292. IOS press, 2000.
10. M. Hutter. Implementierung eines Klassifizierungs-Systems. Master's thesis, Theoretische Informatik, TU München, 1991. 72 pages with C listing, in German, http://www.idsia.ch/~marcus/ai/pcfs.htm.
11. M. Hutter. Fitness uniform selection to preserve genetic diversity. In Proc. 2002 Congress on Evolutionary Computation (CEC-2002), pages 783-788, Washington D.C, USA, May 2002. IEEE.
12. M. Hutter. Fast non-parametric Bayesian inference on infinite trees. In Proc. 15th International Conference on Artificial Intelligence and Statistics (AISTATS-2005), pages 1-8, Barbados, 2005.
13. D. S. Johnson and A. McGeoch. The traveling salesman problem: A case study. In E. H. L. Aarts and J. K. Lenstra, editors, Local Search in Combinatorial Optimization, Discrete Mathematics and Optimization, chapter 8, pages 215-310. Wiley-Interscience, Chichester, England, 1997.
14. K. Jong. An analysis of the behavior of a class of genetic adaptive systems. Dissertation Abstracts International, 36(10), 5140B, 1975.
15. S. Legg. Website. www.idsia.ch/~shane, 2004.
16. S. Legg, M. Hutter, and A. Kumar. Tournament versus fitness uniform selection. In Proceeding of the 2004 Congress on Evolutionary Computation, 2004.
17. S. Lin and B. W. Kernighan. An effective heuristic for the travelling salesman problem. Operations Research, 21:498-516, 1973.
18. S. W. Mahfoud. Niching Methods for Genetic Algorithms. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, IL, May 1995.
19. O. Martin and S. Otto. Combining simulated annealing with local search heuristics. Annals of Operations Research, 63:57-75, 1996.
20. A. Rogers and A. Prügel-Bennett. Modelling the dynamics of a steady-state genetic algorithm. In W. Banzhaf and C. Reeves, editors, Foundations of Genetic Algorithms 5, pages 57-68. Morgan Kaufmann, San Francisco, CA, 1999.