By Topic

Route selection by mobile agents for query retrieval using genetic algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Selamat, A. ; Div. of Comput. & Syst. Sci., Osaka Prefecture Univ., Sakai, Japan ; Omatu, S.

Mobile agents often have the task to collect data from several predefined sites. This should be done in an efficient way by minimizing the elapsed time. Usually the agents only know the list of sites but not the distances between them. This paper shows the optimal threshold point depends on the number of visits the agent takes or equivalently the number of tours taken within that period where the collected network information does not get outdated by using genetic algorithm. In contrast to former publications this paper presents an algorithm to determine the agent's tour that does not only depend on a known distance matrix but the time delay due to network bottleneck is also considered. The agent repeats travelling over short routes and avoids longer ones. A genetic algorithm (GA) approach for selecting the best routes has been applied to the mobile agents technology. The results shows that the proposed route selection approach using the GA with different parameters have shown good route optimization results.

Published in:

Computational Intelligence in Robotics and Automation, 2003. Proceedings. 2003 IEEE International Symposium on  (Volume:2 )

Date of Conference:

16-20 July 2003