摘要
针对网格环境下独立任务的调度问题,提出了一种新的混合遗传算法,通过调整算法结构,来增加染色体的多样性,通过加入针对特定问题的调整操作,来有效地提高算法的局部搜索能力,使遗传算法兼具全局和局部搜索能力,防止早熟收敛。仿真实验表明,跟其他算法相比,提出的算法取得了很好的调度长度,并且收敛速度也很快。
Presents a new hybrid genetic algorithm to solve the problem of independent tasks scheduling in grid.This algorithm expands the variety of population by adjusting the structure of the algorithm,and it also improves the local search ability by adding the adjusting operation.It has good global and local search ability,which can avoid premature convergence.The simulation results comparing with other scheduling algorithms show that it produces better results in terms of schedule length and it also has good convergent speed.
出处
《计算机工程与应用》
CSCD
北大核心
2007年第26期138-141,共4页
Computer Engineering and Applications
基金
浙江省自然科学基金( the Natural Science Foundation of Zhejiang Province of China under Grant NoY105118
NoY105109)
关键词
网格
任务调度
遗传算法
局部搜索
grid
task scheduling
genetic algorithm
local search
