Skip to main content

Part of the book series: NATO ASI Series ((NSSE,volume 221))

  • 268 Accesses

Abstract

For some projects an appropriate optimal design strategy is to minimise functional clashes by dealing first with the most highly interacting design requirements. A graph is formed from a list of requirements and the links between them. Graph theory algorithms are given for reducing the graph to a set of clusters, then reassembling them in hierarchical order as a guide for design. Examples are given for layout generation, and an extension is proposed for general systems.

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 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.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

  • Alexander, C. J., (1964), Notes on the Synthesis of Form, Harvard University Press, Cambridge, Mass., USA.

    Google Scholar 

  • Alexander, C. J., (1977), A Pattern Language: Towns, Buildings, Construction,Oxford University Press.

    Google Scholar 

  • Berge, C., (1962), The Theory of Graphs and its Application, Methven, London.

    Google Scholar 

  • Clark, S. J. and Elms, D. G., (1976), The HIDECS Process, Ministry of Works and Development, Wellington, New Zealand.

    Google Scholar 

  • Daish, J. and Kleem, J., (1969), HOPAD—House Parts for Designers, Ministry of Works, Wellington, New Zealand.

    Google Scholar 

  • Elms, D. G. and Clark, S. J., (1976), Briefing with Graphics, Ministry of Works and Development, Wellington, New Zealand.

    Google Scholar 

  • Elms, D. G., (1983), `From a structure to a tree,’ Civil Engineering Systems 1, 95–106.

    Article  Google Scholar 

  • Elms, D. G., (1985), `Steps beyond technique—education for professional attitude,’ Civil Engineering Systems 2, 55–59.

    Article  Google Scholar 

  • Elms, D. G., (1989), `Wisdom engineering,’ Proc. World Conf. on Engineering Education for Advancing Technology, Sydney, Australia, 574–578.

    Google Scholar 

  • Pirsig, R. M., (1974), Zen and the Art of Motorcycle Maintenance, Bantam Books, New York, USA.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Elms, D.G. (1992). Network Structuring Algorithms. In: Topping, B.H.V. (eds) Optimization and Artificial Intelligence in Civil and Structural Engineering. NATO ASI Series, vol 221. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-2490-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-2490-6_4

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4201-9

  • Online ISBN: 978-94-017-2490-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics