基于果蝇优化方法的正交阵列学习的QoS感知web服务选择

Manik Chandra, R. Niyogi
{"title":"基于果蝇优化方法的正交阵列学习的QoS感知web服务选择","authors":"Manik Chandra, R. Niyogi","doi":"10.1108/ijpcc-08-2020-0101","DOIUrl":null,"url":null,"abstract":"\nPurpose\nThis paper aims to solve the web service selection problem using an efficient meta-heuristic algorithm. The problem of selecting a set of web services from a large-scale service environment (web service repository) while maintaining Quality-of-Service (QoS), is referred to as web service selection (WSS). With the explosive growth of internet services, managing and selecting the proper services (or say web service) has become a pertinent research issue.\n\n\nDesign/methodology/approach\nIn this paper, to address WSS problem, the authors propose a new modified fruit fly optimization approach, called orthogonal array-based learning in fruit fly optimizer (OL-FOA). In OL-FOA, they adopt a chaotic map to initialize the population; they add the adaptive DE/best/2mutation operator to improve the exploration capability of the fruit fly approach; and finally, to improve the efficiency of the search process (by reducing the search space), the authors use the orthogonal learning mechanism.\n\n\nFindings\nTo test the efficiency of the proposed approach, a test suite of 2500 web services is chosen from the public repository. To establish the competitiveness of the proposed approach, it compared against four other meta-heuristic approaches (including classical as well as state-of-the-art), namely, fruit fly optimization (FOA), differential evolution (DE), modified artificial bee colony algorithm (mABC) and global-best ABC (GABC). The empirical results show that the proposed approach outperforms its counterparts in terms of response time, latency, availability and reliability.\n\n\nOriginality/value\nIn this paper, the authors have developed a population-based novel approach (OL-FOA) for the QoS aware web services selection (WSS). To justify the results, the authors compared against four other meta-heuristic approaches (including classical as well as state-of-the-art), namely, fruit fly optimization (FOA), differential evolution (DE), modified artificial bee colony algorithm (mABC) and global-best ABC (GABC) over the four QoS parameter response time, latency, availability and reliability. The authors found that the approach outperforms overall competitive approaches. To satisfy all objective simultaneously, the authors would like to extend this approach in the frame of multi-objective WSS optimization problem. Further, this is declared that this paper is not submitted to any other journal or under review.\n","PeriodicalId":210948,"journal":{"name":"Int. J. Pervasive Comput. Commun.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"QoS aware web service selection using orthogonal array learning on fruit fly optimization approach\",\"authors\":\"Manik Chandra, R. Niyogi\",\"doi\":\"10.1108/ijpcc-08-2020-0101\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\nPurpose\\nThis paper aims to solve the web service selection problem using an efficient meta-heuristic algorithm. The problem of selecting a set of web services from a large-scale service environment (web service repository) while maintaining Quality-of-Service (QoS), is referred to as web service selection (WSS). With the explosive growth of internet services, managing and selecting the proper services (or say web service) has become a pertinent research issue.\\n\\n\\nDesign/methodology/approach\\nIn this paper, to address WSS problem, the authors propose a new modified fruit fly optimization approach, called orthogonal array-based learning in fruit fly optimizer (OL-FOA). In OL-FOA, they adopt a chaotic map to initialize the population; they add the adaptive DE/best/2mutation operator to improve the exploration capability of the fruit fly approach; and finally, to improve the efficiency of the search process (by reducing the search space), the authors use the orthogonal learning mechanism.\\n\\n\\nFindings\\nTo test the efficiency of the proposed approach, a test suite of 2500 web services is chosen from the public repository. To establish the competitiveness of the proposed approach, it compared against four other meta-heuristic approaches (including classical as well as state-of-the-art), namely, fruit fly optimization (FOA), differential evolution (DE), modified artificial bee colony algorithm (mABC) and global-best ABC (GABC). The empirical results show that the proposed approach outperforms its counterparts in terms of response time, latency, availability and reliability.\\n\\n\\nOriginality/value\\nIn this paper, the authors have developed a population-based novel approach (OL-FOA) for the QoS aware web services selection (WSS). To justify the results, the authors compared against four other meta-heuristic approaches (including classical as well as state-of-the-art), namely, fruit fly optimization (FOA), differential evolution (DE), modified artificial bee colony algorithm (mABC) and global-best ABC (GABC) over the four QoS parameter response time, latency, availability and reliability. The authors found that the approach outperforms overall competitive approaches. To satisfy all objective simultaneously, the authors would like to extend this approach in the frame of multi-objective WSS optimization problem. Further, this is declared that this paper is not submitted to any other journal or under review.\\n\",\"PeriodicalId\":210948,\"journal\":{\"name\":\"Int. J. Pervasive Comput. Commun.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Pervasive Comput. Commun.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1108/ijpcc-08-2020-0101\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Pervasive Comput. Commun.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1108/ijpcc-08-2020-0101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

目的利用一种高效的元启发式算法解决web服务选择问题。在保持服务质量(QoS)的同时,从大规模服务环境(web服务存储库)中选择一组web服务的问题称为web服务选择(WSS)。随着internet服务的爆炸式增长,管理和选择合适的服务(或者说是web服务)已经成为一个相关的研究问题。为了解决WSS问题,作者提出了一种新的改进的果蝇优化方法,即基于正交阵列的学习果蝇优化器(OL-FOA)。在OL-FOA中,他们采用混沌映射来初始化种群;增加了自适应DE/best/2突变算子,提高了果蝇方法的探测能力;最后,为了提高搜索过程的效率(通过减少搜索空间),作者使用了正交学习机制。为了测试所提出方法的效率,从公共存储库中选择了包含2500个web服务的测试套件。为了确定该方法的竞争力,将其与其他四种元启发式方法(包括经典方法和最新方法)进行了比较,即果蝇优化(FOA)、差分进化(DE)、改进人工蜂群算法(mABC)和全局最优ABC (GABC)。实证结果表明,该方法在响应时间、延迟、可用性和可靠性方面都优于同类方法。在本文中,作者提出了一种基于群体的基于QoS感知的web服务选择(WSS)的新方法(OL-FOA)。为了验证结果,作者比较了其他四种元启发式方法(包括经典方法和最先进的方法),即果蝇优化(FOA)、差分进化(DE)、改进人工蜂群算法(mABC)和全局最佳ABC (GABC)在四个QoS参数响应时间、延迟、可用性和可靠性方面的影响。作者发现,这种方法优于整体竞争方法。为了同时满足所有目标,作者将该方法扩展到多目标WSS优化问题的框架中。此外,声明此论文未提交给任何其他期刊或正在审查中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
QoS aware web service selection using orthogonal array learning on fruit fly optimization approach
Purpose This paper aims to solve the web service selection problem using an efficient meta-heuristic algorithm. The problem of selecting a set of web services from a large-scale service environment (web service repository) while maintaining Quality-of-Service (QoS), is referred to as web service selection (WSS). With the explosive growth of internet services, managing and selecting the proper services (or say web service) has become a pertinent research issue. Design/methodology/approach In this paper, to address WSS problem, the authors propose a new modified fruit fly optimization approach, called orthogonal array-based learning in fruit fly optimizer (OL-FOA). In OL-FOA, they adopt a chaotic map to initialize the population; they add the adaptive DE/best/2mutation operator to improve the exploration capability of the fruit fly approach; and finally, to improve the efficiency of the search process (by reducing the search space), the authors use the orthogonal learning mechanism. Findings To test the efficiency of the proposed approach, a test suite of 2500 web services is chosen from the public repository. To establish the competitiveness of the proposed approach, it compared against four other meta-heuristic approaches (including classical as well as state-of-the-art), namely, fruit fly optimization (FOA), differential evolution (DE), modified artificial bee colony algorithm (mABC) and global-best ABC (GABC). The empirical results show that the proposed approach outperforms its counterparts in terms of response time, latency, availability and reliability. Originality/value In this paper, the authors have developed a population-based novel approach (OL-FOA) for the QoS aware web services selection (WSS). To justify the results, the authors compared against four other meta-heuristic approaches (including classical as well as state-of-the-art), namely, fruit fly optimization (FOA), differential evolution (DE), modified artificial bee colony algorithm (mABC) and global-best ABC (GABC) over the four QoS parameter response time, latency, availability and reliability. The authors found that the approach outperforms overall competitive approaches. To satisfy all objective simultaneously, the authors would like to extend this approach in the frame of multi-objective WSS optimization problem. Further, this is declared that this paper is not submitted to any other journal or under review.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信