A new method of service selection is proposed to implement the global optimal selection of Web services
and to avoid the routine in a genetic algorithm where an optimal evolving set is built for every current evolving operation to impose a negative influence on the efficiency of the algorithm. The pseudo binary tree's rule is used to produce a set of optimal Pareto solutions. Then the optimal Pareto solutions are sequenced and individuals' similarity of each Pareto solution is calculated to determine the fitness function in the genetic algorithm. Experimental results show of proposed method generates a result that has a similarity up to 90% compared with the optimal result
even in the case of a large number of services.
关键词
Keywords
references
ZHAO Zengliang, BENATALLAH B, NGU A H H, et al. QoS-aware middleware for Web services composition [J]. IEEE Transactions on Software Engineering, 2004, 30(5):311-327.
LIU Shulei, LIU Yunxiang, ZHANG Fan,et al. A dynamic Web services selection algorithm with QoS global optimal in Web services composition [J]. Journal of Software, 2007, 18(3): 656-656.
ATASHKARI K, NARIMAN-ZADEH N, PILECHI A, et al. Thermodynamic Pareto optimization of turbojet engines using multi-objective genetic algorithm [J]. International Journal of Thermal Sciences, 2005, 44(11): 1061-1071.
ZHENG Jinhua, JIANG Hao, KUANG Da, et al. An approach of constructing multi-objective Pareto optimal solutions using Arena's principle [J]. Journal of Software, 2007, 18(6): 1287-1297.