基于麻雀算法的Web服务组合  

Web service composition based on sparrow search algorithm

作　　者：杨宏伟[1] 薛富城 李莉[1] YANG Hong-wei;XUE Fu-cheng;LI Li(School of Computer Science and Technology,Changchun University of Science and Technology,Changchun 130022,China)

机构地区：[1]长春理工大学计算机学院,吉林长春130022

出　　处：《计算机工程与设计》2022年第4期922-929,共8页Computer Engineering and Design

基　　金：吉林省教育厅基金项目(JJKH20200786KJ)。

摘　　要：为解决当前Web服务组合问题模型单一,面对复杂问题效率低下等问题,提出一种基于Petri网的服务组合模型(SCPN),清楚描述服务之间约束关系和执行逻辑,通过实验验证所提模型的可行性;提出一种改进的麻雀搜索算法(SSA)对所提模型进行结合求解服务组合问题,通过使用一种自适应调节步长因子的方法,提高SSA算法的全局搜索能力。对比实验验证了所提算法在解决服务组合问题时精确性高、收敛速度快、稳定性好,可行有效。To solve the single model of the current Web service composition problem and the low efficiency problem in the face of complex problems,a Petri net-based service composition Petri net(SCPN)was presented.The constraint relationship and execution logic between services was clearly described.The proposed Web services composite model was modeled and verified by an example.An improved sparrow search algorithm(SSA)was proposed to combine the proposed model to solve the service composition problem.The global search capability of the SSA algorithm was improved using a method of adaptively adjusting the step factor.The effectiveness,high accuracy,high convergence speed and stability of the proposed algorithm are verified by comparative experiments.

关 键 词：服务组合 PETRI网 麻雀搜索算法 群体智能算法 服务质量属性 

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