Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
References
Alidaee, B., Kochenberger, G., & Ahmadian, A. (1994). 0–1 Quadratic programming approach for the optimal solution of two scheduling problems. International Journal of Systems Science, 25, 401–408.
Barahona, F., Grotschel, M., Junger, M., & Reinelt, G. (1988). An application of combinatorial optimization to statistical physics and circuit layout design. Operations Research, 36(3), 493–513.
Bomze, I.M., Budinich, M., Pardalos, P.M., & Pelillo M. (1999). The maximum clique problem. In Handbook of Combinatorial Optimization (pp. 1–74). Springer.
Boros, E., & Hammer, P. L. (1991). The max-cut problem and quadratic 0–1 optimization polyhedral aspects, relaxations and bounds. Annals of Operations Research, 33(1–4), 151–180.
Chardaire, P., & Sutter, A. (1994). A decomposition method for quadratic zero-one programming. Management Science, 4(1), 704–712.
Gallo, G., Hammer, P., & Simeone, B. (1980). Quadratic knapsack problems. Mathematical Programming, 12, 132–149.
Glover, F., & Hao, J. K. (2010a). Efficient evaluations for solving large 0–1 unconstrained quadratic optimization problems. International Journal of Metaheuristics, 1(1), 1–10.
Glover, F., & Hao, J. K. (2010a). Fast 2-flip move evaluations for binary unconstrained quadratic optimization problems. International Journal of Metaheuristics, 1(2), 100–107.
Glover, F., Laguna, M., & Marti, R. (2000). Fundamentals of scatter search and pathrelinking. Control and Cybernetics, 39, 654–684.
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.
Hammer, P. L., & Rudeanu, S. (1968). Boolean methods in operations research and related areas. Econometrics and operations research (Vol. 5). Berlin: Springer.
Kochenberger, G., Glover, F., Alidaee, B., & Rego, C. (2004). A unified modeling and solution framework for combinatorial optimization problems. OR Spectrum, 26, 237–250.
Kochenberger, G. A., Hao, J.-K., Lü, Z., Wang, H., & Glover, F. (2013). Solving large scale max cut problems via tabu search. Journal of Heuristics, 19(4), 565–571.
Kochenberger, G., Hao, J. K., Glover, F., Lewis, M., Lü, Z., Wang, H., et al. (2014). The unconstrained binary quadratic programming problem: A survey. Journal of Combinatorial Optimization, 28, 58–81.
Krarup, J., & Pruzan, A. (1978). Computer aided layout design. Mathematical Programming Study, 9, 75–94.
Laughunn, D. J. (1970). Quadratic binary programming. Operations Research, 14, 454–461.
Lewis, M., Kochenberger, G., & Alidaee, B. (2008). A new modeling and solution approach for the set-partitioning problem. Computers and Operations Research, 35(3), 807–813.
Wang, Y., Lü, Z., Glover, F., & Hao, J. K. (2012). Path relinking for unconstrained binary quadratic programming. European Journal of Operational Research, 223(3), 595–604.
Wang, Y., Lü, Z., Glover, F., & Hao, J. K. (2013). Probabilistic GRASP-tabu search algorithms for the UBQP problem. Computers and Operations Research, 40(12), 3100–3107.
Acknowledgments
We are indebted to an insightful referee who discovered the omission of a variable in our formulation of Proposition 1.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Glover, F., Hao, JK. f-Flip strategies for unconstrained binary quadratic programming. Ann Oper Res 238, 651–657 (2016). https://doi.org/10.1007/s10479-015-2076-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-015-2076-1