Backbone guided tabu search for solving the UBQP problem
- 242 Downloads
We propose a backbone-guided tabu search (BGTS) algorithm for the Unconstrained Binary Quadratic Programming (UBQP) problem that alternates between two phases: (1) a basic tabu search procedure to optimize the objective function as far as possible; (2) a strategy using the TS notion of strongly determined variables to alternately fix and free backbone components of the solutions which are estimated likely to share values in common with an optimal solution. Experimental results show that the proposed method is capable of finding the best-known solutions for 21 large random instances with 3000 to 7000 variables and boosts the performance of the basic TS in terms of both solution quality and computational efficiency.
KeywordsBackbone-guided search Tabu search UBQP Strongly determined variables Variable fixing and freeing
Unable to display preview. Download preview PDF.
- Amini, M., Alidaee, B., Kochenberger, G.A.: A Scatter Search Approach to Unconstrained Quadratic Binary Programs. New Methods in Optimization, pp. 317–330. McGraw–Hill, New York (1999) Google Scholar
- Kilby, P., Slaney, J.K., Thiebaux, S.T.: Backbones and backdoors in satisfiability. In: Proceedings of AAAI-2005, pp. 1368–1373 (2005) Google Scholar