An Improved NSGA-II for Service Provider Composition in Knowledge-Intensive Crowdsourcing

Shixin Xie, Xu Wang, Biyu Yang, Shihong Wang
{"title":"An Improved NSGA-II for Service Provider Composition in Knowledge-Intensive Crowdsourcing","authors":"Shixin Xie, Xu Wang, Biyu Yang, Shihong Wang","doi":"10.1109/iiai-aai53430.2021.00144","DOIUrl":null,"url":null,"abstract":"As crowdsourcing attracts more and more attention, knowledge-intensive crowdsourcing (KI-C) is becoming a domain with great potential. Consumers submit complicated and personalized tasks in KI-C, expecting the tasks to be completed according to their requirements. This paper studied the service provider composition (SPC) in order to accomplish complicated tasks proposed by consumers. A mathematical optimization model based on SPC is formulated, aiming to maximize the platform operator income and customer satisfaction. For this model, a hybrid algorithm combining the non-dominated sorting genetic algorithm (NSGA-II) and simulated annealing algorithm (SA) is proposed for solving it. The practicability and validity of the model and algorithm are tested by an example.","PeriodicalId":414070,"journal":{"name":"2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iiai-aai53430.2021.00144","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

As crowdsourcing attracts more and more attention, knowledge-intensive crowdsourcing (KI-C) is becoming a domain with great potential. Consumers submit complicated and personalized tasks in KI-C, expecting the tasks to be completed according to their requirements. This paper studied the service provider composition (SPC) in order to accomplish complicated tasks proposed by consumers. A mathematical optimization model based on SPC is formulated, aiming to maximize the platform operator income and customer satisfaction. For this model, a hybrid algorithm combining the non-dominated sorting genetic algorithm (NSGA-II) and simulated annealing algorithm (SA) is proposed for solving it. The practicability and validity of the model and algorithm are tested by an example.
知识密集型众包中服务提供商构成的改进NSGA-II
随着众包受到越来越多的关注,知识密集型众包正成为一个极具潜力的领域。消费者在KI-C中提交复杂、个性化的任务,期望任务能够按照自己的要求完成。为了完成用户提出的复杂任务,本文研究了服务提供商组合(SPC)。建立了基于SPC的数学优化模型,以平台运营商收益最大化和客户满意度最大化为目标。针对该模型,提出了一种结合非支配排序遗传算法(NSGA-II)和模拟退火算法(SA)的混合算法来求解该模型。通过算例验证了该模型和算法的实用性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信