Skip to main content

Genetic Algorithms as a Computational Theory of Conceptual Design

  • Chapter
Applications of Artificial Intelligence in Engineering VI

Abstract

The essentially inductive processes of conceptual design have received scant attention in those portions of the design literature concerned with effective computation or mathematical rigor. This paper draws a connection between the discriminative and recombinative processes of conceptual design and genetic algorithms (GAs)—search procedures based on the mechanics of natural genetics and natural selection. Recent empirical and theoretical results with a type of GA called a messy genetic algorithm support the conjecture that GAs can solve all problems no harder than the functions of bounded deception in time that grows no more quickly than a polynomial function of the number of decision variables. These results suggest that inductive designers—far from wasting their efforts when they bet on some combination of past designs—are engaging in a computationally effective means of solving very difficult, even misleading, design problems. Although more theoretical and computational work is needed, the paper shows one path to a more rigorous theory of conceptual design, a path that should help put design on the same mathematical foundations as analysis without detracting from the joy, or the necessity, of human invention.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Goldberg, D. E., Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA, 1989.

    MATH  Google Scholar 

  2. Holland, J. H., Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, 1975.

    Google Scholar 

  3. Davis, L. (Ed.), The Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991.

    Google Scholar 

  4. Holland, J. H., Holyoak, K. J., Nisbett, R. E. and Thagard, P. R., Induction: Processes of Inference, Learning, and Discovery, The MIT Press, Cambridge, MA, 1986.

    Google Scholar 

  5. Goldberg, D. E., Computer-aided Gas Pipeline Operations Using Genetic Algorithms and Rule Learning (Ph.D. dissertation, Civil Engineering), University of Michigan, Ann Arbor, 1983.

    Google Scholar 

  6. French, M. J., Invention and Evolution: Design in Nature and Engineering, Cambridge University Press, Cambridge, 1988.

    Google Scholar 

  7. Thompson, D., On Growth and Form, Abridged Edition (J. T. Bonner, Ed.), Cambridge University Press, 1961.

    Google Scholar 

  8. Tributsch, H., How Life Learned to Live (translated by M. Varon), The MIT Press, Cambridge, MA, 1982.

    Google Scholar 

  9. Pahl, G. and Beitz, W., Engineering Design (translated by A. Pomerans and K. Wallace), Springer-Verlag, Berlin, 1988.

    Google Scholar 

  10. Suh, N. P., The Principles of Design, Oxford University Press, New York, 1990.

    Google Scholar 

  11. Finger, S. and Dixon, J. R., A Review of Research in Mechanical Engineering Design. Part I: Descriptive, Prescriptive and Computer-based Models of Design Processes, Research in Engineering Design, Vol. 1, pp. 51–67, 1989.

    Article  Google Scholar 

  12. Hadamard, J., The Psychology of Invention in the Mathematical Field, Princeton University Press, Princeton, 1945.

    MATH  Google Scholar 

  13. Goldberg, D. E., Simple Genetic Algorithms and the Minimal Deceptive Problem. Chapter 6. Genetic Algorithms and Simulated Annealing (L. Davis, Ed.), Pitman, London, pp. 74–88, 1987.

    Google Scholar 

  14. Goldberg, D. E., Genetic Algorithms and Walsh Functions: Part I, a Gentle Introduction, Complex Systems, Vol. 3, pp. 129–152, 1989.

    MathSciNet  MATH  Google Scholar 

  15. Goldberg, D. E., Genetic Algorithms and Walsh Functions: Part II, Deception and Its Analysis, Complex Systems, Vol. 3, pp. 153–171, 1989.

    MathSciNet  MATH  Google Scholar 

  16. Goldberg, D.E. and Bridges, C. L., An Analysis of a Reordering Operator on a GA-hard Problem, Biological Cybernetics, Vol. 62, 397–405, 1990.

    Article  MATH  Google Scholar 

  17. Goldberg, D. E., Korb, B. and Deb, K., Messy Genetic Algorithms: Motivation, Analysis, and First Results, Complex Systems, Vol. 3, pp. 493–530, 1989.

    MathSciNet  MATH  Google Scholar 

  18. Goldberg, D. E., Deb, K. and Korb, B., Messy Genetic Algorithms Revisited: Studies in Mixed Size and Scale, Complex Systems, Vol. 4, pp. 415–444, 1990.

    MATH  Google Scholar 

  19. Goldberg, D. E. and Rudnick, M., Genetic Algorithms and the Variance of Fitness (IlliGAL Report No. 91001). The Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Computational Mechanics Publications

About this chapter

Cite this chapter

Goldberg, D.E. (1991). Genetic Algorithms as a Computational Theory of Conceptual Design. In: Rzevski, G., Adey, R.A. (eds) Applications of Artificial Intelligence in Engineering VI. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-3648-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-3648-8_1

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-1-85166-678-2

  • Online ISBN: 978-94-011-3648-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics