节点文献
普适计算中一种最优服务选择算法的设计与仿真
Design and simulation of optimum service selection arithmetic in pervasive computing
【摘要】 详细分析了服务选择问题及其求解目标,综合服务提供方高效率低成本和终端用户方的服务质量(QoS)等目标约束条件,提出一种多目标约束的最优服务选择遗传算法。该算法采用矩阵描述服务提供方、服务、终端用户三者之间的关系,并采用矩阵编码方式,将矩阵视为染色体个体,将矩阵的列视为染色体基因。仿真实验结果表明,该算法具有较好的收敛性和稳定的寻优能力。
【Abstract】 After analyzing the essence of service selection,this paper proposed an optimum service selection genetic algorithm with multi-objective constraints.The algorithm included a matrix-coding scheme of chromosomes that expressed the relationship between service providers,services and end-users.Constructed special crossover and mutation operations based on matrix-co-ding,and could ensure both operations the new chromosomes were feasible.Simulation results show that this algorithm can obtain the optimal solutions of the test problem instances efficiently and steadily.
【Key words】 service selection; genetic algorithm; matrix-coding scheme; multi-objective constraints;
- 【文献出处】 计算机应用研究 ,Application Research of Computers , 编辑部邮箱 ,2010年03期
- 【分类号】TP18
- 【被引频次】11
- 【下载频次】267