Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Joint Conference on Computational Intelligence

Strategic Solution Combination in Scatter Search for Quadratic Unconstrained Binary Optimization

Justin Pauckert, Matthieu Parizy, Mayowa Ayodele

Published Jan 1, 2022• 1 citation
Publisher
DOI
10.5220/0011547600003332

Related papers

Enhanced open-source scatter search algorithm for solving quadratic unconstrained binary optimization problems

Donghao Liu, Wei Yang, H Wang +4 more

Computers & Operations Research•May 23, 2025•4 citations

A scatter search approach to unconstrained quadratic binary programs

Mohammad M. Amini, Bahram Alidaee, Gary A. Kochenberger

McGraw-Hill Ltd., UK eBooks•Jan 1, 1999•46 citations

Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)

Endre Boros, Peter L. Hammer, Gabriel Tavares

Journal of Heuristics•Feb 20, 2007•142 citations

Application study of simulated annealing solver and CIM simulator based on QUBO model using kaiwu SDK

Ming Chi

In this paper, a methodology for finding the optimal solution by building a QUBO (Quadratic Unconstrained Binary Optimisation) model and using a combination of the Simulated Annealing algorithm and the CIM (Coherent Equivalent Machine) simulator in the Open Matter SDK will be presented. Firstly, the QUBO model was chosen because of its significant advantages in dealing with logical inference and combinatorial optimisation problems. The QUBO model provides an efficient solution method by transforming the problem into a quadratic unconstrained binary optimisation problem. In solving this problem, the first step is to define the objective and constraints of the problem, where the objective is to satisfy the relevant requirements and make the best of them, and the constraints are the relevant parameters provided by the data, and to build a mathematical model that matches the QUBO model. Next, a simulated annealing algorithm and a CIM simulator were used to solve this QUBO problem. By combining the QUBO model with these two algorithms, the optimal solution can be searched efficiently. Finally, the optimal solution is derived from the solution results. These scenarios not only satisfy the constraints but also achieve the given objective by optimising the combination of decision variables.

International Conference on Electronics and Devices, Computational Science (ICEDCS)•Sep 23, 2024•1 citation

An Efficient Closed-Form Formula for Evaluating r-Flip Moves in Quadratic Unconstrained Binary Optimization

Bahram Alidaee, Haibo Wang, Lutfu Sagbansua

Quadratic unconstrained binary optimization (QUBO) is a classic NP-hard problem with an enormous number of applications. Local search strategy (LSS) is one of the most fundamental algorithmic concepts and has been successfully applied to a wide range of hard combinatorial optimization problems. One LSS that has gained the attention of researchers is the r-flip (also known as r-Opt) strategy. Given a binary solution with n variables, the r-flip strategy “flips” r binary variables to obtain a new solution if the changes improve the objective function. The main purpose of this paper is to develop several results for the implementation of r-flip moves in QUBO, including a necessary and sufficient condition that when a 1-flip search reaches local optimality, the number of candidates for implementation of the r-flip moves can be reduced significantly. The results of the substantial computational experiments are reported to compare an r-flip strategy-embedded algorithm and a multiple start tabu search algorithm on a set of benchmark instances and three very-large-scale QUBO instances. The r-flip strategy implemented within the algorithm makes the algorithm very efficient, leading to very high-quality solutions within a short CPU time.

Algorithms•Dec 5, 2023•4 citations

Binary Unconstrained Quadratic Optimization Problem

Gary A. Kochenberger, Fred Glover, Haibo Wang

Springer eBooks•Jan 1, 2013•7 citations
In this paper, a methodology for finding the optimal solution by building a QUBO (Quadratic Unconstrained Binary Optimisation) model and using a combination of the Simulated Annealing algorithm and the CIM (Coherent Equivalent Machine) simulator in the Open Matter SDK will be presented. Firstly, the QUBO model was chosen because of its significant advantages in dealing with logical inference and combinatorial optimisation problems. The QUBO model provides an efficient solution method by transforming the problem into a quadratic unconstrained binary optimisation problem. In solving this problem, the first step is to define the objective and constraints of the problem, where the objective is to satisfy the relevant requirements and make the best of them, and the constraints are the relevant parameters provided by the data, and to build a mathematical model that matches the QUBO model. Next, a simulated annealing algorithm and a CIM simulator were used to solve this QUBO problem. By combining the QUBO model with these two algorithms, the optimal solution can be searched efficiently. Finally, the optimal solution is derived from the solution results. These scenarios not only satisfy the constraints but also achieve the given objective by optimising the combination of decision variables.
Quadratic unconstrained binary optimization (QUBO) is a classic NP-hard problem with an enormous number of applications. Local search strategy (LSS) is one of the most fundamental algorithmic concepts and has been successfully applied to a wide range of hard combinatorial optimization problems. One LSS that has gained the attention of researchers is the r-flip (also known as r-Opt) strategy. Given a binary solution with n variables, the r-flip strategy “flips” r binary variables to obtain a new solution if the changes improve the objective function. The main purpose of this paper is to develop several results for the implementation of r-flip moves in QUBO, including a necessary and sufficient condition that when a 1-flip search reaches local optimality, the number of candidates for implementation of the r-flip moves can be reduced significantly. The results of the substantial computational experiments are reported to compare an r-flip strategy-embedded algorithm and a multiple start tabu search algorithm on a set of benchmark instances and three very-large-scale QUBO instances. The r-flip strategy implemented within the algorithm makes the algorithm very efficient, leading to very high-quality solutions within a short CPU time.