Work

Ant algorithm for the multi-dimensional knapsack problem

Year: 2004

Type: article

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.

Authors: Inès Alaya, Christine Solnon, Khaled Ghédira

Institution: Laboratoire d'Informatique en Images et Systèmes d'Information

Language: English

Topic: Metaheuristic Optimization Algorithms Research

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W3016885447

FWCI: 1.958

Cites: 7

Cited by: 60

Related to: 10