移动Agent在网格中的路径优化算法研究

Research on Mobile Agent Path Optimization Algorithm in Grid

用移动Agent作为访问网格服务的任务载体,代表服务或者应用程序在各种网格服务间智能地移动,能充分发挥移动Agent的优势,达到提高效率、减少开销的目的.因为网格环境具有自己的特点,因此提出了动态市场旅行商问题(TSP)模型来充分描述移动Agent在网格环境中行为方式,以及移动Agent在该模型中的路径优化算法,这对于指导不同类型移动Agent在网格中的路径选择是很有实用价值的.

It is proposed that mobile agents act as carriers of tasks of applications or services in dynamic heterogeneous grid environments because of autonomy and intelligence of mobile agents. And a new TSP model--dynamic market TSP model, is introduced that is more suited for grid and a path optimization algorithm is proposed to optimize the migration paths of mobile agents in this model. The simulation experiments in different TSP maps have been conducted for this algorithm. The data show that this algorathm makes mobile agents run through less distance for their tasks than the traditional optimization algorithm does, and it converges more quickly.