Paper Info
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.
Year
DOI
Venue
2010
10.1007/978-3-642-14831-6_31
ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS
Keywords
Field
DocType
Mobile Agent,Artificial bee colony,TAP
Artificial bee colony algorithm,Heuristic,Evolutionary algorithm,Combinatorial optimization problem,Computer science,Mobile agent,Robustness (computer science),Artificial intelligence
Conference
Volume
ISSN
Citations 
93
1865-0929
2
PageRank 
References 
Authors
0.39
1
3
Name
Order
Citations
PageRank
Jian Jiao121.06
Shan Yao231.16
Chunhe Xia36318.30