News Help Institutional access
Back to results
Bibliographic record · Consultation and access
Artículo

The ant colony metaphor for multiple knapsack problem

Cena, Marcelo Guillermo et al · SEDICI UNLP · 2000

Open-access full text
Quick overview. Review the resource’s basic details, then access the content using the main button. This page shows only the information needed to identify, cite, and open the work.
Author / responsible party
Cena, Marcelo Guillermo et al
Publisher
SEDICI UNLP
Year
2000
Language
English

Resource access

Open the content from the main option or choose another available source.

SEDICI UNLP SEDICI UNLP OAI-PMH
Entrar por SEDICI UNLP
Main access

Open-access full text

Texto completo identificado como acceso abierto.
Open text

Summary

Descripción general del contenido del recurso.

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. Facultad de Informática

How to cite

Elegí el formato que necesitás y copiá la referencia al portapapeles.

APA 7

Cena, M. G. E. A. (2000). The ant colony metaphor for multiple knapsack problem. http://sedici.unlp.edu.ar/handle/10915/9392

MLA

Cena, Marcelo Guillermo et al. "The ant colony metaphor for multiple knapsack problem." 2000. http://sedici.unlp.edu.ar/handle/10915/9392.

Chicago

Cena, Marcelo Guillermo et al. 2000. "The ant colony metaphor for multiple knapsack problem.". http://sedici.unlp.edu.ar/handle/10915/9392.

Harvard

Cena, M. G. E. A. 2000, The ant colony metaphor for multiple knapsack problem, SEDICI UNLP, available at: http://sedici.unlp.edu.ar/handle/10915/9392 [Accessed 7 Aug. 2026].

Share and print

Save the record, copy its permanent link, or print it as a PDF.

Export reference

You can export the record in common formats for use in a reference manager.

RIS BibTeX

Resource details

Bibliographic information to help confirm that this is the correct material.

Title
The ant colony metaphor for multiple knapsack problem
Author / contributors
Cena, Marcelo Guillermo et al
Publisher
SEDICI UNLP
Publication year
2000
Language
English

Subjects

Explore related resources through these subjects.

Ciencias Informáticas; nature based metaheuristic; ant colony optimisation; subset problems; multiple knapsack problem; Algorithms; Optimization
Copied