The ant colony metaphor for multiple knapsack problem

Mostrar todas las versiones(2)

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 P...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Cena, Marcelo Guillermo, Crespo, María Liz, Kavka, Carlos, Leguizamón, Mario Guillermo
Formato: Articulo
Lenguaje:Inglés
Publicado: 2000
Materias:
Ciencias Informáticas
nature based metaheuristic; ant colony optimisation; subset problems; multiple knapsack problem
Algorithms
Optimization
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/9392
http://journal.info.unlp.edu.ar/wp-content/uploads/2015/papers_02/theant.pdf
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Ejemplares similares