基于人工蜂群算法的服务网络定制优化方法

Shaopeng Wang, Zhongjie Wang, Xiaofei Xu
{"title":"基于人工蜂群算法的服务网络定制优化方法","authors":"Shaopeng Wang, Zhongjie Wang, Xiaofei Xu","doi":"10.1109/ICSS.2013.9","DOIUrl":null,"url":null,"abstract":"This paper presents an artificial bee colony (ABC) algorithm based method for customizing an existing service network (SN). Service network is a complex network composed of a set of service components and the input-output relationships between them, and it has the powerful capacity of being customized to fulfill different personalized customer requirements. There might be multiple customized solutions in terms of one requirement, and different solution has varied usage cost, therefore to find the optimal one with minimal cost is necessary. Because it is a NP-hard problem, we propose an optimization method based on ABC algorithm, where a food source represents one solution (a sub network), and the optimization goal is to minimize the cost under the constraints of total response time and reliability raised by the customer. The optimal solution is found based on the group intelligence of bees. Experiment results demonstrate the ABC algorithm can quickly find the optimal customized solution.","PeriodicalId":213782,"journal":{"name":"2013 International Conference on Service Sciences (ICSS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"An Artificial Bee Colony Algorithm Based Optimization Method for Service Network Customization\",\"authors\":\"Shaopeng Wang, Zhongjie Wang, Xiaofei Xu\",\"doi\":\"10.1109/ICSS.2013.9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an artificial bee colony (ABC) algorithm based method for customizing an existing service network (SN). Service network is a complex network composed of a set of service components and the input-output relationships between them, and it has the powerful capacity of being customized to fulfill different personalized customer requirements. There might be multiple customized solutions in terms of one requirement, and different solution has varied usage cost, therefore to find the optimal one with minimal cost is necessary. Because it is a NP-hard problem, we propose an optimization method based on ABC algorithm, where a food source represents one solution (a sub network), and the optimization goal is to minimize the cost under the constraints of total response time and reliability raised by the customer. The optimal solution is found based on the group intelligence of bees. Experiment results demonstrate the ABC algorithm can quickly find the optimal customized solution.\",\"PeriodicalId\":213782,\"journal\":{\"name\":\"2013 International Conference on Service Sciences (ICSS)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Service Sciences (ICSS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSS.2013.9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Service Sciences (ICSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSS.2013.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

提出了一种基于人工蜂群(ABC)算法的现有服务网络自定义方法。服务网络是由一组服务组件及其之间的投入产出关系组成的复杂网络,具有强大的定制能力,可以满足客户不同的个性化需求。针对一个需求可能会有多个定制的解决方案,不同的解决方案的使用成本也不同,因此需要以最小的成本找到最优的解决方案。由于这是一个np困难问题,我们提出了一种基于ABC算法的优化方法,其中一个食物源代表一个解决方案(一个子网),优化目标是在客户提出的总响应时间和可靠性约束下使成本最小化。根据蜜蜂的群体智能找到最优解。实验结果表明,ABC算法可以快速找到最优定制解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Artificial Bee Colony Algorithm Based Optimization Method for Service Network Customization
This paper presents an artificial bee colony (ABC) algorithm based method for customizing an existing service network (SN). Service network is a complex network composed of a set of service components and the input-output relationships between them, and it has the powerful capacity of being customized to fulfill different personalized customer requirements. There might be multiple customized solutions in terms of one requirement, and different solution has varied usage cost, therefore to find the optimal one with minimal cost is necessary. Because it is a NP-hard problem, we propose an optimization method based on ABC algorithm, where a food source represents one solution (a sub network), and the optimization goal is to minimize the cost under the constraints of total response time and reliability raised by the customer. The optimal solution is found based on the group intelligence of bees. Experiment results demonstrate the ABC algorithm can quickly find the optimal customized solution.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信