为使现有Web服务组合的服务选择技术满足用户需求,提出一种基于改进二进制粒子群优化(BPSO)的服务选择算法.引入变异算子和线性递减惯性权重,解决传统二进制BPSO的早熟收敛问题,采用粒子记忆性对不满足约束条件的个体进行修正.实验结果表明,该算法能提高寻优效率.%A global optimal algorithm based on Binary Particle Swarm Optimization(BPSO) is presented to resolve user needs in Web service composition. The mutation operation and linearly decreasing inertia weight are used to overcome the premature convergence of traditional BPSO. Based on the memory of particles, the individuals that do not conform to the constraint conditions are modified. Experimental results show that the algorithm can improve the searching efficiency.
展开▼
