Ant algorithm for the multidimensional knapsack problem

Ines Alaya (1) , Christine Solnon (1) , Khaled Ghedira (2)

1 LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
2 SOIE - Stratégies d’Optimisation et Informatique intelligentE

We propose a new algorithm based on the Ant Colony Optimization (ACO) meta-heuristic for the Multidimensional Knapsack Problem, the goal of which is to find a subset of objects that maximizes a given objective function while satisfying some resource constraints. We show that our new algorithm obtains better results than two other ACO algorithms on most instances.

Domaines: Informatique [cs]

Ines Alaya, Christine Solnon, Khaled Ghedira. Ant algorithm for the multidimensional knapsack problem. International conference on Bioinspired Methods and their Applications (BIOMA 2004), May 2004, Ljubljana, Slovenia. pp.63-72. ⟨hal-01541529⟩