Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm

• The framework of HS is restructured for 0–1 optimization problems.
• The probability distribution is focused instead of the exact variable value.
• An ingenious pitch adjustment scheme without parameter specification is executed.
• A simple but effective repair operator derived from specific heuristic knowledge.
• This proposed NBHS is robust and effective for solving large-scale MKPs.

Harmony search (HS) is a meta-heuristic method that has been applied widely to continuous optimization problems. In this study, a new binary coded version of HS, named NBHS, is developed for solving large-scale multidimensional knapsack problem (MKP). In the proposed method, focus is given to the probability distribution rather than the exact value of each decision variable and the concept of mean harmony is introduced in the memory consideration. Unlike the existing HS variants which require specifications of parameters such as the pitch adjustment rate and step bandwidth, an ingenious pitch adjustment scheme without parameter specification is executed in the proposed HS according to the difference between two randomly selected harmonies stored in the harmony memory to generate a new candidate harmony. Moreover, to guarantee the availability of harmonies in the harmony memory, a simple but effective repair operator derived from specific heuristic knowledge of the MKP is embedded in the proposed method. Finally, extensive numerical simulations are conducted on two sets of large-scale benchmark problems, and the results reveal that the proposed method is robust and effective for solving the multidimensional knapsack problems with large dimension sizes.