Title :
A new version of ant system for subset problems
Author :
Leguizamón, Guillermo ; Michalewicz, Zbigniew
Author_Institution :
Interest Group on Comput. Syst., Univ. Nacional de San Luis, Argentina
Abstract :
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
Keywords :
artificial life; knapsack problems; optimisation; set theory; ACO algorithm; Ant Colony Optimization; MKP; Multiple Knapsack Problem; ant system; computational study; ordering problems; subset problems; traveling salesman problem; Ant colony optimization; Application software; Cities and towns; Computer science; Evolutionary computation; Multiagent systems; Neural networks; Problem-solving; Simulated annealing; Traveling salesman problems;
Conference_Titel :
Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-5536-9
DOI :
10.1109/CEC.1999.782655
