摘要
随着Web服务的日益丰富,如何动态地从大量候选服务集中选择出整体性能高的组合服务已成为服务组合优化领域亟待解决的问题。为稳定、高效地解决大数据集下的服务组合问题,提出一种柯西烟花算法。该算法在搜索过程中引入柯西变异算子增强了算法的全局搜索能力;采用精英候选策略有效降低了算法的时间开销。实验结果验证了该算法在处理大规模服务组合优化问题时的可行性和稳定性。
With the increasingly rich Web service, how to dynamically select the composite services with high overall performance has become a service portfolio optimization urgent problem to be solved from a large number of candidate services. In order to stabilize and efficiently solve the problem of service portfolio in large data sets, a Cauchy fireworks algorithm is proposed. In the search process, the algorithm enhances the global search capability of the algorithm though leading to Cauchy variation operator. Using elite selection strategy, the time cost of the algorithm is effectively reduced. The experimental results verify the feasibility and stability of this algorithm in the large-scale service combination optimization.
作者
王亮
郭星
WANG Liang;GUO Xing(College of Computer Science and Technology,Anhui University,Hefei 230601,China;Key Laboratory of Intelligent Computing & Signal Processing of Ministry of Education,Anhui University,Hefei 230601,China)
出处
《计算机工程与应用》
CSCD
北大核心
2018年第24期34-40,共7页
Computer Engineering and Applications
基金
国家科技支撑计划(No.2015BAK24B01)
关键词
烟花算法
服务质量
WEB服务
WEB服务组合
fireworks algorithm
quality of service
Web service
Web services portfolio