Multi-objective and discrete Elephants Herding Optimization algorithm for QoS aware web service composition

Author:

Chibani Sadouki Samia,Tari Abdelkamel

Abstract

The goal of QoS aware web service composition (QoS-WSC) is to provide new functionalities and find a best combination of services to meet complex needs of users. QoS of the resulting composite service should be optimized. QoS-WSC is a global multi-objective optimization problem belonging to NP-hard class given the number of available services. Most of existing approaches reduce this problem to a single-objective problem by aggregating different objectives, which leads to a loss of information. An alternative issue is to use Pareto-based approaches. The Pareto-optimal set contains solutions that ensure the best trade-off between conflicting objectives. In this paper, a new multi-objective meta-heuristic bio-inspired Pareto-based approach is presented to address the QoS-WSC, it is based on Elephants Herding Optimization (EHO) algorithm. EHO is characterised by a strategy of dividing and combining the population to sub population (clan) which allows exchange of information between local searches to get a global optimum. However, the application of others evolutionary algorithms to this problem cannot avoids the early stagnancy in a local optimum. In this paper a discrete and multi-objective version of EHO will be presented based on a crossover operator. Compared with SPEA2 (Strength Pareto Evolutionary Algorithm 2) and MOPSO (Multi-Objective Particle Swarm Optimization algorithm), the results of experimental evaluation show that our improvements significantly outperform the existing algorithms in term of Hypervolume, Set Coverage and Spacing metrics.

Publisher

EDP Sciences

Subject

Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science

Reference31 articles.

1. Al-Masri E. and Mahmoud Q.H., QoS-based discovery and ranking of web services. In Proceedings of 16th International Conference on Computer Communications and Networks, ICCCN (2007) 529–534.

2. Artemio Coello Coello C., Lamont Gary B. and Veldhuizen David V., Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation). Springer; 2nd Edition (2007).

3. Artemio Coello Coello C. and Lechuga M.S., MOPSO: a proposal for multiple objective particle swarm optimization. In Proceedings of the 2002 Congress on Evolutionary Computation, CEC ’02 (2002) 1051–1056.

4. Canfora G., Di Penta M., Espositio R. and Luisa Villani M., An approach for QoS-aware service composition based on genetic algorithms. In GECCO ‘05 Proceedings of the 2002 Congress on Evolutionary Computation (2005) 1069–1075.

5. Chang W.-Ch., Wu Ch.-Seh and Chang Ch., Optimizing dynamic web service component composition by using evolutionary algorithms. In IEEE International Conference on Web Intelligence (2005) 708–711.

Cited by 15 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Cross-organizational Full-chain Intelligent Collaborative Service Method in Cloud Manufacturing;2024 7th International Symposium on Autonomous Systems (ISAS);2024-05-07

2. A Discrete Adaptive Lion Optimization Algorithm for QoS-Driven IoT Service Composition with Global Constraints;Journal of Network and Systems Management;2024-03-13

3. Fuzzified Hybrid Metaheuristics for QoS-Aware Service Composition;Lecture Notes on Data Engineering and Communications Technologies;2024

4. NSGA-II-AMO: A Faster Genetic Algorithm for QWSCP;Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing;2022-11-19

5. A novel discrete elephant herding optimization for energy-saving flexible job shop scheduling problem with preventive maintenance;Journal of Intelligent & Fuzzy Systems;2022-11-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3