Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
详细信息 查看全文
- 作者：Jin Qina ; qinjinhust@gmail.com" class="auth_mail" title="E-mail the corresponding author ; Xianhao Xua ; xxhao@mail.hust.edu.cn" class="auth_mail" title="E-mail the corresponding author ; Qinghua Wua ; qinghuawu1005@gmail.com" class="auth_mail" title="E-mail the corresponding author ; T.C.E. Chengb ; lgtcheng@polyu.edu.hk" class="auth_mail" title="E-mail the corresponding author
- 关键词：Tabu search ; The quadratic multiple knapsack problem ; Infeasible local search
- 刊名：Computers and Operations Research
- 出版年：2016
- 出版时间：February 2016
- 年：2016
- 卷：66
- 期：Complete
- 页码：199-214
- 全文大小：391 K
文摘
- •
We develop a tabu search algorithm for the quadratic multiple knapsack problem.
- •
The algorithm incorporates a hybridization scheme combining both feasible and infeasible local searches.
- •
Out of the 60 instances we obtain 10 strictly new best solutions.
- •
Non-parametric tests emphasize the effectiveness of the proposed approach.