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

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
id I19-R120-10915-9392
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
nature based metaheuristic; ant colony optimisation; subset problems; multiple knapsack problem
Algorithms
Optimization
spellingShingle Ciencias Informáticas
nature based metaheuristic; ant colony optimisation; subset problems; multiple knapsack problem
Algorithms
Optimization
Cena, Marcelo Guillermo
Crespo, María Liz
Kavka, Carlos
Leguizamón, Mario Guillermo
The ant colony metaphor for multiple knapsack problem
topic_facet Ciencias Informáticas
nature based metaheuristic; ant colony optimisation; subset problems; multiple knapsack problem
Algorithms
Optimization
description 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.
format Articulo
Articulo
author Cena, Marcelo Guillermo
Crespo, María Liz
Kavka, Carlos
Leguizamón, Mario Guillermo
author_facet Cena, Marcelo Guillermo
Crespo, María Liz
Kavka, Carlos
Leguizamón, Mario Guillermo
author_sort Cena, Marcelo Guillermo
title The ant colony metaphor for multiple knapsack problem
title_short The ant colony metaphor for multiple knapsack problem
title_full The ant colony metaphor for multiple knapsack problem
title_fullStr The ant colony metaphor for multiple knapsack problem
title_full_unstemmed The ant colony metaphor for multiple knapsack problem
title_sort ant colony metaphor for multiple knapsack problem
publishDate 2000
url http://sedici.unlp.edu.ar/handle/10915/9392
http://journal.info.unlp.edu.ar/wp-content/uploads/2015/papers_02/theant.pdf
work_keys_str_mv AT cenamarceloguillermo theantcolonymetaphorformultipleknapsackproblem
AT crespomarializ theantcolonymetaphorformultipleknapsackproblem
AT kavkacarlos theantcolonymetaphorformultipleknapsackproblem
AT leguizamonmarioguillermo theantcolonymetaphorformultipleknapsackproblem
AT cenamarceloguillermo antcolonymetaphorformultipleknapsackproblem
AT crespomarializ antcolonymetaphorformultipleknapsackproblem
AT kavkacarlos antcolonymetaphorformultipleknapsackproblem
AT leguizamonmarioguillermo antcolonymetaphorformultipleknapsackproblem
bdutipo_str Repositorios
_version_ 1764820491969757184

Ejemplares similares