A simplified binary harmony search algorithm for large scale 0–1 knapsack problems

作者：

Highlights：

• A difference based ingenious improvisation scheme is proposed.

• The pitch adjustment operator can be executed without requiring any parameters.

• A greedy repair procedure is introduced to ensure the availability of solutions.

• The proposed SBHS algorithm is easier for implementation.

• It is more effective and suitable for solving large scale 0–1 knapsack problems.

摘要

•A difference based ingenious improvisation scheme is proposed.•The pitch adjustment operator can be executed without requiring any parameters.•A greedy repair procedure is introduced to ensure the availability of solutions.•The proposed SBHS algorithm is easier for implementation.•It is more effective and suitable for solving large scale 0–1 knapsack problems.

论文关键词：Harmony search,Simplified binary harmony search,0–1 knapsack problems,Large scale,Ingenious improvisation scheme

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

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