Dynamic services selection algorithm in Web services composition supporting cross-enterprises collaboration

Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.

面向工业互联网平台的二维制造服务协作优化

工业互联网平台被公认为智能制造的必要推动者,使物理制造资源得以虚拟化,并允许资源以服务的形式进行协作。作为平台的核心功能,制造服务协作优化致力于为制造任务提供高质量的服务协作解决方案。这种优化与任务的功能和数量要求密不可分,在编排服务时必须满足这些要求。然而,现有的制造服务协作优化方法主要关注服务之间针对功能需求的横向协作,很少考虑纵向协作来覆盖所需的数量。为了解决这一差距,本文提出了一种结合功能和数量协作的二维服务协作方法。首先,提出了一种描述服务的多粒度制造服务建模方法。在此基础上,建立了二维制造服务协同优化模型。在垂直维度上,多个功能等效的服务组成一个服务集群来完成一个子任务;在水平维度上,互补服务集群协作完成整个任务。服务的选择和所选服务的金额分配是模型中的关键问题。为了解决这个问题,设计了一种具有多个局部搜索算子的多目标模因算法。将该算法嵌入竞争机制来动态调整本地搜索算子的选择概率。实验结果表明,与常用算法相比,该算法在收敛性、解质量和综合度量方面具有优势。