Random heuristic search

Theoretical Computer Science

Volumn 229, Issue 1-2, 1999, Pages 103-142

  Vose, Michael D ^a  

^a UNIVERSITY OF TENNESSEE   (United States)

Author keywords

Degenerate royal road functions; Modeling evolutionary algorithms; Random heuristic search

Indexed keywords

EID: 0003997509     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00120-6     Document Type: Article

References (32)

1. E. Akin, The General Topology of Dynamical Systems, American Mathematical Society, Providence, RI, 1993.
2. M. Arbib, E. Manes, Arrows, Structures, and Functors, the Categorical Imperative, Academic Press, New York, 1975.
3. M. Eberlein, The GA heuristic generically has hyperbolic fixed points, Ph.D. Dissertation, The University of Tennessee, 1996.
4. W. Feller, An Introduction to Probability Theory and its Applications, Wiley, New York, 1968.
5. F. R. Gantmacher, Matrix Theory, Chelsea, New york, 1997.
6. J. Holland, Adaptation in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor, 1975.
7. J. Juliany, M.D. Vose, The genetic algorithm fractal, Evolutionary Comput. 2(2) (1994) 165-180.
8. G. Koehler, S. Bhattacharyya, M.D. Vose, General cardinality genetic algorithms, Evolutionary Comput. 5(4) (1997) 439-459.
9. M. Mitchell, J. Holland, S. Forrest, When will a genetic algorithm outperform hill climbing? in: Cowan, Tesauro, Alspector (Eds.), Advances in Neural Information Processing Systems 6, Morgan Kaufmann, San Mateo, CA, 1994.
10. A. Nix, M.D. Vose, Modeling genetic algorithms with Markov chains, Ann. Math. Artif. Intel. 5 (1992) 79-88.
11. Y. Rabinovich, A. Wigderson, An analysis of a simple genetic algorithm, in: Belew, Booker (Eds.), Proc. 4th Internat. Conf. on Genetic Algorithms, Morgan Kaufmann, Los Atlos, CA, 1991, pp. 215-221.
12. N. Radcliffe, P. Surry, Fundamental limitations on search algorithms: evolutionary computing in perspective, in: Lecture Notes in Computer Science, vol. 1000, Springer, New York, 1995, pp. 275-291.
13. A. Renyi, Probability Theory, North-Holland, Amsterdam, 1970.
14. Rowe, Population fixed-points for functions of unitation, in: Banzhaf, Reeves (Eds.), Foundations of Genetic Algorithms 5, Morgan Kaufmann, San Francisco, CA, pp. 69-84.
15. J. Shapiro, A. Prugel-Bennett, Maximum entropy analysis of genetic algorithm operators, in: Lecture Notes in Computer Science, vol. 993, Springer, Berlin, 1995, pp. 14-24.
16. J. Shapiro, A. Prugel-Bennett, M. Rattray, A statistical mechanical formulation of the dynamics of genetic algorithms, in: Lecture Notes in Computer Science, vol. 865, Springer, Berlin, 1994, pp. 17-27.
17. E. van Nimwegen, J. Crutchfield, M. Mitchell, Finite populations induce metastability in evolutionary search, Phys. Lett. A 229 (1997) 144-150.
18. E. van Nimwegen, J. Crutchfield, M. Mitchell, Statistical dynamics of the royal road genetic algorithm, Theoret. Comput. Sci., this issue.
19. M.D. Vose, Formalizing genetic algorithms, in: Proc. IEEE Workshop on Genetic Algorithms, Neural Nets, and Simulated Annealing Applied to Problems in Signal and Image Processing, May 1990, Glasgow, U.K.
20. M.D. Vose, A closer look at mutation in genetic algorithms, Ann. Math. Artif. Intell. 10 (1994) 423-434.
21. M.D. Vose, Modeling alternate selection schemes for genetic algorithms, in: Koppel, Shamir (Eds.), Proc. BISFAI '95, 1995, pp. 166-178.
22. M.D. Vose, Modeling simple genetic algorithms, Evolutionary Comput. 3(4) (1995) 453-472.
23. M.D. Vose, Logarithmic convergence of random heuristic search, Evolutionary Comput. 4(4) (1996) 395-404.
24. M.D. Vose, What are genetic algorithms? A mathematical perspective, in: Davis, De Jong, Davis, Vose, Whitley (Eds.), Evolutionary Algorithms, vol. 111, Springer, Berlin, 1999, pp. 251-276.
25. M.D. Vose, The Simple Genetic Algorithm: Foundations and Theory, MIT press, Cambridge, MA, 1999.
26. M.D. Vose, Random heuristic search: applications to gas and functions of unitation, Computer Methods in Applied Mechanics and Engineering, in press.
27. M.D. Vose, G. Liepins, Punctuated equilibria in genetic search, Complex Systems 5 (1991) 31-44.
28. M.D. Vose, A. Wright, Simple genetic algorithms with linear fitness, Evolutionary Comput. 2(4) (1994) 347-368.
29. M.D. Vose, A. Wright, The Walsh transform and the theory of the simple genetic algorithm, in: S. Pal, P. Wang (Eds.), Genetic Algorithms for Pattern Recognition, CRC Press, Boca Raton, 1996, pp. 25-43.
30. J.H. Wilkinson, The Algebraic Eigenvalue Problem, Oxford University Press, London, 1965.
31. D. Wolpert, W. Macready, No free lunch theorems for search, Santa Fe Institute Technical Report, 1994, SFI-TR-95-02-010.
32. A. Wright, M.D. Vose, Finiteness of the fixed point set for the simple genetic algorithm, Evolutionary Comput. 3(3) (1995) 299-309.