Weight Optimization of Discrete Truss Structures Using Quantum-Based HS Algorithm

Recently, a new field that combines metaheuristic algorithms and quantum computing has been created and is being applied to optimization problems in various fields. However, the application of quantum computing-based metaheuristic algorithms to the optimization of structural engineering is insuffici...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Buildings (Basel) 2023-09, Vol.13 (9), p.2132
Hauptverfasser: Lee, Seungjae, Ha, Junhong, Shon, Sudeok, Lee, Donwoo
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Recently, a new field that combines metaheuristic algorithms and quantum computing has been created and is being applied to optimization problems in various fields. However, the application of quantum computing-based metaheuristic algorithms to the optimization of structural engineering is insufficient. Therefore, in this paper, we tried to optimize the weight of the truss structure using the QbHS (quantum-based harmony search) algorithm, which combines quantum computing and conventional HS (harmony search) algorithms. First, the convergence performance according to the parameter change of the QbHS algorithm was compared. The parameters selected for the comparison of convergence performance are QHMS, QHMCR, QPAR, ϵ, and θr. The selected parameters were compared using six benchmark functions, and the range for deriving the optimal convergence performance was found. In addition, weight optimization was performed by applying it to a truss structure with a discrete cross-sectional area. The QbHS algorithm derived a lower weight than the QEA (quantum-inspired evolutionary algorithm) and confirmed that the convergence performance was better. A new algorithm that combines quantum computing and metaheuristic algorithms is required for application to various engineering problems, and this effort is essential for the expansion of future algorithm development.
ISSN:2075-5309
2075-5309
DOI:10.3390/buildings13092132