Multi-objective memetic approach for the optimal web services composition

被引:3
作者
Azouz, Yacine [1 ]
Boughaci, Dalila [1 ]
机构
[1] USTHB, Fac Comp Sci, Algiers, Algeria
关键词
genetic algorithm; local search; memetic algorithm; multi-objective optimization; QoS model; web service composition; STOCHASTIC LOCAL SEARCH; ALGORITHM; OPTIMIZATION; SELECTION; MACHINE;
D O I
10.1111/exsy.13084
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Service composition is the process of combining a set of elementary or atomic services. The aim is to produce a new composite service to satisfy the user's request that cannot be satisfied by the atomic services. Combining multiple services is a complex problem that has been the subject of several research studies. The meta-heuristic approaches are good techniques that have been used to solve several complex problems in various domains. These techniques are able to discover promising search regions and locate good quality solutions in reasonable time without exploring the whole solution space. In this paper, we deal with the problem of optimal web service composition by using meta-heuristic approaches. Given a set of services and a set of tasks to be completed, the problem is to find the best set of services composition to complete all tasks where each service must be assigned to a given task. This problem can be modelled as a combinatorial optimization problem with a set of objective functions that need to be optimized. We search for a composite service that allows us to execute the considered tasks and offers the best quality of services (QoS). More precisely, we search for an execution plan that indicates for each task the assigned service. First, we propose a multi-objective local search based meta-heuristic (MO-LS) and a multi-objective genetic algorithm (MO-GA) to handle our problem. Then we propose a multi-objective memetic algorithm (MO-MA) that combines the two methods LS and GA. The role of GA is to detect promising regions to be explored. The role of LS is to exploit efficiently the potential regions created by GA. Four objective functions are used to compute the Pareto optimal set of solutions. The main objective is to minimize cost and time and to maximize availability and reputation and produce a good composite service. The three proposed approaches namely MO-LS, MO-GA, and MO-MA are evaluated on some datasets generated randomly and on the well-known QWS dataset to select the best fit services in terms of maximum or minimum aggregated end-to-end QoS parameters. The numerical results are encouraging and demonstrate the effectiveness of the proposed MO-MA for the web service composition.
引用
收藏
页数:28
相关论文
共 46 条
[11]   Exploration and Exploitation in Evolutionary Algorithms: A Survey [J].
Crepinsek, Matej ;
Liu, Shih-Hsi ;
Mernik, Marjan .
ACM COMPUTING SURVEYS, 2013, 45 (03)
[12]  
Danapaquiame N., 2015, VERIFICATION STRATEG
[13]  
Daniela C.B., 2005, ICEIS, P208
[14]  
Dave K., 2003, holderProceedings Of The 12th International Conference On World Wide Web, P519, DOI DOI 10.1145/775152.775226
[15]  
Dell'Olmo P., 2008, MULTIOBJECTIVE MANAG
[16]   Research on Cost-Driven Services Composition in an Uncertain Environment [J].
Gao, Honghao ;
Huang, Wanqiu ;
Duan, Yucong ;
Yang, Xiaoxian ;
Zou, Qiming .
JOURNAL OF INTERNET TECHNOLOGY, 2019, 20 (03) :755-769
[17]   A moth-flame optimization algorithm for web service composition in cloud computing: Simulation and verification [J].
Ghobaei-Arani, Mostafa ;
Rahmanian, Ali. A. ;
Souri, Alireza ;
Rahmani, Amir Masoud .
SOFTWARE-PRACTICE & EXPERIENCE, 2018, 48 (10) :1865-1892
[18]  
Hoos HH, 1999, SIXTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-99)/ELEVENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE (IAAI-99), P661
[19]  
Huo Y., 2017, APPL INTELL, V48, P1
[20]   Discrete gbest-guided artificial bee colony algorithm for cloud service composition [J].
Huo, Ying ;
Zhuang, Yi ;
Gu, Jingjing ;
Ni, Siru ;
Xue, Yu .
APPLIED INTELLIGENCE, 2015, 42 (04) :661-678