Effective variable fixing and scoring strategies for binary quadratic programming

Authors:
Yang Wang;Zhipeng Lü;Fred Glover;Jin-Kao Hao
Affiliations:
LERIA, Université d'Angers, Angers Cedex, France;LERIA, Université d'Angers, Angers Cedex, France;OptTek Systems, Inc., CO;LERIA, Université d'Angers, Angers Cedex, France
Venue:
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Year:
2011

Citing 4
Cited 2

Adaptive Memory Tabu Search for Binary Quadratic Programs

Management Science
Tabu Search

Tabu Search
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms

Proceedings of the 6th International Conference on Genetic Algorithms
Configuration landscape analysis and backbone guided local search: part I: Satisfiability and maximum satisfiability

Artificial Intelligence

A multilevel algorithm for large unconstrained binary quadratic optimization

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Probabilistic GRASP-Tabu Search algorithms for the UBQP problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate two variable fixing strategies and two variable scoring strategies within a tabu search algorithm, using the unconstrained binary quadratic programming (UBQP) problem as a case study. In particular, we provide insights as to why one particular variable fixing and scoring strategy leads to better computational results than another one. For this purpose, we perform two investigations, the first analyzing deviations from the best known solution and the second analyzing the correlations between the fitness distances of high-quality solutions. We find that one of our strategies obtains the best solutions in the literature for all of the test problems examined.