Adaptive perturbed neighbourhood search for the expanding capacity multiple‐choice knapsack problem

In this paper, we develop a perturbed reactive‐based neighbourhood search algorithm for the expanding constraint multiple‐choice knapsack problem. It combines reactive tabu search with some specific neighbourhood search strategies to approximately solve the problem. The tests were conducted on randomly generated instances and executed in comparable benchmark scenarios to those of the literature. The results outperform those of the Cplex solver and demonstrate the high quality of the two approach versions.