Fitness uniform optimization

IEEE Transactions on Evolutionary Computation

Volumn 10, Issue 5, 2006, Pages 568-589

  Hutter, Marcus ^a   Legg, Shane ^a  

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

Author keywords

Fitness tree model; Fitness uniform deletion scheme; Fitness uniform selection scheme; Local optima; Preserve diversity; Satisfiability; Set covering; Traveling salesman

Indexed keywords

FITNESS TREE MODEL; FITNESS UNIFORM DELETION SCHEME; FITNESS UNIFORM SELECTION SCHEME; LOCAL OPTIMA; SET COVERING;

COMPUTATIONAL COMPLEXITY; EVOLUTIONARY ALGORITHMS; OPERATIONS RESEARCH; SET THEORY; TREES (MATHEMATICS);

OPTIMIZATION;

EID: 33749866321     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2005.863127     Document Type: Article

References (35)

1. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley, 1989.
2. D. E. Goldberg and K. Deb, "A comparative analysis of selection schemes used in genetic algorithms," in Foundations of Genetic Algorithms, G. J. E. Rawlings, Ed. San Mateo, CA: Morgan Kaufmann, 1991, pp. 69-93.
3. T. Blickle and L. Thiele, "A mathematical analysis of tournament selection," in Proc. 6th Int. Conf. Genetic Algorithms, San Francisco, CA, 1995, pp. 9-16.
4. T. Blickle and L. Thiele, "A comparison of selection schemes used in evolutionary algorithms," Evol. Comput., vol. 4, no. 4, pp. 361-394, 1997.
5. M. Maza and B. Tidor, "An analysis of selection procedures with particular attention paid to proportional and Boltzmann selection," in Proc. 5th Int. Conf. Genetic Algorithms, San Mateo, CA, 1993, pp. 124-131. [Online]. Available: ftp://publications.ai.mit.edu/ ai-publications/1000-1499/AIM-1345.ps.
6. J. H. Holland, Adpatation in Natural and Artificial Systems. Ann Arbor, MI: Univ. of Michigan Press, 1975.
7. H. Mühlenbein and D. Schlierkamp-Voosen, "The science of breeding and its application to the breeder genetic algorithm (BGA)," Evol. Comput., vol. 1, no. 4, pp. 335-360, 1994.
8. D. Whitley, "The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best," in Proc. 3rd Int. Conf. Genetic Algorithms, San Mateo, CA, 1989, pp. 116-123.
9. J. E. Baker, "Adaptive selection methods for genetic algorithms," in Proc. 1st Int. Conf. Genetic Algorithms and Their Applications, Pittsburgh, PA, 1985, pp. 101-111.
10. A. E. Eiben, R. Hinterding, and Z. Michalewicz, "Parameter control in evolutionary algorithms," IEEE Trans. Evol. Comput., vol. 3, no. 2, pp. 124-141, 1999.
11. L. J. Eshelman, "The CHC adaptive search algorithm: How to safe search when engaging in nontraditional genetic recombination," in Foundations of Genetic Algorithms, G. J. E. Rawlings, Ed. San Mateo, CA: Morgan Kaufmann, 1991, pp. 265-283.
12. T. Bäck, F. Hoffmeister, and H. P. Schwefel, "A survey of evolution strategies," in Proc. 4th Int. Conf. Genetic Algorithms, San Diego, CA, Jul. 1991, pp. 2-9.
13. M. Herdy, "Reproductive isolation as strategy parameter in hierarchically organized evolution strategies," in Parallel Problem Solving From Nature 2. Amsterdam, The Netherlands: North-Holland, 1992, pp. 207-217.
14. D. Schlierkamp-Voosen and H. Mühlenbein, "Strategy adaptation by competing subpopulations," in Lecture Notes in Computer Science 866. Berlin, Germany: Springer-Verlag, 1994, Parallel Problem Solving From Nature (PPSN III), pp. 199-208.
15. D. E. Goldberg and J. Richardson, "Genetic algorithms with sharing for multimodal function optimization," in Proc. 2nd Int. Conf. Genetic Algorithms and Their Applications, Cambridge, MA, Jul. 1987, pp. 41-49.
16. K. Jong, "An analysis of the behavior of a class of genetic adaptive systems," Diss. Abstracts Int., vol. 36, no. 10, 1975. 5140B.
17. R. J. Collins and D. R. Jefferson, "Selection in massively parallel genetic algorithms," in Proc. 4th Int. Conf. Genetic Algorithms, San Mateo, CA, 1991, pp. 249-256.
18. G. Rudolph, "On takeover times in spatially structured populations: array and ring," in Proc. 2nd Asia-Pacific Conf. Genetic Algorithms Applications (APGA '00), K. K. Lai, O. Katai, M. Gen, and B. Lin, Eds., Hong Kong, China, 2000, pp. 144-151.
19. D. J. Cavicchio, "Adaptive search using simulated evolution," Ph.D. dissertation, Univ. of Michigan, Ann Arbor, MI, 1970.
20. M. Hutter, "Fitness uniform selection to preserve genetic diversity," in Proc. IEEE Congr. Evol. Comput., Washington, DC, May 2002, pp. 783-788. [Online]. Available: http://arxiv.org/abs/cs.AI/ 0103015.
21. S. Legg, M. Hutter, and A. Kumar, "Tournament versus fitness uniform selection," in Proc. IEEE Congr. Evol. Comput., Portland, OR, 2004, pp. 2144-2151. [Online]. Available: http://arxiv.org/abs/cs.AI/0103038.
22. S. Legg and M. Hutter, "Fitness uniform deletion for robust optimization," in Proc. Genetic Evol. Comput. Conf., Washington, OR, 2005, pp. 1271-1278. [Online]. Available: http://arxiv.org/abs/cs.NE/ 0504035.
23. A. Rogers and A. Prügel-Bennett, "Genetic drift in genetic algorithm selection schemes," IEEE Trans. Evol. Comput., vol. 3, no. 4, pp. 298-303, 1999.
24. M. Hutter, "Implementierung eines Klassifizierungs-Systems," M.S. thesis (in German), Theoretische Informatik, TU München, 1991.
25. A. Rogers and A. Prügel-Bennett, "Modeling the dynamics of a steady-state genetic algorithm," in Foundations of Genetic Algorithms 5, W. Banzhaf and C. Reeves, Eds. San Francisco, CA: Morgan Kaufmann, 1999, pp. 57-68.
26. S. Forrest and M. Mitchell, "What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation," Mach. Learn., vol. 13, no. 2-3, pp. 285-319, 1993.
27. S. Lin and B. W. Kernighan, "An effective heuristic for the travelling salesman problem," Oper. Res., vol. 21, pp. 498-516, 1973.
28. O. Martin and S. Otto, "Combining simulated annealing with local search heuristics," Ann. Oper. Res., vol. 63, pp. 57-75, 1996.
29. D. S. Johnson and A. McGeoch, "The traveling salesman problem: A case study," in Local Search in Combinatorial Optimization. ser. Discrete Mathematics and Optimization, E. H. L. Aarts and J. K. Lenstra, Eds. Chichester, U.K.: Wiley-Interscience, 1997, ch. 8, pp. 215-310.
30. D. Applegate, W. Cook, and A. Rohe, "Chained Lin-Kernighan for large traveling salesman problems," Dept. of Computational and Applied Mathematics, Rice Univ., Houston, TX, 2000. Tech. Rep., [Online]. Available: http://www.isye.gatech.edu/~wcook/papers/chained_1k.ps.
31. D. Goldberg and R. L. Alleles, "Loci and the traveling salesman problem," in Proc. Int. Conf. Genetic Algorithms and Their Applications, 1985, pp. 154-159.
32. J. Beasley and P. Chu, "A genetic algorithm for the set covering problem," Eur. J. Oper. Res., vol. 94, pp. 392-404, 1996.
33. J. Beasley. (2003) Or-library. [Online]. Available: Mscmga.ms.ic.ac.uk/ jeb/orlib/scpinfo.html
34. P. Crescenzi and V. Kann. (2003) A compendium of NP optimization problems. [Online]. Available: www.nada.kth.se/~viggo/problemlist/ compendium.html
35. H. H. Hoos and T. Stützle, "SATLIB: An online resource for research on SAT," in SAT 2000, 2000, pp. 283-292.