Abstract

This paper proposes a two-step ants algorithm for the Multidimensional Knapsack Problem. In the first step, the algorithm uses an Anti-pheromone to detect which objects are less suitable to be part of a near-optimal solution solving the opposite problem. From this information, in the second step an ant-based algorithm continues searching for better solutions trying to solve the real problem.