Skip to Main Content
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.