Abstract:

The key idea behind cultural algorithm is to explicitly acquire problem-solving knowledge from the evolving population and in return apply that knowledge to guide the search. In this article, cultural algorithm-simulated annealing is proposed to solve the routing problem of mobile agent. The optimal individual is accepted to improve the belief space’s evolution of cultural algorithms by simulated annealing. The step size in search is used as situational knowledge to guide the search of optimal solution in the population space. Because of this feature, the search time is reduced. Experimental results show that the algorithm proposed in this article can ensure the quality of optimal solutions, and also has better convergence speed. The operation efficiency of the system is considerably improved.

Key words:

cultural algorithm;mobile agent;routing;simulated annealing