Penalty Weights in QUBO Formulations: Permutation Problems

  title={Penalty Weights in QUBO Formulations: Permutation Problems},
  author={Mayowa Ayodele},
  • M. Ayodele
  • Published in EvoCOP 20 June 2022
  • Computer Science, Business
Optimisation algorithms designed to work on quantum computers or other specialised hardware have been of research interest in recent years. Commercial solvers that use quantum or quantum-inspired methods, such as Fujitsu’s Digital Annealer (DA) and D-wave’s Quantum Annealer, can solve optimisation problems faster than algorithms implemented on general purpose computers. However, they can only optimise problems that are in binary and quadratic form. Quadratic Unconstrained Binary Optimisation… 

Multi-objective QUBO solver: bi-objective quadratic assignment problem

The first attempt to extend the algorithm supporting a commercial QUBO solver as a multi-objective solver that is not based on scalarisation is presented, and it is observed that algorithm performance significantly depends on the archiving strategy adopted, and that combining DA with non-scalarisation methods to optimise multiple objectives outperforms the current scalarised version of the DA in terms of final solution quality.

Comparing the Digital Annealer with Classical Evolutionary Algorithm

The question addressed in this paper is whether quantum or quantum-inspired solvers can optimise QUBO transformations of combinatorial optimisation problems faster than classical evolutionary algorithms applied to the same problems in their natural representations.



A Hybrid Framework Using a QUBO Solver For Permutation-Based Combinatorial Optimization

A hybrid framework to solve large-scale permutation-based combinatorial problems effectively using a high-performance quadratic unconstrained binary optimization (QUBO) solver and a machine learning approach to tune the parameters for good performance effectively is proposed.

Penalty and partitioning techniques to improve performance of QUBO solvers

Quantum Permutation Synchronization

This work presents QuantumSync, the first quantum algorithm for solving a synchronization problem in the context of computer vision which involves solving a non-convex optimization problem in discrete variables and guarantees global optimality with high probability while sampling the energy landscape to yield confidence estimates.

Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer

The results show that the Digital Annealer currently exhibits a time-to-solution speedup of roughly two orders of magnitude for fully connected spin-glass problems with bimodal or Gaussian couplings, over the single-core implementations of simulated annealing and parallel tempering Monte Carlo used in this study.

PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form

We present PyQUBO, an open-source Python library for constructing quadratic unconstrained binary optimizations (QUBOs) from the objective functions and the constraints of optimization problems.

A Multiple Coefficients Trial Method to Solve Combinatorial Optimization Problems for Simulated-annealing-based Ising Machines

This paper investigates the relationship between the penalty coefficient and the accuracy of solutions in a TSP, and proposes a method to obtain a T SP quasi-optimum solution, called multiple coefficients trial method, which can reduce the total number of annealing iterations to 1/10 to1/1000.

RK-EDA: A Novel Random Key Based Estimation of Distribution Algorithm

This paper presents RK-EDA; a novel RK based EDA that uses a cooling scheme to balance the exploration and exploitation of a search space by controlling the variance in its probabilistic model.

Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer

A multi-period portfolio optimization problem using D-Wave Systems' quantum annealer is solved, and the formulation presented is specifically designed to be scalable, with the expectation that as quantumAnnealing technology improves, larger problems will be solvable using the same techniques.

Digital Annealer for High-Speed Solving of Combinatorial optimization Problems and Its Applications

A Digital Annealer (DA) is a dedicated architecture for high-speed solving of combinatorial optimization problems mapped to an Ising model. With fully coupled bit connectivity and high coupling