Improved Swap Heuristic for the Multiple Knapsack Problem

In this paper, we describe two new improvements of the well known Martell and Toth Heuristic Method (MTHM). Our new improvements are very simple and at the same time they are very efficient since they yield to more than 15% over MTHM with an excellent execution time performance in relatively large problem instances. Further, the new improvements give a very close results to sophisticated meta-heuristics namely Genetic Algorithms with a gap less than 1% within a time slot less than a second.