基于改进离散粒子群算法的Web服务组合研究-计算机软件与理论专业论文.docxVIP

  • 3
  • 0
  • 约5.46万字
  • 约 62页
  • 2019-02-20 发布于上海
  • 举报

基于改进离散粒子群算法的Web服务组合研究-计算机软件与理论专业论文.docx

安徽大学2016届硕士学位论文 安徽大学2016届硕士学位论文 基于改进离散粒子群算法的Web服务组合研究 (2)Analyses the basic principle of the standard PSO and points out the defect that the algorithm has premature convergence and is easy to trap into local optimum at later stages.This paper proposes an improved chaotic particle swarm optimization algorithm to solve service composition optimization problem.It introduces the idea of chaos optimization to improve the swarm diversity while simultaneously reduces the search space and improves the computational efficiency by skyline technology.A

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档