On the design and analysis of competent selecto-recombinative GAs

Evolutionary Computation

Volumn 12, Issue 2, 2004, Pages 243-267

  Van Dijk, Steven ^a   Thierens, Dirk ^a   De Berg, Mark ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Competent selecto recombinative GAs; Convergence analysis; Design rules; Map labeling; Population sizing; Scalability

Indexed keywords

COMPETENT SELECTO-RECOMBINATIVE GAS; CONVERGENCE ANALYSIS; DESIGN RULES; MAP LABELING; POPULATION SIZING; SCALABILITY;

CONVERGENCE OF NUMERICAL METHODS; DESIGN AIDS; KNOWLEDGE BASED SYSTEMS; LABELING; MAPPING; POPULATION STATISTICS;

MAPS;

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; GAME; POPULATION DENSITY; THEORETICAL MODEL;

ALGORITHMS; GAME THEORY; MODELS, GENETIC; MODELS, THEORETICAL; POPULATION DENSITY;

EID: 2542548230     PISSN: 10636560     EISSN: None     Source Type: Journal    
DOI: 10.1162/106365604323142842     Document Type: Article

References (46)

1. T. Bäck. Generalized convergence models for tournament- and (μ,λ)-selection. In L. J. Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms and their Applications, pages 2-8. Morgan-Kaufman, 1995.
2. P. A. N. Bosman and D. Thierens. Multi-objective optimization with diversity preserving mixture-based iterated density estimation evolutionary algorithms. International Journal of Approximate Reasoning, 31(3):259-289, 2002.
3. E. Cantú-Paz et al., editors. Lecture Notes in Computer Science, Volume 2723: Proceedings of the Genetic and Evolutionary Computation Conference, 2003. Springer-Verlag.
4. J. Christensen, J. Marks, and S. Shieber. An empirical study of algorithms for point-feature label placement. ACM Transactions on Graphics, 14(3):203-232, 1995.
5. K. Deb and D. E. Goldberg. Sufficient conditions for deceptive and easy binary functions. Annals of Mathematics and Artificial Intelligence, 10(4), 1993.
6. W. Feller. An Introduction to Probability Theory and its Applications (2nd edition). Wiley, 1966.
7. M. Formann and F. Wagner. A packing problem with applications to lettering of maps. In Proceedings of the Seventh Annual ACM Symposium on Computational Geometry, pages 281-288, 1991.
8. D. E. Goldberg. Genetic algorithms and Walsh functions: Part I, a gentle introduction. Complex Systems, 3(2):129-152, 1989a.
9. D. E. Goldberg. Genetic algorithms and Walsh functions: Part II, deception and its analysis. Complex Systems, 3(2):153-171, 1989b.
10. D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989c.
11. D. E. Goldberg. The Design of Innovation. Lessons from and for Competent Genetic Algorithms. Kluwer, 2002.
12. D. E. Goldberg, K. Deb, and J. H. Clark. Genetic algorithms, noise, and the sizing of populations. Complex Systems, 6(4):333-362, 1992.
13. G. Harik. Linkage learning via probabilistic modeling in the ECGA. Technical Report 99010, University of Illinois, 1999.
14. G. Harik, E. Cantú-Paz, D. E. Goldberg, and B. L. Miller. The gambler's ruin problem, genetic algorithms, and the sizing of populations. Evolutionary Computation, 7(3): 231-253, 1999.
15. T. Jansen and I. Wegener. Real royal road functions - where crossover provably is essential. In L. Spector et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference, pages 375-382. Morgan-Kaufmann, 2001.
16. H. Kargupta. SEARCH, Polynomial Complexity, And The Fast Messy Genetic Algorithm. PhD thesis, University of Illinois at Urbana-Champaign, 1995.
17. H. Kargupta. The gene expression messy genetic algorithm. In Proceedings of the IEEE International Conference on Evolutionary Computation, pages 814-819. IEEE Press, 1996.
18. F. G. Lobo, D. E. Goldberg, and M. Pelikan. Time complexity of genetic algorithms on exponentially scaled problems. In D. Whitley et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference, pages 151-158. Morgan-Kaufmann, 2000.
19. J. Marks and S. Shieber. The computational complexity of cartographic label placement. Technical Report TR-05-91, Harvard CS, 1991.
20. B. L. Miller and D. E. Goldberg. Genetic algorithms, selection schemes, and the varying effects of noise. Evolutionary Computation, 4(2):113-131, 1996.
21. H. Mühlenbein and T. Mahnig. Convergence theory and applications of the factorized distribution algorithm. Journal of Computing and Information Technology, 7:19-32, 1999.
22. H. Mühlenbein and G. Paass. From recombination of genes to the estimation of distributions: I. binary parameters. In W. Ebeling et al., editors, Lecture Notes in Computer Science, Volume 1141: Proceedings of the Parallel Problem Solving from Nature IV Conference, pages 178-187. Springer-Verlag, 1996.
23. H. Mühlenbein and D. Schlierkamp-Voosen. Predictive models for the breeder genetic algorithm: Continuous parameter optimization. Evolutionary Computation, 1(1):25-49, 1993.
24. M. Munetomo and D. E. Goldberg. Identifying linkage groups by nonlinearity/non-monotonicity detection. In W. Banzhaf et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference, pages 433-440. Morgan-Kaufmann, 1999.
25. M. Pelikan, D. E. Goldberg, and F. G. Lobo. A survey of optimization by building and using probabilistic models. Computational optimization and applications, 21(1):5-20, 2002.
26. R. Poli. Recursive conditional schema theorem, convergence and population sizing in genetic algorithms. In L. D. Whitley and M. D. Vose, editors, Proceedings of the Sixth Foundations of Genetic Algorithms Conference, pages 143-163. Morgan-Kaufman, 2000.
27. G. Raidl. A genetic algorithm for labeling point features. In Proceedings of the International Conference on Imaging Science, Systems, and Technology, pages 189-196, Las Vegas, NV, 1998.
28. J. Rowe. The dynamical systems model of the simple genetic algorithm. In L. Kallel, B. Naudts, and A. Rogers, editors, Theoretical Aspects of Evolutionary Computing, Natural Computing Series, pages 31-58. Springer-Verlag, 2001.
29. K. Sastry and D. E. Goldberg. Scalability of selectorecombinative genetic algorithms for problems with tight linkage. In Cantú-Paz et al. (2003), pages 1332-1344.
30. J. L. Shapiro, A. Prügel-Bennett, and L. M. Rattray. A statistical mechanical formulation of the dynamics of genetic algorithms. In T. C. Fogarty, editor, Lecture Notes in Computer Science, Volume 865: Proceedings of the AISE Workshop on Evolutionary Computing, pages 17-27. Springer, 1994.
31. C. Stephens and H. Waelbroeck. Schemata evolution and building blocks. Evolutionary Computation, 7(2):109-124, 1999.
32. T. Strijk. Geometric Algorithms for Cartographic Label Placement. PhD thesis, Utrecht University, Department of Computer Science, 2001.
33. T. Strijk, B. Verweij, and K. Aardal. Algorithms for maximum independent set applied to map labelling. Technical Report UU-CS-2000-22, Department of Computer Science, Utrecht University, 2000.
34. D. Thierens. Selection schemes, elitist recombination, and selection intensity. In T. Bäck, editor, Proceedings of the Seventh International Conference on Genetic Algorithms and their Applications, pages 152-159. Morgan-Kaufmann, 1997.
35. D. Thierens. Scalability problems of simple genetic algorithms. Evolutionary Computation, 7(4):331-352, 1999.
36. D. Thierens and D. E. Goldberg. Mixing in genetic algorithms. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms and their Applications, pages 38-45. Morgan-Kaufmann, 1993.
37. D. Thierens and D. E. Goldberg. Convergence models of genetic algorithm selection schemes. In Y. Davidor et al., editors, Lecture Notes in Computer Science, Volume 866: Proceedings of the Parallel Problem Solving from Nature III Conference, pages 119-129. Springer-Verlag, 1994a.
38. D. Thierens and D. E. Goldberg. Elitist recombination: An integrated selection recombination GA. In Proceedings of the IEEE International Conference on Evolutionary Computation, pages 508-512. IEEE Press, 1994b.
39. D. Thierens, D. E. Goldberg, and A. G. Pereira. Domino convergence, drift, and the temporal-salience structure of problems. In Proceedings of the IEEE World Congress on Computational Intelligence, pages 535-540. IEEE Press, 1998.
40. S. van Dijk. Genetic Algorithms for Map Labeling. PhD thesis, Utrecht University, 2001. URL http://www.cs.uu.nl/people/steven/download/thesis.pdf.
41. S. van Dijk, D. Thierens, and M. de Berg. Using genetic algorithms for solving hard problems in GIS. GeoInformatica, 6(4):381-413, 2002.
42. S. van Dijk, D. Thierens, and L. C. van der Gaag. Building a GA from design principles for learning Bayesian networks. In Cantú-Paz et al. (2003), pages 886-897.
43. O. Verner, R. Wainwright, and D. Schoenefeld. Placing text labels on maps and diagrams using genetic algorithms with masking. INFORMS Journal on Computing, 9(3): 266-275, 1997.
44. B. Verweij. Selected Applications of Integer Programming: A Computational Case Study. PhD thesis, Utrecht University, Department of Computer Science, 2000.
45. M. D. Vose. The Simple Genetic Algorithm: Foundations and theory. MIT Press, 1999.
46. M. Yamamoto, G. Camâara, and L. A. N. Lorena. Tabu search heuristic for point-feature cartographic label placement. GeoInformatica, 6(1):77-90, 2002.