On an Exact Populationary Model of Genetic Algorithms

Information Sciences

Volumn 99, Issue 1-2, 1997, Pages 37-67

  Mandavilli, Srinivas ^a   Patnaik, L M ^b  

^a MOTOROLA INC   (United States)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; INFORMATION RETRIEVAL; MATHEMATICAL OPERATORS;

GENERALIZED BINOMIALLY DISTRIBUTED POPULATION (GBDP);

GENETIC ALGORITHMS;

EID: 0031162809     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(96)00048-5     Document Type: Article

References (28)

1. D. H. Ackley, A Connections Machine for Genetic Hill Climbing, Kluwer Academic, Norwell, MA, 1987.
2. R. Belew (Ed.), Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kaufmann, Los Altos, CA, 1991, pp. 77-84.
3. W. W. Bledsoe, The use of biological concepts in the analytical study of systems, presented at the ORSA-TIMS National Meeting, San Francisco, CA, Nov. 1961.
4. C. L. Bridges and D. E. Goldberg, An analysis of reproduction and crossover in a binary coded genetic algorithm, in: J. J. Greffenstette (Ed.), Proceedings of the Second International Conference of Genetic Algorithms, 1987.
5. K. Deb and D. E. Goldberg, Analyzing deception in trap functions, IlliGAL Report No. 91009, Illinois Genetic Algorithms Lab., University of Illinois at Urbana-Champaign, 1991.
6. L. J. Eshelman, R. Caruana, and D. Schaffer, Biases in the crossover landscape, in: Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann, Los Altos, CA, 1989, pp. 10-19.
7. D. B. Fogel and J. W. Atmar, Comparing genetic operators with Gaussian mutations in simulated evolutionary process using linear systems, Biol. Cyber. 63:111-114 (1990).
8. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.
9. D. E. Goldberg and P. Sergest, Finite Markov chain analysis of genetic algorithms, in: J. J. Grefenstette (Ed.), Proceedings of the Second International Conference on Genetic Algorithms, 1987, pp. 1-8.
10. D. E. Goldberg, Real-coded genetic algorithms, virtual codes, and blocking, Technical Report No. 90001, University of Illinois at Urbana-Champaign, 1990.
11. D. E. Goldberg, Construction of higher order deceptive functions using low order Walsh coefficients, IlliGAL Report No. 90002, Genetic Algorithms Lab., University of Illinois at Urbana-Champaign.
12. J. J. Grefenstette, Optimization of control parameters for genetic algorithms, IEEE Trans. Syst. Man, Cyber. SMC-16(1):122-128 (1986).
13. J. H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975.
14. H. Muehlenbein, How genetic algorithms work: I. Mutation and hill climbing, in: Proceedings of the Second Workshop on Parallel Problem Solving from Nature, Elsevier, Amsterdam, The Netherlands, 1992.
15. A. E. Nix and M. D. Vose, Modelling genetic algorithms with markov chains, Ann. Math. Artif. Intell. 5:79-88 (1992).
16. J. D. Schaffer et al., A study of control parameters affecting online performance of genetic algorithms for function optimization, in: Proceedings of the Third International Conference on Genetic Algorithms, 1989, pp. 51-60.
17. J. D. Schaffer, Some effects of selection procedures on hyperplane sampling by genetic algorithms, in: L. Davis (Ed.), Genetic Algorithms and Simulated Annealing, Morgan Kaufmann, Los Altos, CA, 1991.
18. J. D. Schaffer and L. J. Eshelman, On crossover as an evolutionary viable strategy, in: Proceeding of the 4th ICGA, 1991, pp. 61-68.
19. W. M. Spears and K. A. DeJong, An Analysis of multipoint crossover, in: Proceedings of the 1990 Workshop of the Foundations on Genetic Algorithms, 1991, pp. 301-315.
20. M. Srinivas and L. M. Patnaik, On modelling genetic algorithms for functions of unitation, IEEE Trans. Syst. Man Cybern. 26(6):809-822 (1996).
21. M. Srinivas and L. M. Patnaik, Analyzing genetic algorithms using fitness moments, IEEE Trans. Knowl. Data Engrg. 8(1):120-134 (1996).
22. M. Srinivas and L. M. Patnaik, Binomially distributed populations for modelling genetic algorithms, in: Proceedings of the Fifth International Conference on Genetic Algorithms, Morgan Kaufmann, Los Altos, CA, 1993, pp. 138-145.
23. M. Srinivas and L. M. Patnaik, Genetic Algorithms: A survey, IEEE Computer 17-26 (1994).
24. G. Syswerda, Uniform crossover in genetic algorithms, in: Proceeding of the Third International Conference on Genetic Algorithms, 1989, pp. 2-9.
25. T. E. Davis, A simulated annealing like convergence theory for the simple genetic algorithm, in: R. Belew (Ed.), Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kaufmann, Los Altos, CA, 1991, pp. 174-181.
26. M. D. Vose and G. Liepins, Punctuated equilibria in genetic search, Complex Syst. 5:31-44 (1991).
27. D. Whitley, R. Das, and C. Crabb, Tracking primary hyperplane competitors during genetic search, Technical Report CS92-121, Dept. Computer Science, Colorado State University, May 1992.
28. D. Whitley, An executable model of a simple genetic algorithm, presented at FOGA-92.