万有引力搜索算法的Web服务选择  

Web Service Selection for Gravitation Search Algorithm

作　　者：袁博 马力[1] YUAN Bo;MA Li(Xi'an University of Posts & Telecommunications,Xi'an 710061)

机构地区：[1]西安邮电大学,西安710061

出　　处：《计算机与数字工程》2019年第2期289-295,共7页Computer & Digital Engineering

摘　　要：针对传统优化算法不能很好解决高维度搜索空间的优化问题,提出了一种改进的万有引力搜索算法,将万有引力搜索算法和粒子群优化算法进行结合,通过对边界进行一定的操作和在新的搜索空间内激活停滞粒子,使粒子跳出局部区域,去寻找最优解。引用Web服务组合领域使用的旅游场景模型,实验结果表明,所提出的算法相比传统启发式优化算法具有较好的性能并且在解决基于多目标优化的Web服务组合问题上也具有一定的可行性。Focusing on the problems of the traditional optimization algorithm can not solve the problem of high dimensionsearch space optimization. An improved gravitational search algorithm is proposed,which combines the gravitational search algo-rithm with the particle swarm optimization algorithm. Through the operation of the boundary and the new search space Activate thestagnant particles,so that the particles jump out of the local area,to find the optimal solution. The experimental results show thatwith the increase of the number of iterations,the proposed algorithm has better performance than traditional heuristic optimization al-gorithm.

关 键 词：万有引力算法 服务质量控制 粒子群算法 多目标优化 

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