Solving Combinatorial Optimization Problems Based on QUBO Models
Authors:
- 12 July 2024
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 888-893
Abstract
Combinatorial optimization problems are of great significance in many fields, and this paper explores the application of quantum annealing-based QUBO (Quadratic Unconstrained Binary Optimization) model to combinatorial optimization problems, including the 0/1 knapsack problem, the traveler's problem, the maximum cut problem, and the graph coloring problem. The quantum annealing algorithm can effectively avoid falling into local optimal solutions by virtue of its unique quantum tunneling advantage, and shows significant advantages in solving complex combinatorial optimization problems, especially in dealing with large-scale data and multiple constraints, quantum annealing provides an efficient solution.Keywords
Funding Information
- Science and Technology Commission of Shanghai Municipality
- China Electronics Technology Group Corporation
This publication has 10 references indexed in Scilit:
- Quantum annealing: an overviewPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2022
- OPTIMALISASI RUTE WISATA DI YOGYAKARTA MENGGUNAKAN METODE TRAVELLING SALESMAN PERSON DAN ALGORITMA BRUTE FORCEJurnal Teknik dan Science, 2022
- Simulated annealing-based dynamic step shuffled frog leaping algorithm: Optimal performance design and feature selectionNeurocomputing, 2022
- Quantum and classical annealing in a continuous space with multiple local minimaPhysical Review A, 2022
- Quantum bridge analytics I: a tutorial on formulating and using QUBO modelsAnnals of Operations Research, 2022
- Dynamic Programming algorithms and their applications in machine scheduling: A reviewExpert Systems with Applications, 2022
- Parameterizing Branch-and-Bound Search Trees to Learn Branching PoliciesProceedings of the AAAI Conference on Artificial Intelligence, 2021
- A review on genetic algorithm: past, present, and futureMultimedia Tools and Applications, 2020
- Simulated Quantum Annealing Can Be Exponentially Faster Than Classical Simulated Annealing2016
- Routing Optimization Based on Taboo Search Algorithm for Logistic DistributionJournal of Networks, 2014