Genetic production systems for intelligent problem solving

Journal of Intelligent Manufacturing

Volumn 10, Issue 2, 1999, Pages 181-186

  Runarsson, Thomas P ^a   Jonsson, Magnus T ^a  

^a UNIVERSITY OF ICELAND   (Iceland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; GENETIC ALGORITHMS; JOB ANALYSIS; PROBLEM SOLVING; SCHEDULING;

GENETIC PRODUCTION SYSTEMS;

PRODUCTION CONTROL;

EID: 0032645067     PISSN: 09565515     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008928804949     Document Type: Article

References (21)

1. Baldwin, J. M. (1896) A new factor in evolution. American Naturalist, 30, 441-451.
2. Booker, L., Goldberg, D. E. and Holland, J. H. (1989) Classifier systems and genetic algorithms. Artificial Intelligence, 40(1-3), 235-282.
3. Campbell, D. T (1974) Evolutionary epistemology, in The Philosophy of Karl Popper. Schilpp P. A. (ed), Open Court, La Salle, IL pp. 413-463.
4. Dawkins, R. (1976) The Selfish Gene, Oxford University Press, Oxford.
5. Fisher, H. and Thompson, G. L. (1963) Probabilistic learning combinations of local job-shop scheduling rules, in Industrial Scheduling, Prentice Hall, Englewood Clifs, New Jersey, 225-251.
6. Fogel, L. J., Owens, A. J. and Walsh, M. J. (1996) Artificial Intelligence Through Simulated Evolution, Wiley, New York.
7. Hinton, G. and Nowlan, S. (1987) How learning can guide evolution. Complex Systems, 1, 495-502.
8. Holland, J. H. (1975) Adaptation in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor, MI.
9. Mayley, G. (1996) Landscapes, learning costs and genetic assimilation. Evolutionary Computation, 4(3), 213-234.
10. Michalewicz, M. (1996) Evolutionary computation: practical issues, in Proceedings of the IEEE International Conference of Evolutionary Computation, Nagoya University, Japan, May 20-22, 1996, IEEE Service Center, Piscataway, NJ, USA. ISBN: 0-7803-2902-3.
11. Panwalkar, S. S. and Iskander, W. (1977) A survey of scheduling rules. Operations Research, 25(1), 45-61.
12. Polya, G. (1954) Mathematics and Plausible Reasoning, Oxford University Press, Lond.
13. Post, E. L. (1943) Formal reductions of the general combinatorial decision problem. American Journal of Mathematics, 65, 197-215.
14. Radcliffe, N. J. (1991) Equivalence class analysis of genetic algorithms. Complex Systems, 5, 183-205.
15. Rechenberg, I. (1973) Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution, Frommann-Holzboog, Stuttgart.
16. Schwefel, H. P. (1965) Kybernetische evolution als strategie der experimentellen forschung in der strömungstcehnik, Diploma thesis, Technical University of Berlin.
17. Simon, H. A. (1983) Why should machines learn? in Machine Learning - An Artificial Intelligence Approach, Michalski, R. S., Carbonell, J. G., and Mitchell, T. M. (eds), Morgan Kaufmann Publsishers, Inc. 95 First Street, Los Altos, California 94022, USA. ISBN 0-934613-09-5.
18. Syswerda, G. (1989) Uniform crossover in genetic algorithms, in Proceedings of the 3rd International Conference on Genetic Algorithms, ICGA89, George Mason University, Morgan Kaufmann, 1989. pp. 2-9.
19. Schaffer, J. D. In Proceedings of the 3rd International Conference on Genetic Algorithms. George Mason University, June 1989. Morgan Kaufmann, 1989.
20. Turney, P. (1996) Myths and legends of the Baldwin effect, in Proceedings of the Workshop on Evolutionary Computing and Machine Learning at the 13th International Conference on Machine Learning, Bari, Italy, pp. 135-142.
21. Wolpert, D. H. and Macready, W. G. (1995) No free lunch theorems for search. Technical Report SFI-TR-95-02-010, Santa Fe Institute, NM.