Please use this identifier to cite or link to this item:
Title: Optimization in the migration problem of mobile agents in distributed information retrieval systems
Authors: He, YX
Chen, YF
He, J
Cao, JN 
Issue Date: 2004
Source: Wuhan University journal of natural sciences (武汉大学学报. 自然科学版), 2004, v. 9, no. 2, p. 153-160
Abstract: 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. Compared 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
Genetic algorithms
Migration problem
Mobile agents
Publisher: Wuhan University
Journal: Wuhan University journal of natural sciences (武汉大学学报. 自然科学版) 
ISSN: 1007-1202
EISSN: 1993-4998
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Aug 18, 2020

Page view(s)

Last Week
Last month
Citations as of Sep 15, 2020

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.