A Study of Scalarisation Techniques for Multi-Objective QUBO Solving

by   Mayowa Ayodele, et al.
The University of Manchester

In recent years, there has been significant research interest in solving Quadratic Unconstrained Binary Optimisation (QUBO) problems. Physics-inspired optimisation algorithms have been proposed for deriving optimal or sub-optimal solutions to QUBOs. These methods are particularly attractive within the context of using specialised hardware, such as quantum computers, application specific CMOS and other high performance computing resources for solving optimisation problems. These solvers are then applied to QUBO formulations of combinatorial optimisation problems. Quantum and quantum-inspired optimisation algorithms have shown promising performance when applied to academic benchmarks as well as real-world problems. However, QUBO solvers are single objective solvers. To make them more efficient at solving problems with multiple objectives, a decision on how to convert such multi-objective problems to single-objective problems need to be made. In this study, we compare methods of deriving scalarisation weights when combining two objectives of the cardinality constrained mean-variance portfolio optimisation problem into one. We show significant performance improvement (measured in terms of hypervolume) when using a method that iteratively fills the largest space in the Pareto front compared to a näive approach using uniformly generated weights.


Multi-objective QUBO Solver: Bi-objective Quadratic Assignment

Quantum and quantum-inspired optimisation algorithms are designed to sol...

Applying Ising Machines to Multi-objective QUBOs

Multi-objective optimisation problems involve finding solutions with var...

Penalty Weights in QUBO Formulations: Permutation Problems

Optimisation algorithms designed to work on quantum computers or other s...

Comparing the Digital Annealer with Classical Evolutionary Algorithm

In more recent years, there has been increasing research interest in exp...

QuAnt: Quantum Annealing with Learnt Couplings

Modern quantum annealers can find high-quality solutions to combinatoria...

QROSS: QUBO Relaxation Parameter Optimisation via Learning Solver Surrogates

An increasingly popular method for solving a constrained combinatorial o...

Dynamic Multi-objective Optimization of the Travelling Thief Problem

Investigation of detailed and complex optimisation problem formulations ...

Please sign up or login with your details

Forgot password? Click here to reset