A swarm optimization-based search algorithm for the quadratic knapsack problem with conflict Graphs

作者：

Highlights：

• A new binary knapsack with conflict graphs problem is studied.

• A new tailored discrete particle swarm optimization is proposed.

• A tailored local optimization is used for repairing / improving the solution at hand.

• The algorithm succeeds in yielding hight bounds on instances of the literature.

摘要

•A new binary knapsack with conflict graphs problem is studied.•A new tailored discrete particle swarm optimization is proposed.•A tailored local optimization is used for repairing / improving the solution at hand.•The algorithm succeeds in yielding hight bounds on instances of the literature.

论文关键词：Knapsack,Optimization,Population,Particle swarm

论文评审过程：Received 11 September 2018, Revised 29 December 2019, Accepted 19 January 2020, Available online 20 January 2020, Version of Record 15 February 2020.

论文官网地址：https://doi.org/10.1016/j.eswa.2020.113224