Backbone guided tabu search for solving the UBQP problem

Authors:
Yang Wang;Zhipeng Lü;Fred Glover;Jin-Kao Hao
Affiliations:
LERIA, Université d'Angers, Angers Cedex 01, France 49045;LERIA, Université d'Angers, Angers Cedex 01, France 49045;OptTek Systems, Inc., Boulder, USA 80302;LERIA, Université d'Angers, Angers Cedex 01, France 49045
Venue:
Journal of Heuristics
Year:
2013

Citing 12
Cited 2

A decomposition method for quadratic zero-one programming

Management Science
Adaptive Memory Tabu Search for Binary Quadratic Programs

Management Science
A scatter search approach to unconstrained quadratic binary programs

New ideas in optimization
Tabu Search

Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Configuration landscape analysis and backbone guided local search: part I: Satisfiability and maximum satisfiability

Artificial Intelligence
Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)

Journal of Heuristics
A new modeling and solution approach for the set-partitioning problem

Computers and Operations Research
Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem

Informatica
Backbones and backdoors in satisfiability

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems

International Journal of Metaheuristics
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)

Discrete Optimization

Probabilistic GRASP-Tabu Search algorithms for the UBQP problem

Computers and Operations Research
A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a backbone-guided tabu search (BGTS) algorithm for the Unconstrained Binary Quadratic Programming (UBQP) problem that alternates between two phases: (1) a basic tabu search procedure to optimize the objective function as far as possible; (2) a strategy using the TS notion of strongly determined variables to alternately fix and free backbone components of the solutions which are estimated likely to share values in common with an optimal solution. Experimental results show that the proposed method is capable of finding the best-known solutions for 21 large random instances with 3000 to 7000 variables and boosts the performance of the basic TS in terms of both solution quality and computational efficiency.