基于遗传模拟退火算法的Web组合服务选择
Genetic Simulated Annealing Algorithm for Composite Web Service Selection
提出一种将遗传算法与模拟退火算法相结合的优化算法,在保留遗传算法全局搜索能力强的基础上,用退火选择作为个体替换策略,使之具有较强的局部搜索能力,并使搜索过程避免陷入局部最优解。同时提出满足各种服务组合类型的新型适应度值计算方法,扩大此优化算法所能进行选择的Web组合服务类型范围。实验仿真证明该方法可以有效地缩减服务选择时间,提高选择效率。
his paper provides an effective solution of composite web service selection by combination of genetic algorithm and simulated annealing algorithm. The purpose is to retain the global search capability of genetic algorithm and also to obtain the local search capability of simulated annealing algorithm which is used as a strategy to replace the individual in process of genetic algorithm and to avoid to falling into local optimal solution. At the same time to meet a variety of services composition types, it raises a new fitness function to expand the scope of composite web service selection. At the end of the paper, experiments on composite web services selection show that the improved combination algorithm is very effective. It reduces the total time of the selection process and improves the selection efficiency.
龙丽娟、苏森
计算技术、计算机技术
组合服务选择遗传算法模拟退火算法
composite Web service selectiongenetic algorithmsimulated annealing algorithm
龙丽娟,苏森.基于遗传模拟退火算法的Web组合服务选择[EB/OL].(2009-01-22)[2025-08-02].http://www.paper.edu.cn/releasepaper/content/200901-1059.点此复制
评论