Título: The ant colony metaphor for multiple knapsack problem
Autores: Cena, Marcelo Guillermo
Crespo, María Liz
Kavka, Carlos
Leguizamón, Mario Guillermo
Fecha: 2004-05-10
2000
Publicador: Unversidad Nacional de La Plata
Fuente:


Tipo: Articulo
Articulo
Tema: nature based metaheuristic; ant colony optimisation; subset problems; multiple knapsack problem
Ciencias Informáticas
Algoritmos evolutivos
Optimización
Informática
Descripción: This paper presents an Ant Colony Optimisation (ACO) model for the Multiple Knapsack Problem (MKP). The ACO algorithms, as well as other evolutionary metaphors, are being applied successfully to diverse heavily constrained problems: Travelling Salesman Problem, Quadratic Assignment Problem and Bin Packing Problem. An Ant System, the first ACO algorithm that we presented in this paper, is also considered a class of multiagent distributed algorithm for combinatorial optimisation. The principle of an ACO Algorithm is adapted to the MKP. We present some results regardin its perfomance against known optimun for different instances of MKP. The obtained results show the potential power of this particular evolutionary approach for optimisation problems.
Idioma: Inglés