Tournament versus fitness uniform selection

Proceedings of the 2004 Congress on Evolutionary Computation, CEC2004

Volumn 2, Issue , 2004, Pages 2144-2151

  Legg, Shane ^a   Hutter, Marcus ^a   Kumar, Akshat ^b  

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

^b INDIAN INSTITUTE OF TECHNOLOGY GUWAHATI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

FINTNESS FORM SELECTION; HAMMING DISTANCE; TOURNAMENT SELECTION;

GRAPH THEORY; MEASUREMENT THEORY; POPULATION STATISTICS; PROBLEM SOLVING; RANDOM PROCESSES; SET THEORY; TRAVELING SALESMAN PROBLEM;

EVOLUTIONARY ALGORITHMS;

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

References (16)

1. D. E. Goldberg and J. Richardson. Genetic algorithms with sharing for multi-modal function optimization. In J. J. Grefenstette, editor, Proceedings of the 2nd International Conference on Genetic Algorithms and their Applications, pages 41-49, Cambridge, MA, July 1987. Lawrence Erlbaum Associates.
2. K. de Jong. An analysis of the behavior of a class of genetic adaptive systems. Dissertation Abstracts International, 36(10), 5140B, 1975.
3. R. J. Collins and D. R. Jefferson. Selection in massively parallel genetic algorithms. In R. K. Belew and L. B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, San Mateo, CA, 1991. Morgan Kaufmann Publishers.
4. M. Hutter. Fitness uniform selection to preserve genetic diversity. In X. Yao, editor, Proceedings of the 2002 Congress on Evolutionary Computation (CEC-2002), pages 783-788, Washington D.C, USA, May 2002. IEEE.
5. 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.
6. Alex Rogers and Adam Prügel-Bennett. Modelling the dynamics of a steady-state genetic algorithm. In Wolfgang Banzhaf and Colin Reeves, editors, Foundations of Genetic Algorithms 5, pages 57-68. Morgan Kaufmann, San Francisco, CA, 1999.
7. S. Lin and B. W. Kernighan. An effective heuristic for the travelling salesman problem. Operations Research, 21:498-516, 1973.
8. O. Martin and S. Otto. Combining simulated annealing with local search heuristics. Annals of Operations Research, 63:57-75, 1996.
9. 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.
10. 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. http://www.isye.gatech.edu/~wcook/papers/chained_lk.ps
11. D. Goldberg and R. Lingle. Alleles. Loci and the traveling salesman problem. In Proceedings of the International Conference on Genetic Algorithms and their Applications, pages 154-159. Lawrence Erlbaum Associates, 1985.
12. D. Applegate, R. Bixby, V. Chvátal, and W. Cook. National traveling salesman problems. http://www.math.princeton.edu/tsp/world/countries.html, 2003.
13. J. Beasley and P. Chu. A genetic algorithm for the set covering problem. European Journal of Operational Research, 94:392-404, 1996.
14. J. Beasley. Or-library. http://mscmga.ms.ic.ac.uk/jeb/orlib/scpinfo.html, 2003.
15. P. Crescenzi and V. Kann. A compendium of NP optimization problems. http://www.nada.kth.se/~viggo/problemlist/compendium.html, 2003.
16. Holger H. Hoos and Thomas Stützle. SATLIB: An Online Resource for Research on SAT. In T. Walsh I.P.Gent, H.v.Maaren, editor, SAT 2000, pages 283-292. IOS press, 2000.