用于选择语义Web服务组合中最优或接近最优解决方案的混合遗传算法

C. Pop, V. Chifu, I. Salomie, A. Negrean, Horatiu Jeflea
{"title":"用于选择语义Web服务组合中最优或接近最优解决方案的混合遗传算法","authors":"C. Pop, V. Chifu, I. Salomie, A. Negrean, Horatiu Jeflea","doi":"10.1109/ICCP.2012.6356161","DOIUrl":null,"url":null,"abstract":"This paper presents a hybrid bio-inspired algorithm that selects the optimal or a near-optimal solution in semantic Web service composition. The proposed algorithm combines principles from evolutionary computing, tabu search and monkey search to optimize the selection process in terms of execution time and explored search space. In our approach, the search space is modeled as an Enhanced Planning Graph structure which encodes all the possible composition solutions for a given user request. To establish whether a solution is optimal, the QoS attributes of the services involved in the composition as well as the semantic similarity between them are considered as evaluation criteria. The proposed selection algorithm has been integrated in an experimental framework and a set of experiments has been carried out on different Enhanced Planning Graph topologies. The performance evaluation of the proposed algorithm has been done using the fitness graph and population diversity evolutionary measures.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Hybrid genetic algorithm for selecting the optimal or near-optimal solution in semantic Web service composition\",\"authors\":\"C. Pop, V. Chifu, I. Salomie, A. Negrean, Horatiu Jeflea\",\"doi\":\"10.1109/ICCP.2012.6356161\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a hybrid bio-inspired algorithm that selects the optimal or a near-optimal solution in semantic Web service composition. The proposed algorithm combines principles from evolutionary computing, tabu search and monkey search to optimize the selection process in terms of execution time and explored search space. In our approach, the search space is modeled as an Enhanced Planning Graph structure which encodes all the possible composition solutions for a given user request. To establish whether a solution is optimal, the QoS attributes of the services involved in the composition as well as the semantic similarity between them are considered as evaluation criteria. The proposed selection algorithm has been integrated in an experimental framework and a set of experiments has been carried out on different Enhanced Planning Graph topologies. The performance evaluation of the proposed algorithm has been done using the fitness graph and population diversity evolutionary measures.\",\"PeriodicalId\":406461,\"journal\":{\"name\":\"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCP.2012.6356161\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCP.2012.6356161","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文提出了一种混合生物算法,用于选择语义Web服务组合的最优或接近最优解决方案。该算法结合了进化计算、禁忌搜索和猴子搜索的原理,从执行时间和搜索空间上优化了选择过程。在我们的方法中,搜索空间被建模为一个增强的规划图结构,该结构对给定用户请求的所有可能的组合解决方案进行编码。为了确定解决方案是否最优,将组合中涉及的服务的QoS属性以及它们之间的语义相似度作为评估标准。将所提出的选择算法集成到实验框架中,并在不同的增强规划图拓扑上进行了一系列实验。利用适应度图和种群多样性进化指标对算法进行了性能评价。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hybrid genetic algorithm for selecting the optimal or near-optimal solution in semantic Web service composition
This paper presents a hybrid bio-inspired algorithm that selects the optimal or a near-optimal solution in semantic Web service composition. The proposed algorithm combines principles from evolutionary computing, tabu search and monkey search to optimize the selection process in terms of execution time and explored search space. In our approach, the search space is modeled as an Enhanced Planning Graph structure which encodes all the possible composition solutions for a given user request. To establish whether a solution is optimal, the QoS attributes of the services involved in the composition as well as the semantic similarity between them are considered as evaluation criteria. The proposed selection algorithm has been integrated in an experimental framework and a set of experiments has been carried out on different Enhanced Planning Graph topologies. The performance evaluation of the proposed algorithm has been done using the fitness graph and population diversity evolutionary measures.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信