Effective Variable Fixing and Scoring Strategies for Binary Quadratic Programming - Université d'Angers Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Effective Variable Fixing and Scoring Strategies for Binary Quadratic Programming

Résumé

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.

Dates et versions

hal-03255564 , version 1 (09-06-2021)

Identifiants

Citer

Yang Wang, Zhipeng Lü, Fred Glover, Jin-Kao Hao. Effective Variable Fixing and Scoring Strategies for Binary Quadratic Programming. 11th European Conference, EvoCOP 2011, 2011, Turin, Italy. pp.72 - 83, ⟨10.1007/978-3-642-20364-0_7⟩. ⟨hal-03255564⟩

Collections

UNIV-ANGERS LERIA
10 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More