Effective Variable Fixing and Scoring Strategies for Binary Quadratic Programming

TitreEffective Variable Fixing and Scoring Strategies for Binary Quadratic Programming
Type de publicationCommunication
TypeCommunication avec actes dans un congrès
Année2011
LangueAnglais
Date du colloque2011
Titre du colloque11th European Conference, EvoCOP 2011
Titre des actes ou de la revueEvolutionary Computation in Combinatorial Optimization
Volume6622
Pagination72 - 83
AuteurWang, Yang, Lü, Zhipeng, Glover, Fred, Hao, Jin-Kao
PaysItalie
EditeurSpringer Berlin Heidelberg
VilleTurin
ISBN978-3-642-20363-3 / 978-3-642-20364-0
Mots-clésalgorithm analysis and problem complexity, Computation by Abstract Devices, Discrete Mathematics in Computer Science, pattern recognition, Probability and Statistics in Computer Science
Résumé en anglais

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.

Notes

Date du colloque : 04/2011

URL de la noticehttp://okina.univ-angers.fr/publications/ua4509
DOI10.1007/978-3-642-20364-0_7
Lien vers le document en ligne

http://dx.doi.org/10.1007/978-3-642-20364-0_7