Title :
Improved ant colony algorithm to solve traveling agent problem
Author_Institution :
Coll. of Comput. & Inf. Eng., Harbin Univ. of Commerce, Harbin, China
Abstract :
A colony algorithm is a new kind of simulated evolutionary algorithm, which is widely applied to optimization problems, but it has the limitation like other evolutionary algorithms. To avoid the limitation, an improved ant colony optimization algorithm is introduced to solve the traveling agent problem, which is responsible for planning out an optimal migration strategy when agents migrate to several hosts for accomplishing its task. The results show that the algorithm is effective.
Keywords :
evolutionary computation; mobile agents; travelling salesman problems; ant colony optimization algorithm; mobile agent; optimal migration strategy; optimization problem; simulated evolutionary algorithm; traveling agent problem; Algorithm design and analysis; Ear; ant colony algorithm; mobile agent; optimization problems;
Conference_Titel :
Computer Application and System Modeling (ICCASM), 2010 International Conference on
Conference_Location :
Taiyuan
Print_ISBN :
978-1-4244-7235-2
Electronic_ISBN :
978-1-4244-7237-6
DOI :
10.1109/ICCASM.2010.5620626
