A cooperative local search-based algorithm for the Multiple-Scenario Max–Min Knapsack Problem

The purpose of this article is to present a novel method to approximately solve the Multiple-Scenario Max–Min Knapsack Problem (MSM2KP). This problem models many real world situations, e.g. when for many scenarios noted π∈P={1,…,P}π∈P={1,…,P}, the aim is to identify the one offering a better alternative in term of maximizing the worst possible outcome.Herein is presented a cooperative approach based on two local search algorithms: (i) a limited-area local search applied in the elite neighborhood and which accepts the first solution with some deterioration threshold of the current solution, (ii) a wide range local search is applied to perform a sequence of paths exchange to improve the current solution.Results have been analyzed by means state-of-the art methods and via problem instances obtained by a generator code taken from the literature. The tests were executed in compeltely comparable scenarios to those of the literature. The results are promising and the efficiency of the proposed approach is also shown.