基于改进粒子群-蚁群融合算法的网格资源分配方法  

Grid resource allocation based on improved mixing algorithm with PSO and ACS

作　　者：王栋[1] 卢秀清[2] 

机构地区：[1]兰州文理学院电子信息工程学院,甘肃兰州730000 [2]兰州理工大学研究生学院,甘肃兰州730050

出　　处：《兰州理工大学学报》2013年第4期94-98,共5页Journal of Lanzhou University of Technology

摘　　要：为有效解决网格计算中的资源分配和任务调度问题,提出一种改进粒子群-蚁群融合算法.该算法通过改进的离散粒子群算法对信息进行优化调度,产生优选的调度列表,并通过该列表产生改进蚁群算法的初始信息素,有效克服了粒子群算法后期局部搜索能力差和蚁群算法前期盲目搜索的缺陷.理论分析和仿真实验表明本文算法具有较好的性能.In order to solve the problems of resource allocation and task dispatch in grid computation, a improved mixing algorithm with particle swarm-ant colony was presented. In this algorithm, the schedu- ling information was dispatched with optimization by means of improved discrete particle swarm algo- rithm, producing an optimized scheduling list. By using this list, initialized pheromone was generated for the improved ant colony algorithm and the defect that the particle swarm algorithm has poor local search capability in the post-stage and blind search of ant colony algorithm in the early stage was overcome. The theoretical analysis and simulation test showed that the algorithm proposed in this paper would have better performance.

关 键 词：网格计算 资源分配 粒子群优化 蚁群优化 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]