A hybrid optimized multi-population flower pollination algorithm for web service composition problem

Danni Lv, Lijuan Zhou, Ning Luo
{"title":"A hybrid optimized multi-population flower pollination algorithm for web service composition problem","authors":"Danni Lv, Lijuan Zhou, Ning Luo","doi":"10.1117/12.2667493","DOIUrl":null,"url":null,"abstract":"With the rapid development of Service-Oriented Computing (SOC), Web services have become the preferred technology for realizing Service-oriented computing problems and other related goals. How to find a cheap and high-quality Web service composition from a large number of Web services that provide the same function, that is, the research based on Quality of Service (QoS) is the most important problem in the Web service composition optimization model, which is also very important to improve the efficiency of the service composition. In this work, we use the intelligence optimization algorithms to search for the best combination of web services to achieve the functionality of the workflow’s tasks. And we propose a novel approach, called A Hybrid Optimized Multi-Population Flower Pollination Algorithm (AHOMFPA) to solve this problem. Empirical comparisons demonstrate AHOMFPA has advantages over other existing algorithms in efficiency and feasibility.","PeriodicalId":345723,"journal":{"name":"Fifth International Conference on Computer Information Science and Artificial Intelligence","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fifth International Conference on Computer Information Science and Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2667493","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the rapid development of Service-Oriented Computing (SOC), Web services have become the preferred technology for realizing Service-oriented computing problems and other related goals. How to find a cheap and high-quality Web service composition from a large number of Web services that provide the same function, that is, the research based on Quality of Service (QoS) is the most important problem in the Web service composition optimization model, which is also very important to improve the efficiency of the service composition. In this work, we use the intelligence optimization algorithms to search for the best combination of web services to achieve the functionality of the workflow’s tasks. And we propose a novel approach, called A Hybrid Optimized Multi-Population Flower Pollination Algorithm (AHOMFPA) to solve this problem. Empirical comparisons demonstrate AHOMFPA has advantages over other existing algorithms in efficiency and feasibility.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
面向web服务组合问题的混合优化多种群传粉算法
随着面向服务计算(SOC)的快速发展,Web服务已经成为实现面向服务计算问题和其他相关目标的首选技术。如何从大量提供相同功能的Web服务中找到廉价且高质量的Web服务组合,即基于服务质量(QoS)的研究,是Web服务组合优化模型中最重要的问题,对提高服务组合的效率也非常重要。在这项工作中,我们使用智能优化算法来搜索web服务的最佳组合,以实现工作流任务的功能。为了解决这一问题,我们提出了一种新的杂交优化多种群授粉算法(AHOMFPA)。实证比较表明,AHOMFPA算法在效率和可行性上都优于其他现有算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Design and application of rhythmic gymnastics auxiliary training system based on Kinect Long-term stock price forecast based on PSO-informer model Research on numerical simulation of deep seabed blowout and oil spill range FL-Lightgbm prediction method of unbalanced small sample anti-breast cancer drugs Learning anisotropy and asymmetry geometric features for medical image segmentation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1