文化算法的主要思想是明确地从进化种群中获得求解问题的知识,并用于搜索过程.该文对移动Agent的路由问题进行形式化描述,给出了该问题的多约束最优路径求解模型,并提出了一种将模拟退火算法嵌入文化算法框架中来求解移动Agent路由规划问题的方法,根据Metropolis准则接受最优单体以推动文化算法中信念空间的进化.实验结果表明,改进的文化算法与遗传算法相比,解具有较优的结果以及较低的运算代价.
The cultural algorithm is a means to explicitly acquire problem-solving knowledge from an evolving population and in return apply that knowledge to guide a search. In this paper, the routing problem of mobile agents is formally demonstrated; a model for solving a multi-constrained optimal route is also presented. The cultural algorithm is based on a simulated annealing algorithm and is designed to solve the problem of routing mobile agents. The best individuals, based on Metropolis criterion, are accepted to improve the evolution of the belief space. Experiments showed that the algorithm produces highly competitive results at a relatively low computational cost.