Skip to main content
Top

Hint

Swipe to navigate through the chapters of this book

2017 | OriginalPaper | Chapter

7. Single-Branch Truss-Z (STZ)

Author : Machi Zawidzki

Published in: Discrete Optimization in Architecture

Publisher: Springer Singapore

Abstract

This chapter describes various methods of creating single-branch Truss-Z (STZ) structures. First, the alignment to the given path is described, followed by backtracking-based method illustrated with the Case Study I. Next, various evolutionary algorithms are implemented for optimization of STZ illustrated with the Case Study II.

To get access to this content you need the following product:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt 90 Tage mit der neuen Mini-Lizenz testen!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe



 


Jetzt 90 Tage mit der neuen Mini-Lizenz testen!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt 90 Tage mit der neuen Mini-Lizenz testen!

Literature
1.
go back to reference Ahmed S, Weber M, Liwicki M, Langenhan C, Dengel A, Petzold F (2014) Automatic analysis and sketch-based retrieval of architectural floor plans. Pattern Recognit Lett 35:91–100 CrossRef Ahmed S, Weber M, Liwicki M, Langenhan C, Dengel A, Petzold F (2014) Automatic analysis and sketch-based retrieval of architectural floor plans. Pattern Recognit Lett 35:91–100 CrossRef
2.
go back to reference Albers S (1999) Online algorithms: a study of graph-theoretic concepts. In: Graph-theoretic concepts in computer science, pp 10–26 Albers S (1999) Online algorithms: a study of graph-theoretic concepts. In: Graph-theoretic concepts in computer science, pp 10–26
3.
go back to reference Albers S, Henzinger MR (1997) Exploring unknown environments. SIAM J Comput 416–425 Albers S, Henzinger MR (1997) Exploring unknown environments. SIAM J Comput 416–425
4.
go back to reference Albers S, Kursawe K, Schuierer S (1998) Exploring unknown environments with obstacles. In: Proceeding 10th ACM-SIAM symposium discrete algorithms, pp 842–843 Albers S, Kursawe K, Schuierer S (1998) Exploring unknown environments with obstacles. In: Proceeding 10th ACM-SIAM symposium discrete algorithms, pp 842–843
5.
go back to reference Ali MM, Golalikhani M, Zhuang J (2014) A computational study on different penalty approaches for solving constrained global optimization problems with the electromagnetism-like method. Optimization 63:403–419 MathSciNetCrossRefMATH Ali MM, Golalikhani M, Zhuang J (2014) A computational study on different penalty approaches for solving constrained global optimization problems with the electromagnetism-like method. Optimization 63:403–419 MathSciNetCrossRefMATH
7.
go back to reference Bar-Cohen Y (2005) Biomimetics: biologically inspired technologies. CRC Press Bar-Cohen Y (2005) Biomimetics: biologically inspired technologies. CRC Press
8.
go back to reference Barricelli NA (1957) Symbiogenetic evolution processes realized by artificial methods. Methodos 9(35–36):143–182 Barricelli NA (1957) Symbiogenetic evolution processes realized by artificial methods. Methodos 9(35–36):143–182
9.
go back to reference Barricelli NA et al (1954) Esempi numerici di processi di evoluzione. Methodos 6(21–22):45–68 MathSciNet Barricelli NA et al (1954) Esempi numerici di processi di evoluzione. Methodos 6(21–22):45–68 MathSciNet
10.
go back to reference Betke M, Rivest RL, Singh M (1995) Piecemeal learning of an unknown environment. Mach Learn 18(2–3):231–254 Betke M, Rivest RL, Singh M (1995) Piecemeal learning of an unknown environment. Mach Learn 18(2–3):231–254
11.
go back to reference Cook G et al (2009) Design of buildings and their approaches to meet the needs of disabled people Cook G et al (2009) Design of buildings and their approaches to meet the needs of disabled people
12.
go back to reference Crosby JL et al (1973) Computer simulation in genetics. Wiley, London MATH Crosby JL et al (1973) Computer simulation in genetics. Wiley, London MATH
13.
go back to reference De Floriani L (1988) A variable resolution graph based model of three dimensional objects. Adv Eng Softw 10(3):143–158 (1978) De Floriani L (1988) A variable resolution graph based model of three dimensional objects. Adv Eng Softw 10(3):143–158 (1978)
14.
go back to reference Deng X, Papadimitriou CH (1990) Exploring an unknown graph. In: 31st annual symposium on foundations of computer science, 1990. Proceedings. IEEE, pp 355–361 Deng X, Papadimitriou CH (1990) Exploring an unknown graph. In: 31st annual symposium on foundations of computer science, 1990. Proceedings. IEEE, pp 355–361
15.
go back to reference Deng X, Kameda T, Papadimitriou C (1998) How to learn an unknown environment. I: the rectilinear case. J ACM (JACM) 45(2):215–245 Deng X, Kameda T, Papadimitriou C (1998) How to learn an unknown environment. I: the rectilinear case. J ACM (JACM) 45(2):215–245
17.
go back to reference Fogel DB (1998) Evolutionary computation: the fossil record. Wiley-IEEE Press Fogel DB (1998) Evolutionary computation: the fossil record. Wiley-IEEE Press
18.
go back to reference Fomin FV, Kratsch D (2010) Exact exponential algorithms. Texts in theoretical computer science. An eatcs series Fomin FV, Kratsch D (2010) Exact exponential algorithms. Texts in theoretical computer science. An eatcs series
19.
go back to reference Fraser A (1957) Simulation of genetic systems by automatic digital computers. I. Introduction. Aust J Biol Sci 10:484–491 CrossRef Fraser A (1957) Simulation of genetic systems by automatic digital computers. I. Introduction. Aust J Biol Sci 10:484–491 CrossRef
20.
go back to reference Fraser A, Burnell D et al (1970) Computer models in genetics. Computer models in genetics Fraser A, Burnell D et al (1970) Computer models in genetics. Computer models in genetics
21.
go back to reference Graver JE, Servatius B, Servatius H (1993) Combinatorial rigidity. Am Math Soc 2 Graver JE, Servatius B, Servatius H (1993) Combinatorial rigidity. Am Math Soc 2
22.
go back to reference Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100–107 CrossRef Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100–107 CrossRef
23.
go back to reference Iványi P, Topping B (2002) A new graph representation for cable-membrane structures. Adv Eng Softw 33(5):273–279 CrossRefMATH Iványi P, Topping B (2002) A new graph representation for cable-membrane structures. Adv Eng Softw 33(5):273–279 CrossRefMATH
24.
go back to reference Jeronimidis G (2008) Bioinspiration for engineering and architecture materials–structures–function. In: Proceedings of the 28th annual conference of the ACADIA, Minneapolis Jeronimidis G (2008) Bioinspiration for engineering and architecture materials–structures–function. In: Proceedings of the 28th annual conference of the ACADIA, Minneapolis
26.
go back to reference Kaveh A (2014) Computational structural analysis and finite element methods. Springer Kaveh A (2014) Computational structural analysis and finite element methods. Springer
27.
go back to reference Kaveh A, Koohestani K (2008) An efficient graph-theoretical force method for three-dimensional finite element analysis. Commun Numer Methods Eng 24(11):1533–1551 MathSciNetCrossRefMATH Kaveh A, Koohestani K (2008) An efficient graph-theoretical force method for three-dimensional finite element analysis. Commun Numer Methods Eng 24(11):1533–1551 MathSciNetCrossRefMATH
28.
go back to reference Kaveh A, Ramachandran K (1984) Graph theoretical approach for bandwidth and frontwidth reductions. In: Proceedings 3rd international conference on space structures, pp 245–249 Kaveh A, Ramachandran K (1984) Graph theoretical approach for bandwidth and frontwidth reductions. In: Proceedings 3rd international conference on space structures, pp 245–249
29.
go back to reference Kaveh A, Roosta G (1999) A graph theoretical method for frontwidth reduction. Adv Eng Softw 30(9):789–797 CrossRef Kaveh A, Roosta G (1999) A graph theoretical method for frontwidth reduction. Adv Eng Softw 30(9):789–797 CrossRef
30.
go back to reference Langenhan C, Weber M, Liwicki M, Petzold F, Dengel A (2013) Graph-based retrieval of building information models for supporting the early design stages. Adv Eng Inf 27(4):413–426 CrossRef Langenhan C, Weber M, Liwicki M, Petzold F, Dengel A (2013) Graph-based retrieval of building information models for supporting the early design stages. Adv Eng Inf 27(4):413–426 CrossRef
31.
go back to reference Lee KY, Kwon OH, Lee JY, Kim TW (2003) A hybrid approach to geometric constraint solving with graph analysis and reduction. Adv Eng Softw 34(2):103–113 CrossRef Lee KY, Kwon OH, Lee JY, Kim TW (2003) A hybrid approach to geometric constraint solving with graph analysis and reduction. Adv Eng Softw 34(2):103–113 CrossRef
32.
go back to reference Liu R, Baba T, Masumoto D (2004) Attributed graph matching based engineering drawings retrieval. In: Document analysis systems, Springer, pp 378–388 Liu R, Baba T, Masumoto D (2004) Attributed graph matching based engineering drawings retrieval. In: Document analysis systems, Springer, pp 378–388
33.
go back to reference Michalewicz Z (2013) Genetic algorithms \(+\) data structures \(=\) evolution programs. Springer Science & Business Media Michalewicz Z (2013) Genetic algorithms \(+\) data structures \(=\) evolution programs. Springer Science & Business Media
34.
go back to reference Michalewicz Z, Fogel DB (2013) How to solve it: modern heuristics. Springer Science & Business Media Michalewicz Z, Fogel DB (2013) How to solve it: modern heuristics. Springer Science & Business Media
35.
go back to reference Rechenberg I (1973) Evolutionsstrategie: Optimierung Technischer Systeme Nach Prinzipien Der Biologischen Evolution. Ph.D. thesis, Stuttgart (in German) Rechenberg I (1973) Evolutionsstrategie: Optimierung Technischer Systeme Nach Prinzipien Der Biologischen Evolution. Ph.D. thesis, Stuttgart (in German)
36.
go back to reference Recuero A, Río O, Alvarez M (2000) Heuristic method to check the realisability of a graph into a rectangular plan. Adv Eng Softw 31(3):223–231 CrossRefMATH Recuero A, Río O, Alvarez M (2000) Heuristic method to check the realisability of a graph into a rectangular plan. Adv Eng Softw 31(3):223–231 CrossRefMATH
37.
go back to reference Shao W, Terzopoulos D (2007) Autonomous pedestrians. Graph Models 69(5):246–274 CrossRef Shao W, Terzopoulos D (2007) Autonomous pedestrians. Graph Models 69(5):246–274 CrossRef
38.
go back to reference Singh M, Khan I, Grover S (2011) Selection of manufacturing process using graph theoretic approach. Int J Syst Assur Eng Manag 2(4):301–311 CrossRef Singh M, Khan I, Grover S (2011) Selection of manufacturing process using graph theoretic approach. Int J Syst Assur Eng Manag 2(4):301–311 CrossRef
39.
40.
go back to reference Sloan S (1989) A fortran program for profile and wavefront reduction. Int J Numer Methods Eng 28(11):2651–2679 CrossRefMATH Sloan S (1989) A fortran program for profile and wavefront reduction. Int J Numer Methods Eng 28(11):2651–2679 CrossRefMATH
41.
go back to reference Tang J (2001) Mechanical system reliability analysis using a combination of graph theory and boolean function. Reliab Eng Syst Saf 72(1):21–30 CrossRef Tang J (2001) Mechanical system reliability analysis using a combination of graph theory and boolean function. Reliab Eng Syst Saf 72(1):21–30 CrossRef
42.
go back to reference Thimm G, Britton G, Fok S (2004) A graph theoretic approach linking design dimensioning and process planning. Int J Adv Manuf Technol 24(3–4):261–271 CrossRef Thimm G, Britton G, Fok S (2004) A graph theoretic approach linking design dimensioning and process planning. Int J Adv Manuf Technol 24(3–4):261–271 CrossRef
43.
go back to reference Vulpe A, Cărăusu A (1987) On some graph-theoretic concepts and techniques applicable in the reliability analysis of structural systems. In: Reliability and optimization of structural systems, Springer, pp 399–416 Vulpe A, Cărăusu A (1987) On some graph-theoretic concepts and techniques applicable in the reliability analysis of structural systems. In: Reliability and optimization of structural systems, Springer, pp 399–416
Metadata
Title
Single-Branch Truss-Z (STZ)
Author
Machi Zawidzki
Copyright Year
2017
Publisher
Springer Singapore
DOI
https://doi.org/10.1007/978-981-10-1109-2_7