A hybrid heuristic for the 0–1 Knapsack Sharing Problem

作者：

Highlights：

• A new hybrid method based on ILPH and QPSO is proposed and validated on the KSP.

• The proposed approach can be easily adapted to other variants of knapsack problems.

• New valid constraints are used to speed up the reduced problems solved inside ILPH.

• A local search is incorporated in ILPH as an intensification process.

• QPSO starts with the best solutions provided by ILPH where infeasibility is allowed.

摘要

•A new hybrid method based on ILPH and QPSO is proposed and validated on the KSP.•The proposed approach can be easily adapted to other variants of knapsack problems.•New valid constraints are used to speed up the reduced problems solved inside ILPH.•A local search is incorporated in ILPH as an intensification process.•QPSO starts with the best solutions provided by ILPH where infeasibility is allowed.

论文关键词：Hybrid method,Relaxation,Knapsack problem,Particle swarm optimization

论文评审过程：Available online 7 February 2015.

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