Using a cultural algorithm to solve the mobile agent routing problem

作者：Zhang Jian Pei^*; Ma Jun; Yang Jing; Cheng Li Li

来源：Journal of Harbin Engineering University, 2009, 30(8): 913-917.

DOI：10.3969/j.issn.1006-7043.2009.08.012

• Belief space
• Computational costs
• Cultural algorithm
• Metropolis criterion
• Optimal routes
• QoS
• Routing problems
• Simulated annealing algorithms

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.

• 出版日期2009
• 单位哈尔滨工程大学