本文選題：Web服務(wù)組合 + 粒子蟻群算法　； 參考：《哈爾濱理工大學》2014年碩士論文

【摘要】：隨著網(wǎng)絡(luò)技術(shù)的不斷發(fā)展，應(yīng)用程序的不斷增加，使得網(wǎng)路上存在大量共享的Web服務(wù)。然而這些Web服務(wù)都是一些細顆粒度的功能簡單的服務(wù)，無法滿足用戶復(fù)雜的需求。這時就需要一種能將這些簡單的Web服務(wù)快速組合起來，使之可以滿足特定需求的技術(shù)，以此來達到軟件的重用，減少資源的浪費的目的。 為了提高在大量Web服務(wù)中快速有效找到面向特定問題的最優(yōu)Web服務(wù)組合的效率，以滿足用戶日益復(fù)雜的服務(wù)需求，本文提出一種基于服務(wù)質(zhì)量(Quality of Service，QoS)的Web服務(wù)組合粒子蟻群優(yōu)化算法。論文詳細地講述了從歸類共享于網(wǎng)絡(luò)中的原子Web服務(wù)到最終最優(yōu)方案產(chǎn)生的整個過程中所涉及的技術(shù)，算法和模型。本文的主要內(nèi)容： 首先，根據(jù)Web服務(wù)描述語言(Web Services Description Language，WSDL)文件中服務(wù)名和輸入輸出參數(shù)的相似程度將這些Web服務(wù)歸類為若干個功能相同，接口相同的服務(wù)侯選集，并建立簡單的Web服務(wù)組合模型。 其次，根據(jù)建立的Web服務(wù)組合模型將Web服務(wù)優(yōu)化組合的問題轉(zhuǎn)化為求由多個原子服務(wù)構(gòu)成的基于QoS有向圖的最短路徑問題。 然后，，通過對蟻群算法和粒子群算法優(yōu)缺點的研究，提出兼顧運行時間和效率的粒子蟻群算法，這個算法的具體思想是：先通過粒子群算法快速找出若干條次優(yōu)路徑并初始化路徑中的信息素，蟻群算法根據(jù)初始化的信息素利用快速收斂的特性求出最優(yōu)解。 最后結(jié)合選出的服務(wù)侯選集和建立的Web服務(wù)組合服務(wù)模型，將此算法應(yīng)用到Web服務(wù)組合問題中，并與蟻群算法和粒子群算法在相同實驗環(huán)境、相同問題下得出的實驗結(jié)果進行對比。實驗表明，該算法相對于傳統(tǒng)的蟻群算法和粒子群算法在求解Web服務(wù)組合問題中有一定優(yōu)勢。
[Abstract]:With the continuous development of network technology and the increasing number of applications, there are a large number of shared Web services on the network.However, these Web services are simple and fine grained services, which can not meet the complex needs of users.At this time, we need a technology that can quickly combine these simple Web services to meet the specific requirements, so as to achieve the purpose of software reuse and reduce the waste of resources.In order to improve the efficiency of finding the optimal Web service composition in a large number of Web services quickly and effectively, to meet the increasingly complex service requirements of users,In this paper, a Web service composition particle ant colony optimization algorithm based on quality of Service (QoS) is proposed.This paper describes in detail the techniques, algorithms and models involved in the process from the classification of atomic Web services shared in the network to the generation of the final optimal scheme.The main contents of this paper are as follows:Firstly, according to the similarity between the service name and the input and output parameters in the Web service description language (Web Services Description language) file, these Web services are classified into several services with the same function and the same interface, and a simple Web service composition model is established.Secondly, according to the established Web service composition model, the problem of optimal composition of Web services is transformed into the shortest path problem based on QoS directed graph, which is composed of multiple atomic services.Then, through the research on the advantages and disadvantages of ant colony algorithm and particle swarm optimization algorithm, a particle ant colony algorithm which takes both running time and efficiency into account is proposed.The concrete idea of this algorithm is: firstly, some sub-optimal paths are quickly found by particle swarm optimization algorithm and the pheromone in the path is initialized, and the ant colony algorithm obtains the optimal solution according to the property of fast convergence of the initialized pheromone.Finally, combining the selected service selection and the Web service composition service model, this algorithm is applied to the Web service composition problem, and it is in the same experimental environment as ant colony algorithm and particle swarm optimization algorithm.The experimental results obtained under the same question were compared.Experiments show that the proposed algorithm has some advantages over the traditional ant colony algorithm and particle swarm optimization algorithm in solving Web service composition problem.
【學位授予單位】：哈爾濱理工大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TP18;TP393.09

【引證文獻】

相關(guān)期刊論文 前1條

1 袁士君;艾中良;李喻;;基于用戶需求特征的Web服務(wù)動態(tài)組合方法研究[J];軟件;2015年03期

相關(guān)碩士學位論文 前1條

1 荊紫慧;基于改進離散粒子群算法的Web服務(wù)組合研究[D];安徽大學;2016年

本文編號：1771078