Skip to main content

Genetic Algorithms Versus Simulated Annealing: Satisfaction of Large Sets of Algebraic Mechanical Design Constraints

  • Chapter
Artificial Intelligence in Design ’94

Abstract

The embodiment phase of mechanical design is, in part, a constraint specification and satisfaction problem. A set of tools to specify and satisfy sets of inequality and equality non-linear constraints has been developed and is presented in this paper. A combination of constraint-based methods and optimization techniques—a direct search method and two adaptive search methods—was applied to the problem of constraint satisfaction of large sets of highly coupled, non-linear, equality and inequality constraints. The constraint-based methods were used to reduce the constraint space size through algebraic manipulation of the constraints. Adaptive search techniques, genetic algorithms and simulated annealing, were used to find designs that satisfy all the imposed constraints.

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
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

  • Ackley, D.H., Hinton, G.E. and Sejnowski, T.J.: 1985, A learning algorithm for Boltzmann machines, Cognitive Science, 9, 147–169.

    Article  Google Scholar 

  • Aleksander, I. and Morton, H.: 1990, An Introduction to Neural Computing, Chapman and Hall, London.

    Google Scholar 

  • Cartwright, H. M. and Mott, G. F.: 1991, Looking around: Using clues from the data space to guide genetic algorithm searches, in Belew, R. K. and Booker, L. B. (eds), Proceedings Fourth International Conference on Genetic Algorithms, Morgan Kaufmann, pp. 108-114.

    Google Scholar 

  • Cerny, V.: 1985, Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm, Journal of Optimization Theory and Applications, 45, 41–51.

    Article  MathSciNet  MATH  Google Scholar 

  • David, B. T.: 1987, Multi-expert systems for CAD, Intelligent CAD Systems I: Theoretical and Methodological Aspects, Springer-Verlag, Noordwijkerhout, The Netherlands, pp. 57–67.

    Chapter  Google Scholar 

  • Davis L.: 1991, Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York.

    Google Scholar 

  • Eshelman, L. J., Caruana, R. A. and Schaffer, J. D.: 1989, Biases in the crossover landscape, in Schaffer, J. D.(ed.), Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann, pp. 10-119.

    Google Scholar 

  • Fogel, D. B. and Atmar, J. W.: 1990, Comparing genetic operators with Gaussian mutations in simulated evolutionary processes using linear systems, Biological Cybernetics, 63, 111–114.

    Article  Google Scholar 

  • Freeman-Benson, B. N.: 1989, A module mechanism for constraints in Smalltalk, 24(10) SIGPLAN Notices OOPSLA ’89: Conference on Object Oriented Programming, Systems, Languages and Applications, pp. 389–396.

    Google Scholar 

  • Goldberg, D. E.: 1989, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, Massachusetts.

    MATH  Google Scholar 

  • Grefestette, J. J.: 1986, Optimization of control parameters for genetic algorithms, IEEE Transactions on Systems, Man and Cybernetics, SMC-16, 1.

    Google Scholar 

  • Grefestette, J. J.: 1990, A User’s Guide to GENESIS 1.2ucsd, Naval Research Laboratory, Washington, DC (available via anonymous ftp from the Artificial Life archive server, iuvax.cs.indiana.edu (129.79.254.192) in the pub/alife/software/unix/GAucsd directory)

    Google Scholar 

  • James, M.: 1991a, Prototyping CAD, CAD-CAM.

    Google Scholar 

  • James, M.: 1991b, PC Parametrics, CAD-CAM.

    Google Scholar 

  • Johnson, A. L. and Thornton, A. C.: 1991, Towards real CAD, Design Studies, 12(4), 232–236.

    Article  Google Scholar 

  • Kirkpatrick, S., Gellat Jr., C. D. and Vecchi, M. P.: 1983, Optimization by simulated annealing, Science, 220, 671–680.

    Article  MathSciNet  MATH  Google Scholar 

  • Konopasek, M. and Jayaraman, S.: 1985, Constraint and declarative languages for engineering applications: the TK!Solver contribution, Proceedings of the IEEE, 73(12), 1791–1806.

    Article  Google Scholar 

  • Louis, S. J.: 1992, Genetic algorithms as a computational model of creative design, in Gero, J. S. and Sudweeks, F. (eds), Preprints Computational Models of Creative Design, University of Sydney, Sydney.

    Google Scholar 

  • Luenberger, D. G.: 1984, Linear and Non-linear Programming, 2nd edn, Addison-Wesley, Reading, Massachusetts.

    Google Scholar 

  • Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A. and Teller, E.: 1953, Equation of state calculations by fast computing machines, Journal of Chem. Physics, 21, 1087–1092.

    Article  Google Scholar 

  • Schaffer, J. D., Caruana, R. A., Eshelman, L. J. and Das, R.: 1989, A study of control parameters affecting online performance of genetic algorithms for function optimization, Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann, pp. 51-60.

    Google Scholar 

  • Sriram, D., Stephanopoulos, G., Logcher, R., Gossard, D., Groleau, N., Serrano, D. and Navinchandra, D.: 1989, Knowledge-based system applications in engineering design: Research at MIT, AI Magazine, 10(3), 79–96.

    Google Scholar 

  • Syswerda, G.: 1989, Uniform crossover in genetic algorithms, Proceedings of the Third International Conference on Genetic Algorithms, Schaffer, J. D.(ed.), Morgan Kaufmann.

    Google Scholar 

  • The Concept Modeller, Release 1.2, Reference Manual: 1990, Wisdom Systems ©, Pepper Pike, OH.

    Google Scholar 

  • Thornton, A. C.: 1993, Constraint Specification and Satisfaction in Embodiment Design, PhD Thesis, University of Cambridge

    Google Scholar 

  • van Laarhoven, P. J. M. and Aarts, E. L. H.: 1987, Simulated Annealing: Theory and Applications, D. Reidel, Dordrecht.

    Book  MATH  Google Scholar 

  • Wagner, M. R.: 1990, Understanding the ICAD System.

    Google Scholar 

  • Watton, J. D.: 1989, Automatic Reformulation of Mechanical Design Constraints to Enhance Qualitative and Quantitative Design Decisions, PhD Thesis, Carnegie Mellon University.

    Google Scholar 

  • Young, R. E., Greef, A., and O’Grady, P.: 1991, SPARK: An artificial intelligence constraint network system for concurrent engineering, in Gero, J. S. (ed), Artificial Intelligence in Design ’91, Butterworth Heinemann, Oxford, pp. 79–94.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Thornton, A.C. (1994). Genetic Algorithms Versus Simulated Annealing: Satisfaction of Large Sets of Algebraic Mechanical Design Constraints. In: Gero, J.S., Sudweeks, F. (eds) Artificial Intelligence in Design ’94. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-0928-4_22

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-0928-4_22

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-4400-4

  • Online ISBN: 978-94-011-0928-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics