Abstract
The Bipartite Boolean Quadratic Programming Problem with Partitioned Variables (BBQP-PV) is an NP-hard problem with many practical applications. In this study, we present an effective multiple phase tabu search algorithm for solving BBQP-PV. The algorithm is characterized by a joint use of three key components: two tabu search phases that employ a simple neighborhood and a very large-scale neighborhood to achieve search intensification, and a hybrid perturbation phase that adaptively chooses a greedy perturbation or a recency-based perturbation for search diversification. Experimental assessment on 50 standard benchmarks indicates that the proposed algorithm is able to obtain improved lower bounds for 5 instances and match the previously best solutions for most instances, while achieving this performance within competitive time. Additional analysis confirms the importance of the innovative search components.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
