Computational Technology Resources - CCC

M. Bruggi, B. Tóth, J. Lógó, "Optimal Design of Lattice Domes by Means of a Constrained Force Density Method", in P. Iványi, J. Kruis, B.H.V. Topping, (Editors), "Proceedings of the Fifteenth International Conference on Computational Structures Technology", Civil-Comp Press, Edinburgh, UK, Online volume: CCC 9, Paper 5.1, 2024, doi:10.4203/ccc.9.5.1

Keywords: form-finding, structural optimization, force density method, mathematical programming, lattice domes, lightweight structures.

Abstract

In this contribution the design of reticulated domes is dealt with, exploring the optimal solutions that can be retrieved by a form-finding approach. To this goal a numerical tool is implemented to address the design of reticulated shells through funicular analysis. The force density method is implemented to cope with the equilibrium of reticulated shells whose branches are required to behave as bars. Optimal networks are sought by coupling the force density method with techniques of sequential convex programming that were originally conceived to handle formulations of size optimization for elastic structures. The Maxwell number, which is the sum of the force-times-length products for all the branches in the spatial network, is used as objective function to be minimized, whereas constraints on the length of the branches are enforced. Funicular networks that are fully feasible with respect to the set of local enforcements are retrieved in a limited number of iterations, with no need to initialize the procedure with a feasible starting guess. Optimal solutions are explored, considering different types of grids, i.e. different types of lattices, while considering self-weight.

download the full-text of this paper (PDF, 8 pages, 718 Kb)

go to the previous paper
go to the next paper
return to the table of contents
return to the volume description

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCC CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Civil-Comp Conferences ISSN 2753-3239 CCC: 9 PROCEEDINGS OF THE FIFTEENTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL STRUCTURES TECHNOLOGY Edited by: P. Iványi, J. Kruis and B.H.V. Topping Paper 5.1 Optimal Design of Lattice Domes by Means of a Constrained Force Density Method M. Bruggi¹, B. Tóth^2,1 and J. Lógó² ¹Department of Civil and Environmental Engineering, Politecnico di Milano, Milano, Italy ²Department of Structural Mechanics, Budapest University of Technology and Economics, Hungary doi:10.4203/ccc.9.5.1 Full Bibliographic Reference for this paper M. Bruggi, B. Tóth, J. Lógó, "Optimal Design of Lattice Domes by Means of a Constrained Force Density Method", in P. Iványi, J. Kruis, B.H.V. Topping, (Editors), "Proceedings of the Fifteenth International Conference on Computational Structures Technology", Civil-Comp Press, Edinburgh, UK, Online volume: CCC 9, Paper 5.1, 2024, doi:10.4203/ccc.9.5.1 Keywords: form-finding, structural optimization, force density method, mathematical programming, lattice domes, lightweight structures. Abstract In this contribution the design of reticulated domes is dealt with, exploring the optimal solutions that can be retrieved by a form-finding approach. To this goal a numerical tool is implemented to address the design of reticulated shells through funicular analysis. The force density method is implemented to cope with the equilibrium of reticulated shells whose branches are required to behave as bars. Optimal networks are sought by coupling the force density method with techniques of sequential convex programming that were originally conceived to handle formulations of size optimization for elastic structures. The Maxwell number, which is the sum of the force-times-length products for all the branches in the spatial network, is used as objective function to be minimized, whereas constraints on the length of the branches are enforced. Funicular networks that are fully feasible with respect to the set of local enforcements are retrieved in a limited number of iterations, with no need to initialize the procedure with a feasible starting guess. Optimal solutions are explored, considering different types of grids, i.e. different types of lattices, while considering self-weight. download the full-text of this paper (PDF, 8 pages, 718 Kb) go to the previous paper go to the next paper return to the table of contents return to the volume description
Back to top	©Civil-Comp Limited 2023 - terms & conditions