社交物联网系统中协同移动众包招聘的进化算法

Aymen Hamrouni, Hakim Ghazzai, Turki Alelyani, Y. Massoud
{"title":"社交物联网系统中协同移动众包招聘的进化算法","authors":"Aymen Hamrouni, Hakim Ghazzai, Turki Alelyani, Y. Massoud","doi":"10.1109/GCAIoT51063.2020.9345852","DOIUrl":null,"url":null,"abstract":"Mobile crowd sourcing (MCS) enables a distributed problem-solving model in which a crowd of smart devices' users is engaged in the task of solving a data sensing problem through an open call. With the increasing complexity of tasks that are crowdsourced and the need of collaboration among workers, collaborative MCS (CMCS) has emerged to enable requesters to form teams of skilled IoT workers and promote their ability to cooperate together. To efficiently execute such tasks, optimizing the team recruitment process must be conducted. In this paper, we design a low complexity CMCS team recruitment approach that forms and hires a group of socially connected workers having sufficient skills to accomplish a CMCS task. Inspired from swam intelligence, the proposed recruitment approach enables project matching and virtual team formation according to four different fuzzy-logic-based criteria: level of expertise, social relationship strength, recruitment cost, and platform's confidence level. Applied to a real-world data set, experimental results illustrate the performances of the proposed genetic algorithm for CMCS recruitment and show that our approach outperforms the metaheuristic particle swarm optimization algorithm. Moreover, it is shown that the proposed approach achieves close performance to those of the baseline optimal integer linear program with significant computational saving.","PeriodicalId":398815,"journal":{"name":"2020 IEEE Global Conference on Artificial Intelligence and Internet of Things (GCAIoT)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"An Evolutionary Algorithm for Collaborative Mobile Crowdsourcing Recruitment in Socially Connected IoT Systems\",\"authors\":\"Aymen Hamrouni, Hakim Ghazzai, Turki Alelyani, Y. Massoud\",\"doi\":\"10.1109/GCAIoT51063.2020.9345852\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mobile crowd sourcing (MCS) enables a distributed problem-solving model in which a crowd of smart devices' users is engaged in the task of solving a data sensing problem through an open call. With the increasing complexity of tasks that are crowdsourced and the need of collaboration among workers, collaborative MCS (CMCS) has emerged to enable requesters to form teams of skilled IoT workers and promote their ability to cooperate together. To efficiently execute such tasks, optimizing the team recruitment process must be conducted. In this paper, we design a low complexity CMCS team recruitment approach that forms and hires a group of socially connected workers having sufficient skills to accomplish a CMCS task. Inspired from swam intelligence, the proposed recruitment approach enables project matching and virtual team formation according to four different fuzzy-logic-based criteria: level of expertise, social relationship strength, recruitment cost, and platform's confidence level. Applied to a real-world data set, experimental results illustrate the performances of the proposed genetic algorithm for CMCS recruitment and show that our approach outperforms the metaheuristic particle swarm optimization algorithm. Moreover, it is shown that the proposed approach achieves close performance to those of the baseline optimal integer linear program with significant computational saving.\",\"PeriodicalId\":398815,\"journal\":{\"name\":\"2020 IEEE Global Conference on Artificial Intelligence and Internet of Things (GCAIoT)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE Global Conference on Artificial Intelligence and Internet of Things (GCAIoT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GCAIoT51063.2020.9345852\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Global Conference on Artificial Intelligence and Internet of Things (GCAIoT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCAIoT51063.2020.9345852","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

移动众包(MCS)实现了一种分布式问题解决模型,在这种模型中,一群智能设备的用户通过公开呼叫参与解决数据感知问题的任务。随着众包任务的日益复杂以及工作人员之间协作的需求,协作MCS (CMCS)已经出现,使请求者能够组建熟练的物联网工作人员团队并提高他们共同合作的能力。为了有效地执行这些任务,必须对团队招聘流程进行优化。在本文中,我们设计了一种低复杂度的CMCS团队招聘方法,形成并雇用一组具有足够技能的社会联系工人来完成CMCS任务。受游泳智能的启发,提出的招聘方法可以根据四种不同的基于模糊逻辑的标准进行项目匹配和虚拟团队组建:专业水平、社会关系强度、招聘成本和平台信心水平。应用于实际数据集,实验结果证明了所提出的遗传算法在CMCS招募中的性能,并表明我们的方法优于元启发式粒子群优化算法。此外,该方法的性能接近基线最优整数线性规划,并且节省了大量的计算量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Evolutionary Algorithm for Collaborative Mobile Crowdsourcing Recruitment in Socially Connected IoT Systems
Mobile crowd sourcing (MCS) enables a distributed problem-solving model in which a crowd of smart devices' users is engaged in the task of solving a data sensing problem through an open call. With the increasing complexity of tasks that are crowdsourced and the need of collaboration among workers, collaborative MCS (CMCS) has emerged to enable requesters to form teams of skilled IoT workers and promote their ability to cooperate together. To efficiently execute such tasks, optimizing the team recruitment process must be conducted. In this paper, we design a low complexity CMCS team recruitment approach that forms and hires a group of socially connected workers having sufficient skills to accomplish a CMCS task. Inspired from swam intelligence, the proposed recruitment approach enables project matching and virtual team formation according to four different fuzzy-logic-based criteria: level of expertise, social relationship strength, recruitment cost, and platform's confidence level. Applied to a real-world data set, experimental results illustrate the performances of the proposed genetic algorithm for CMCS recruitment and show that our approach outperforms the metaheuristic particle swarm optimization algorithm. Moreover, it is shown that the proposed approach achieves close performance to those of the baseline optimal integer linear program with significant computational saving.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信