陈彦萍, 樊梦茹. 基于元胞遗传算法的Web服务选择[J]. 微电子学与计算机, 2015, 32(11): 116-119,124.
引用本文: 陈彦萍, 樊梦茹. 基于元胞遗传算法的Web服务选择[J]. 微电子学与计算机, 2015, 32(11): 116-119,124.
CHEN Yan-ping, FAN Meng-ru. Web Service Selection Based on the Cellular Genetic Algorithm[J]. Microelectronics & Computer, 2015, 32(11): 116-119,124.
Citation: CHEN Yan-ping, FAN Meng-ru. Web Service Selection Based on the Cellular Genetic Algorithm[J]. Microelectronics & Computer, 2015, 32(11): 116-119,124.

基于元胞遗传算法的Web服务选择

Web Service Selection Based on the Cellular Genetic Algorithm

  • 摘要: 为了提高遗传算法在服务选择中的收敛速度与稳定性,将元胞遗传算法引入服务选择中,用元胞遗传算法典型的"生命游戏"规则及改进的演化规则取代传统遗传算法中的单点交叉操作.实验结果表明,采取规则4作为演化规则的元胞遗传算法可以很好地解决传统遗传算法运行结果不稳定和收敛性差的现象.

     

    Abstract: In order to improve the genetic algorithm convergence speed and stability, we bring the cellular genetic algorithm into the field of service selection. We use a typical cellular genetic algorithm rule Game of Life and improved rules to replace the single-point crossover operation in the traditional genetic algorithm. The experimental results show that the Rule Four can solve the instability of result and poor convergence phenomenon in the traditional genetic algorithm.

     

/

返回文章
返回