基于遗传禁忌搜索的网格资源选择算法

Grid resource selection algorithm based on Tabu search and genetic

资源是网格的主体,建立网格的目的就是要管理好的各种网格资源,最大程度地实现资源共享。把网格上的资源和用户请求进行匹配,把合适的可用资源提供给用户使用是网格管理的核心内容。分析了目前常用的资源选择算法,并在此基础上,提出了一种新的算法。该算法结合了遗传算法和禁忌搜索算法的优点,利用禁忌搜索中的禁忌列表来对遗传算法中交换进行有效的限制,避免进入局部搜索。最后通过试验将新算法与遗传算法进行比较。

Resource is main object in the grid. The goal of establishment of grid is taking good management of the resources, achieving resource. Matching between grid resource and users＇ demands and supplying all the resource, which users can use, are core parts of grid management. To analyze current resource selection algorithm, and based on all above, a new algorithm is presented. The advantages of tabu search algorithm and genetic algorithm are combined. Utilizing tabu list to limit hybridize of genetic algorithm and escape getting into local search. Finally, new algorithm is compared to genetic algorithm.