Abstract

With the development of various metaheuristic algorithms, research cases that perform weight optimization of truss structures are steadily progressing. In particular, due to the possibility of developing quantum computers, metaheuristic algorithms combined with quantum computation are being developed. In this paper, the QbHS (Quantum based Harmony Search) algorithm was proposed by combining quantum computation and the conventional HS (Harmony Search) algorithms, and the size and topology optimization of the truss structure was performed. The QbHS algorithm has the same repetitive computational structure as the conventional HS algorithm. However, the QbHS algorithm constructed QHM (Quantum Harmony Memory) using the probability of Q-bit and proposed to perform pitch adjusting using the basic state of Q-bit. To perform weight optimization of truss structures using the proposed QbHS algorithm, 20 bar, 24 bar, and 72-bar truss structures were adopted as examples and compared with the results of the QE (Quantum Evolutionary) algorithm. As a result, it was confirmed that the QbHS algorithm had excellent convergence performance by finding a lower weight than the QE algorithm. In addition, by expressing the weight optimization results of the truss structure with an image coordinate system, the topology of the truss structure could be confirmed only by the picture. The results of this study are expected to play an important role in future computer information systems by combining quantum computation and conventional HS algorithms.

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.