The ant colony metaphor for multiple knapsack problem
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...
Uloženo v:
| Hlavní autoři: | , , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Postgraduate Office, School of Computer Science, Universidad Nacional de La Plata
2000-03-01
|
| Edice: | Journal of Computer Science and Technology |
| Témata: | |
| On-line přístup: | https://journal.info.unlp.edu.ar/JCST/article/view/1019 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|