The ant colony metaphor for multiple knapsack problem

• Autores: Marcelo Guillermo Cena, María Liz Crespo, Carlos Kavka, Mario Guillermo Leguizamón
• Localización: Journal of Computer Science and Technology, ISSN-e 1666-6038, Vol. 1, Nº. 2, 2000 (Ejemplar dedicado a: Second Issue; 2 p.)
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

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