Early applications of Ant Colony Optimization (ACO) have been mainly concerned with solving ordering problems (e.g., traveling salesman problem). We introduce a new version of Ant System-an ACO algorithm for solving subset problems. The computational study involves the Multiple Knapsack Problem (MKP); the reported results show the potential power of the ACO approach for solving this type of subset problem.
No takes yet. Share an insight, caveat, or question.
Leguizamón et al. (2003) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: