A hybrid binary particle swarm optimization with tabu search for the set-union knapsack problem
作者：
Highlights：
• A hybrid binary particle swarm optimization is proposed.
• Applying an adaptive penalty function as fitness function.
• Using a tabu search procedure to improve solution quality.
• Presenting a tabu based mutation procedure to achieve diversification.
• We find new best solutions for 28 out of 30 instances.
摘要
•A hybrid binary particle swarm optimization is proposed.•Applying an adaptive penalty function as fitness function.•Using a tabu search procedure to improve solution quality.•Presenting a tabu based mutation procedure to achieve diversification.•We find new best solutions for 28 out of 30 instances.
论文关键词：Set-union knapsack problem,Particle swarm optimization,Local search,Heuristic,Binary programming
论文评审过程：Received 26 October 2018, Revised 4 June 2019, Accepted 5 June 2019, Available online 6 June 2019, Version of Record 14 June 2019.
论文官网地址：https://doi.org/10.1016/j.eswa.2019.06.007
