Please use this identifier to cite or link to this item:
http://idr.nitk.ac.in/jspui/handle/123456789/15097
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Resmy V.R. | |
dc.contributor.author | Rajasekaran C. | |
dc.date.accessioned | 2021-05-05T10:16:25Z | - |
dc.date.available | 2021-05-05T10:16:25Z | - |
dc.date.issued | 2020 | |
dc.identifier.citation | Advances in Intelligent Systems and Computing , Vol. 979 , , p. 43 - 51 | en_US |
dc.identifier.uri | https://doi.org/10.1007/978-981-15-3215-3_5 | |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/15097 | - |
dc.description.abstract | Topology optimization is now becoming the effective method for solving various problems related to engineering. Optimization is a mathematical method to find the optimum solution by satisfying all the constraints associated with that problem, while topology optimization is a branch of structural optimization as it finds optimum material layout within the given boundary. This study focuses on the topology optimization of concrete dapped beams with various constraints to ensure the applicability of topology optimization during the design phase of structures. Compliance minimization with three different constraints along with volume constraint has been selected to derive the truss-like pattern for beams. To derive a lightweight structure with stress constraint, volume-based topology optimization has adopted. Strut-and-tie modeling (STM) of concrete members has been identified as a powerful method for modeling discontinuity regions within the structural member. Topology optimization can be used as a supporting method for developing more reliable strut-and-tie models. © Springer Nature Singapore Pte Ltd. 2020. | en_US |
dc.title | Topology Optimization of Concrete Dapped Beams Under Multiple Constraints | en_US |
dc.type | Conference Paper | en_US |
Appears in Collections: | 2. Conference Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.