A hybrid metaheuristic approach to solving the UBQP problem

This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into the framework of evolutionary algorithms, the proposed approach exhibits several distinguishing features, including a diversification-based combination operator and a distance-and-quality based replacement criterion for pool updating. The proposed algorithm is able to easily obtain the best-known solutions for 31 large random instances up to 7000 variables (which no previous algorithm has done) and find new best solutions for 3 of 9 instances derived from the set partitioning problem, demonstrating the efficacy of our proposed algorithm in terms of both solution quality and computational efficiency. Furthermore, some key elements and properties of the HMA algorithm are also analyzed.

• Type: Journal
• Year: 2010
• Where: EOR
• Authors: Zhipeng Lü, Fred Glover, Jin-Kao Hao
• Keywords: Algorithm, Binary Quadratic Programming, EOR 2010, Hybrid Metaheuristic Approach