Goal Seeking Quadratic Unconstrained Binary Optimization

The Quadratic Unconstrained Binary Optimization (QUBO) modeling and solution framework is required for quantum and digital annealers whose goal is the optimization of a well defined metric, the objective function. However, diverse suboptimal solutions may be preferred over harder to implement strict optimal ones. In addition, the decision-maker usually has insights that are not always efficiently translated into the optimization model, such as acceptable target, interval or range values. Multi-criteria decision making is an example of involving the user in the decision process. In this paper, we present two variants of goal-seeking QUBO that minimize the deviation from the goal through a tabu-search based greedy one-flip heuristic. Experimental results illustrate the efficacy of the proposed approach over Constraint Programming for quickly finding a satisficing set of solutions.

[1]  Gintaras Palubeckis,et al.  Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem , 2004, Ann. Oper. Res..

[2]  Fred W. Glover,et al.  The unconstrained binary quadratic programming problem: a survey , 2014, Journal of Combinatorial Optimization.

[3]  Mark W. Lewis,et al.  Optimal quadratic reformulations of fourth degree Pseudo-Boolean functions , 2020, Optim. Lett..

[4]  Hossein Arsham Goal-seeking problem in discrete event systems simulation , 1997 .

[5]  Peter J. Stuckey,et al.  MiniZinc: Towards a Standard CP Modelling Language , 2007, CP.

[6]  A. Soyster,et al.  Preemptive and nonpreemptive multi-objective programming: Relationship and counterexamples , 1983 .

[7]  Josep Argelich,et al.  Boolean lexicographic optimization: algorithms & applications , 2011, Annals of Mathematics and Artificial Intelligence.

[8]  Fred W. Glover,et al.  A unified modeling and solution framework for combinatorial optimization problems , 2004, OR Spectr..

[9]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[10]  Fred W. Glover,et al.  Path relinking for unconstrained binary quadratic programming , 2012, Eur. J. Oper. Res..

[11]  Aurora Trinidad Ramirez Pozo,et al.  A decomposition-based binary ACO algorithm for the multiobjective UBQP , 2017, Neurocomputing.

[12]  Ziyan Wu,et al.  A multi-objective tabu search algorithm based on decomposition for multi-objective unconstrained binary quadratic programming problem , 2018, Knowl. Based Syst..

[13]  Sébastien Vérel,et al.  A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming , 2014, Appl. Soft Comput..

[14]  Hossein Arsham,et al.  Algorithms for sensitivity information in discrete-event systems simulation , 1998, Simul. Pract. Theory.

[15]  Edward L. Hannan,et al.  Nondominance In Goal Programming , 1980 .