Abstract

The weight and shape of the gable and multi-span frames (mono and two-span pitched roof) with tapered members, as a familiar group of the pitched roof frames, are highly dependent on the properties of the member cross-section. In this work a quantum inspired evolutionary algorithms, so-called Quantum evolutionary algorithm (QEA) [1], are utilized for optimal design of one gable frame and a multi-span frame in five alternatives with tapered members. In order to optimize the frames, the design is performed using the AISC specifications for stress, displacement and stability constraints. The design constraints and weight of the gable and multi-span frames are computed from the cross-section of members. These optimum weights are obtained using aforementioned optimization algorithm considering the cross-section of members and design constraints as optimization variables and constraints, respectively. A comparative study of the QEA and some recently developed methods from literature is also performed to illustrate the performance of the utilized optimization algorithm and its featuring. Furthermore, optimal design of a multi-span frame is compared with the solution of other methods including the same conditions and constraints. This study indicates the power of QEA in exploring and exploitation due the search space with using Q-gate and binary code for individual representation and updating. Binary code helps the QEA to find optimal solution even with minimum number of Q-bit individuals. High speed of this method is because of such a feature.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.