ACO Algorithm for MKP Using Various Heuristic Information
In: Numerical Methods and Applications ISBN: 9783540006084 Numerical Methods and Application; (2003)
Online
unknown
Zugriff:
The ant colony optimization (ACO) algorithms are being applied successfully to diverse heavily constrained problems: traveling salesman problem, quadratic assignment problem. Early applications of ACO algorithms have been mainly concerned with solving ordering problems. In this paper, the principles of the ACO algorithm are applied to the multiple knapsack problem (MKP). In the first part of the paper we explain the basic principles of ACO algorithm. In the second part of the paper we propose different types of heuristic information and we compare the obtained results.
Titel: |
ACO Algorithm for MKP Using Various Heuristic Information
|
---|---|
Autor/in / Beteiligte Person: | Fidanova, Stefka |
Link: | |
Quelle: | Numerical Methods and Applications ISBN: 9783540006084 Numerical Methods and Application; (2003) |
Veröffentlichung: | Springer Berlin Heidelberg, 2003 |
Medientyp: | unknown |
ISBN: | 978-3-540-00608-4 (print) |
DOI: | 10.1007/3-540-36487-0_49 |
Schlagwort: |
|
Sonstiges: |
|