Szczegóły publikacji
Opis bibliograficzny
Software aided approach for constrained optimization based on QAOA modifications / Tomasz LAMŻA, Justyna ZAWALSKA, Mariusz STERZEL, Katarzyna RYCERZ // W: Computational Science – ICCS 2023 : 23rd International Conference : Prague, Czech Republic, July 3–5, 2023 : proceedings, Pt. 5 / eds. Jiří Mikyška [et al.]. — Cham : Springer Nature, cop. 2023. — (Lecture Notes in Computer Science ; ISSN 0302-9743 ; LNCS 14077). — ISBN: 978-3-031-36029-9; e-ISBN: 978-3-031-36030-5. — S. 124–137. — Bibliogr., Abstr. — Publikacja dostępna online od: 2023-06-26. — T. Lamża - dod. afiliacja: Institute of Computer Science, AGH; J. Zawalska, K. Rycerz - dod. afiliacja: Academic Computer Center Cyfronet AGH
Autorzy (4)
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 147643 |
|---|---|
| Data dodania do BaDAP | 2023-07-21 |
| DOI | 10.1007/978-3-031-36030-5_10 |
| Rok publikacji | 2023 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Wydawca | Springer |
| Konferencja | 23rd International Conference on Computational Science |
| Czasopismo/seria | Lecture Notes in Computer Science |
Abstract
We present two variants of the QAOA modification for solving constrained combinatorial problems. The results presented in this paper were obtained using the QHyper framework, which we developed specifically for this purpose. More specifically, we use the created framework to compare the QAOA results with its two modifications, namely: Weight-Free QAOA (WF-QAOA) and Hyper QAOA (H-QAOA). Additionally, we compare the Basin-hopping global optimization method for subsequent sampling of the initial points for the proposed QAOA modifications with a simple Random Search. The results obtained for the Knapsack Problem indicate that the proposed solution outperforms the original QAOA algorithm and can be promising for QUBO, where adjusting the relative importance of the cost function and the constraints is a significant challenge.