Neighborhood Combination for Unconstrained Binary Quadratic Programming
Zhipeng Lü · 2009
Using the Unconstrained Binary Quadratic Programming (UBQP) problem as a case study, we present an experimental analysis of neighborhood combinations for local search based metaheuristic algorithms. In this work, we use one-flip and two-flip moves and investigate combined neighborhoods with these two moves within two metaheuristic algorithms. The goal of the analysis is to help understand why and how some neighborhoods can be favorably combined to increase their search power.