Skip to main content
SpringerLink
Log in

Genetic production systems for intelligent problem solving

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

The paper discusses an evolutionary knowledge approach to intelligent problem solving. A rule-based production system is used to model the problem and the means by which the problem space should be searched. Search heuristics are modelled as production rules. These rules are redundant as there may be more than one view on the best method for building solutions. Some rules may have complex reasoning for their actions, others have none. Deciding which rule is most appropriate is solved by a genetic algorithm and ultimately only the ‘fitter’ rules will survive. The approach eliminates the necessity of designing problem specific search or variation operators, leaving the genetic algorithm to process patterns independent of the problem at hand. Learning methods and how they aid evolution is also discussed: they are Lamarckian learning and the Baldwin effect. The approach is tested on a scheduling problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Baldwin, J. M. (1896) A new factor in evolution. American Naturalist, 30, 441–451.

    Google Scholar 

  • Booker, L., Goldberg, D. E. and Holland, J. H. (1989) Classifier systems and genetic algorithms. Artificial Intelligence, 40(1–3), 235–282.

    Google Scholar 

  • Campbell, D. T (1974) Evolutionary epistemology, in The Philosophy of Karl Popper. Schilpp P. A. (ed), Open Court, La Salle, IL, pp. 413–463.

    Google Scholar 

  • Dawkins, R. (1976) The Selfish Gene, Oxford University Press, Oxford.

    Google Scholar 

  • 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.

    Google Scholar 

  • Fogel, L. J., Owens, A. J. and Walsh, M. J. (1996) Artificial Intelligence Through Simulated Evolution, Wiley, New York.

    Google Scholar 

  • Hinton, G. and Nowlan, S. (1987) How learning can guide evolution. Complex Systems, 1, 495–502.

    Google Scholar 

  • Holland, J. H. (1975) Adaptation in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor, MI.

    Google Scholar 

  • Mayley, G. (1996) Landscapes, learning costs and genetic assimilation. Evolutionary Computation, 4(3), 213–234.

    Google Scholar 

  • 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.

    Google Scholar 

  • Panwalkar, S. S. and Iskander, W. (1977) A survey of scheduling rules. Operations Research, 25(1), 45–61.

    Google Scholar 

  • Polya, G. (1954) Mathematics and Plausible Reasoning, Oxford University Press, Lond.

    Google Scholar 

  • Post, E. L. (1943) Formal reductions of the general combinatorial decision problem. American Journal of Mathematics, 65, 197–215.

    Google Scholar 

  • Radcliffle, N. J. (1991) Equivalence class analysis of genetic algorithms. Complex Systems, 5, 183–205.

    Google Scholar 

  • Rechenberg, I. (1973) Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution, Frommann-Holzboog, Stuttgart.

    Google Scholar 

  • Schwefel, H. P. (1965) Kybernetische evolution als strategie der experimentellen forschung in der strömungstcehnik, Diploma thesis, Technical University of Berlin.

  • 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.

    Google Scholar 

  • 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.

  • Schaffer, J. D. In Proceedings of the 3rd International Conference on Genetic Algorithms. George Mason University, June 1989. Morgan Kaufmann, 1989.

  • 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.

  • 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical and Industrial Engineering, University of Iceland, Hjardarhagi 2-6, 107, Reykjavik, Iceland

    THOMAS P. RUNARSSON & MAGNUS T. JONSSON

Authors
  1. THOMAS P. RUNARSSON
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. MAGNUS T. JONSSON
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

RUNARSSON, T.P., JONSSON, M.T. Genetic production systems for intelligent problem solving. Journal of Intelligent Manufacturing 10, 181–186 (1999). https://doi.org/10.1023/A:1008928804949

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008928804949

Search

Navigation