| Optimization in the Migration Problem of Mobile Agents in Distributed Information Retrieval Systems |
| |
| 引用本文： | HeYan-xiang ChenYi-feng HeJing CaoJian-nong. Optimization in the Migration Problem of Mobile Agents in Distributed Information Retrieval Systems[J]. 武汉大学学报:自然科学英文版, 2004, 9(2): 153-160. DOI: 10.1007/BF02830594 |
| |
| 作者姓名： | HeYan-xiang ChenYi-feng HeJing CaoJian-nong |
| |
| 作者单位： | [1]SchoolofComputer,WuhanUniversity,Wuhan430072,Hubei,China [2]HongKongPolytechnicUniversity,HungHom,Kowloon,HongKong,China [3]DepartmentofComputerScience,UtahStateUniversity,Utah84341,USA |
| |
| 基金项目： | SupportedbytheNationalNaturalScienceFoundationofChina(90 1 0 4 0 0 5) ,theNaturalScienceFoundationofHubeiProvinceandtheHongKongPolytechnicUniversityunderthegrantG YD63 |
| |
| 摘 要： | In this paper,we employ genetic algorithms to solve the migration problem (MP).We propose a new encoding scheme to represent trees,which is composed of two parts;the pre-ordered traversal sequence of tree vertices and the children number sequence of corresponding tree vertices.The proposed encoding scheme has the advantages of simplicity for encoding and decoding,ease for GA operations,and better equilibrium between exploration and exploitation.It is also adaptive in that,with few restrictions on the length of code,it can be freely lengthened or shortened according to the characteristics of the problem space.Furthermore,the encoding scheme is highly applicable to the degreeconstrained minimum spanning tree problem because it also contains the degree information of each node.The simulation results demonstrate the higher performance of our algorithm,with fast convergence to the optima or sub-optima on various problem sizes.Comparing with the binary string encoding of vertices,when the problem size is large,our algorithm runs remarkably faster with comparable search capability.
|
| 关 键 词： | 移民问题 移动代理 分布式信息修复系统 遗传算法 编码方案 通信网络 |
| 收稿时间： | 2003-08-10 |
Optimization in the migration problem of mobile agents in distributed information retrieval systems |
| |
| He Yan-xiang,Chen Yi-feng,He Jing,Cao Jian-nong. Optimization in the migration problem of mobile agents in distributed information retrieval systems[J]. Wuhan University Journal of Natural Sciences, 2004, 9(2): 153-160. DOI: 10.1007/BF02830594 |
| |
| Authors: | He Yan-xiang Chen Yi-feng He Jing Cao Jian-nong |
| |
| Affiliation: | (1) School of Computer, Wuhan University, 430072 Wuhan, Hubei, China;(2) State Key Laboratory of Software Engineering, Wuhan University, 430072 Wuhan, Hubei, China;(3) Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China;(4) Department of Computer Science, Utah State University, 84341, Utah, USA |
| |
| Abstract: | In this paper, we employ genetic algorithms to solve the migration problem (MP). We propose a new encoding scheme to represent trees, which is composed of two parts: the pre-ordered traversal sequence of tree vertices and the children number sequence of corresponding tree vertices. The proposed encoding scheme has the advantages of simplicity for encoding and decoding, ease for GA operations, and better equilibrium between exploration and exploitation. It is also adaptive in that, with few restrictions on the length of code, it can be freely lengthened or shortened according to the characteristics of the problem space. Furthermore, the encoding scheme is highly applicable to the degree-constrained minimum spanning tree problem because it also contains the degree information of each node. The simulation results demonstrate the higher performance of our algorithm, with fast convergence to the optima or sub-optima on various problem sizes. Comparing with the binary string encoding of vertices, when the problem size is large, our algorithm runs remarkably faster with comparable search capability. |
| |
| Keywords: | distributed information retrieval mobile agents migration problem genetic algorithms |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
|
