@inproceedings{a7845c181a8d4420bfea0c4cde9201e4,
title = "Application for artificial bee colony algorithm in migration of mobile agent",
abstract = "The traveling agent problem is a complex combinatorial optimization problem, which solves the problem of planning out an optimal migration path according to the tasks when agents migrate to several hosts in the shortest time. Evolutionary algorithm such as ACO has the well characteristic for heuristic search and robustness. But it has the limitation for the stagnation in the searching. This problem will cause the agent wasting more time in tasking. To avoid it an improved algorithm based on artificial bee colony is introduced. This algorithm uses three kinds of roles: Blaze, Reconnaissance and Follow to routing and finishing the tasks. Agents of the role exchange the information to adopt their own path. The whole group can get the more efficiency path during migration. The experiments show this algorithm has better results in some aspects which needs less times and load for host comparing with the other evolutionary algorithm.",
keywords = "Artificial bee colony, Mobile Agent, TAP",
author = "Jian Jiao and Shan Yao and Chunehe Xia",
year = "2010",
doi = "10.1007/978-3-642-14831-6\_31",
language = "英语",
isbn = "3642148301",
series = "Communications in Computer and Information Science",
publisher = "Springer Verlag",
pages = "232--238",
booktitle = "Advanced Intelligent Computing Theories and Applications - 6th International Conference on Intelligent Computing, ICIC 2010, Proceedings",
address = "德国",
}