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.
Domains
Computer Science [cs]
Origin : Files produced by the author(s)
Loading...