Name
Abstract | ||
|---|---|---|
In this paper, we reported our study on solving 0/1 knapsack problem effectively by using ant colony optimization. The 0/1 knapsack problem is to maximize the total profit under the constraint that the total weight of all chosen objects is at the most weight limit. In our study, we viewed the search in ant colonies as a mechanism providing a better performance and it has the ability to escape from local optima. In this paper, several examples are tested to demonstrate the superiority of the proposed algorithm. From simulation results, the proposed algorithm indeed has remarkable performance. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ICSMC.2006.384598 | 2006 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-6, PROCEEDINGS |
Keywords | Field | DocType |
ant colony optimization,ant colony,profitability,knapsack problem | Ant colony optimization algorithms,Mathematical optimization,Local optimum,Computer science,Generalized assignment problem,Continuous knapsack problem,Cutting stock problem,Knapsack problem,Ant colony,Polynomial-time approximation scheme | Conference |
ISSN | Citations | PageRank |
1062-922X | 4 | 0.45 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chou-Yuan Lee | 1 | 295 | 17.36 |
| Zne-Jung Lee | 2 | 940 | 43.45 |
| Shun-Feng Su | 3 | 1194 | 97.62 |