为了实时提供满足客户QoS需求的组合Web服务,提出了一种快速稳定的基于遗传算法的多QoS约束服务选择算法。首先根据基于QoS约束的组合服务选择问题的数学模型,提出了一个较为合理的数据预处理过滤方法以缩小搜索空间,然后使用遗传算法的思想构造算法,并在实验的基础上确定各项参数,最后使用新的算法完成可行解搜索。实验结果表明,与传统的整数规划算法相比,新算法具有运算速度较快、可满足实时性要求,并且在问题规模扩大时具有良好的可扩展性等特点。
For providing the composed web services in real time which satisfying users QoS requirement, a rapid and stable multiple QoS constraints service selection algorithm based on genetic algorithm is given. Based on the mathematical model of the composed services selection problem on QoS constraints basis, a fairly reasonable data pre-treatment filtering method for minishing the solution space is proposed first, and then the thought of genetic algorithm is introduced to construct an algorithm, followed by determining fit parameters of the algorithm according to the experiments, at last the search of feasible solution with the new algorithm is completed. Experimental result shows, comparing with traditional Integer Programming algorithm, this new algorithm takes less time in computation so as to be able to meet the real time requirement. Moreover, it has the character of better scalability when the problem's scale is broaden.