计算机工程2012，Vol.38Issue(1)：140-142,3.DOI:10.3969/j.issn.1000-3428.2012.01.043
求解0-1二次规划问题的迭代禁忌搜索算法
Iterated Tabu Search Algorithm for Solving 0-1 Binary Quadratic Programming Problem
摘要
Abstract
This paper presents an iterated Tabu Search(TS) algorithm for the Binary Quadratic Programming(BQP) problem. The TS as the Local Search(LS) and a new perturbation strategy makes the search jump into a more promising area when TS falling into the local optimum. Experimental results show that the proposed algorithm can reach the best known solution on all the 30 large OR-library instances and comparisons with TS. Simulated Annealing(SA) and Memetic Algorithm(MA) demonstrate the competitiveness of the proposed algorithm.关键词
启发式算法/0-1二次规划/局部搜索/禁忌搜索/跳坑策略Key words
Heuristics Algorithm(HA)/ 0-1 Binary Quadratic Programming(BQP)/ Local Search(LS)/ Tabu Search(TS)/ perturbation strategy分类
信息技术与安全科学引用本文复制引用
张爱君,秦新强,龚春琼..求解0-1二次规划问题的迭代禁忌搜索算法[J].计算机工程,2012,38(1):140-142,3.基金项目
国家自然科学基金资助项目(50879069) （50879069）
