Local Search Heuristic For Multiple Knapsack Problem

In this paper we will present a heuristic method to solve the Multiple Knapsack Problem. The proposed method is an improvement of the IRT heuristic described in [2].the experimental study shows that our improvement leads some gain in time and solution qual-ity against IRT, MTHM, Mulknap and ILOG CPLEX.