摘要
为了在大规模Web服务环境中筛选出满足用户复杂应用需求且综合性能高的服务组合,提出一种混合混沌机制与Levy变异的改进烟花算法。首先利用混沌理论产生初始烟花群体,避免种群个体分散不均,造成重复多次局部寻优现象;然后在搜索过程中引入Levy变异算子,提高算法的全局搜索能力,有效避免早熟收敛;最后采用精英选择策略筛选下一代烟花种群,降低了算法的时间开销。通过大量实验结果说明了该算法的寻优性能和稳定性。
In order to pick out the service composition that meets the complex application requirements of users and the high comprehensive performance in the large-scale Web service environment, we propose an improved fireworks algorithm mixing chaotic mechanism and Levy mutation. Firstly, the chaos theory is used to generate the initial fireworks population and avoid uneven dispersion of individuals which can result in repeated local optimization. Then the Levy mutation operator is introduced to the search process to enhance the global search capability of the algorithm and avoid premature convergence. Finally, the elite selection strategy is adopted to reduce the time expenses of the algorithm in the process of selecting next generation fireworks population. Experimental results verify the optimization performance and stability of the algorithm.
作者
刘婷
杨秋翔
LIU Ting;YANG Qiu-xiang(School of Software,North University of China,Taiyuan 030051;Institute of Signal Capture & Processing Technology,North University of China,Taiyuan 030051,China)
出处
《计算机工程与科学》
CSCD
北大核心
2019年第9期1618-1626,共9页
Computer Engineering & Science
基金
2017年中北大学校科学基金(20171459)
关键词
WEB服务组合
服务质量
混沌机制
Levy变异
烟花算法
适应度函数
Web service composition
quality of service
chaotic mechanism
Levy mutation
fireworks algorithm
fitness function
