f-Flip strategies for unconstrained binary quadratic programming
Unconstrained binary quadratic programming (UBQP) provides a unifying modeling and solution framework for solving a remarkable range of binary optimization problems, including many accompanied by constraints. Current methods for solving UBQP problems customarily rely on neighborhoods consisting of flip moves that select one or more binary variables and “flip” their values to the complementary value (from 1 to 0 or from 0 to 1). We introduce a class of approaches called f-flip strategies that include a fractional value f as one of those available to the binary variables during intermediate stages of solution. A variety of different f-flip strategies, particularly within the context of multi-start algorithms, are proposed for pursuing intensification and diversification goals in metaheuristic algorithms, accompanied by special rules for evaluating and executing f-flips efficiently.
Keywords0–1 Optimization Binary quadratic programming Metaheuristics Multi-start algorithms Computational efficiency
- Bomze, I.M., Budinich, M., Pardalos, P.M., & Pelillo M. (1999). The maximum clique problem. In Handbook of Combinatorial Optimization (pp. 1–74). Springer.Google Scholar
- Chardaire, P., & Sutter, A. (1994). A decomposition method for quadratic zero-one programming. Management Science, 4(1), 704–712.Google Scholar
- Gallo, G., Hammer, P., & Simeone, B. (1980). Quadratic knapsack problems. Mathematical Programming, 12, 132–149.Google Scholar
- Glover, F., Laguna, M., & Marti, R. (2000). Fundamentals of scatter search and pathrelinking. Control and Cybernetics, 39, 654–684.Google Scholar
- Glover, F., Laguna, M., & Marti, R. (2004). Scatter search and path relinking: Foundations and advanced designs, new optimization technologies in engineering. In G. C. Onwubolu & B. V. Babu (Eds.), Studies in Fuzziness and Soft Computing (Vol. 141, pp. 87–100). Berlin: Springer.Google Scholar