The ant colony metaphor for multiple knapsack problem

Autor:	Marcelo Guillermo Cena, María Liz Crespo, Carlos Kavka, Mario Guillermo Leguizamón
Jazyk:	angličtina
Rok vydání:	2000
Předmět:	nature based metaheuristic ant colony optimisation subset problems multiple knapsack problem Computer engineering. Computer hardware TK7885-7895 Electronic computers. Computer science QA75.5-76.95
Zdroj:	Journal of Computer Science and Technology, Vol 1, Iss 02, Pp 11 p.-11 p. (2000)
Druh dokumentu:	article
ISSN:	1666-6046 1666-6038
Popis:	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.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/4b7d308167984a4c95d04a3a1ff51ec1 Zobrazit plný text záznamu View record in DOAJ