Ant algorithm for the multidimensional knapsack problem - Archive ouverte HAL Access content directly
Conference Papers Year : 2004

Ant algorithm for the multidimensional knapsack problem

Abstract

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.
Fichier principal
Vignette du fichier
bioma04.pdf (180.49 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01541529 , version 1 (24-03-2020)

Identifiers

  • HAL Id : hal-01541529 , version 1

Cite

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⟩
293 View
658 Download

Share

Gmail Facebook Twitter LinkedIn More