新员工参与的软件众包平台的多目标任务分配方案

IF 5.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Minglan Fu, Zhijie Zhang, ZouXi Wang, Debao Chen
{"title":"新员工参与的软件众包平台的多目标任务分配方案","authors":"Minglan Fu,&nbsp;Zhijie Zhang,&nbsp;ZouXi Wang,&nbsp;Debao Chen","doi":"10.1016/j.jksuci.2024.102237","DOIUrl":null,"url":null,"abstract":"<div><div>Software crowdsourcing has become a cornerstone of the Internet economy because of its unique capacity for selecting optimal workers to complete specific tasks. However, new workers face limited task opportunities compared to experienced workers, which negatively impacts their motivation and decreases overall activity on crowdsourcing platforms. This reduced activity can harm platform reputation. To encourage the active participation of new workers, this study introduces a novel method to identify and match worker–task preferences. Our approach categorizes preferred tasks based on golden tasks, historical data, and worker interests. We then present the Multi-Objective Worker–Task Recommendation (MOWTR) algorithm, built upon the Non-Dominated Sorting Genetic Algorithm II (NSGA-II). The MOWTR algorithm allocates tasks by considering worker preferences, salaries, and capabilities, aiming to optimize collective team performance while minimizing team costs, especially for new workers. New crossover and two-stage mutation operators are incorporated to increase algorithm efficiency. Experimental evaluations on four real and synthetic datasets demonstrate that MOWTR outperforms four advanced baseline methods, confirming its effectiveness.</div></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 10","pages":"Article 102237"},"PeriodicalIF":5.2000,"publicationDate":"2024-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The multi-objective task assignment scheme for software crowdsourcing platforms involving new workers\",\"authors\":\"Minglan Fu,&nbsp;Zhijie Zhang,&nbsp;ZouXi Wang,&nbsp;Debao Chen\",\"doi\":\"10.1016/j.jksuci.2024.102237\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Software crowdsourcing has become a cornerstone of the Internet economy because of its unique capacity for selecting optimal workers to complete specific tasks. However, new workers face limited task opportunities compared to experienced workers, which negatively impacts their motivation and decreases overall activity on crowdsourcing platforms. This reduced activity can harm platform reputation. To encourage the active participation of new workers, this study introduces a novel method to identify and match worker–task preferences. Our approach categorizes preferred tasks based on golden tasks, historical data, and worker interests. We then present the Multi-Objective Worker–Task Recommendation (MOWTR) algorithm, built upon the Non-Dominated Sorting Genetic Algorithm II (NSGA-II). The MOWTR algorithm allocates tasks by considering worker preferences, salaries, and capabilities, aiming to optimize collective team performance while minimizing team costs, especially for new workers. New crossover and two-stage mutation operators are incorporated to increase algorithm efficiency. Experimental evaluations on four real and synthetic datasets demonstrate that MOWTR outperforms four advanced baseline methods, confirming its effectiveness.</div></div>\",\"PeriodicalId\":48547,\"journal\":{\"name\":\"Journal of King Saud University-Computer and Information Sciences\",\"volume\":\"36 10\",\"pages\":\"Article 102237\"},\"PeriodicalIF\":5.2000,\"publicationDate\":\"2024-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of King Saud University-Computer and Information Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1319157824003264\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of King Saud University-Computer and Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1319157824003264","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

软件众包因其选择最佳工人完成特定任务的独特能力而成为互联网经济的基石。然而,与经验丰富的员工相比,新员工面临的任务机会有限,这对他们的积极性产生了负面影响,并降低了众包平台的整体活跃度。活跃度降低会损害平台声誉。为了鼓励新员工积极参与,本研究引入了一种新方法来识别和匹配员工的任务偏好。我们的方法根据黄金任务、历史数据和工人兴趣对首选任务进行分类。然后,我们在非支配排序遗传算法 II(NSGA-II)的基础上提出了多目标工人任务推荐(MOWTR)算法。MOWTR 算法通过考虑工人的偏好、工资和能力来分配任务,旨在优化团队集体绩效,同时最大限度地降低团队成本,尤其是新工人的成本。新的交叉和两阶段突变算子的加入提高了算法的效率。在四个真实和合成数据集上进行的实验评估表明,MOWTR 优于四种先进的基线方法,证实了它的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The multi-objective task assignment scheme for software crowdsourcing platforms involving new workers
Software crowdsourcing has become a cornerstone of the Internet economy because of its unique capacity for selecting optimal workers to complete specific tasks. However, new workers face limited task opportunities compared to experienced workers, which negatively impacts their motivation and decreases overall activity on crowdsourcing platforms. This reduced activity can harm platform reputation. To encourage the active participation of new workers, this study introduces a novel method to identify and match worker–task preferences. Our approach categorizes preferred tasks based on golden tasks, historical data, and worker interests. We then present the Multi-Objective Worker–Task Recommendation (MOWTR) algorithm, built upon the Non-Dominated Sorting Genetic Algorithm II (NSGA-II). The MOWTR algorithm allocates tasks by considering worker preferences, salaries, and capabilities, aiming to optimize collective team performance while minimizing team costs, especially for new workers. New crossover and two-stage mutation operators are incorporated to increase algorithm efficiency. Experimental evaluations on four real and synthetic datasets demonstrate that MOWTR outperforms four advanced baseline methods, confirming its effectiveness.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
10.50
自引率
8.70%
发文量
656
审稿时长
29 days
期刊介绍: In 2022 the Journal of King Saud University - Computer and Information Sciences will become an author paid open access journal. Authors who submit their manuscript after October 31st 2021 will be asked to pay an Article Processing Charge (APC) after acceptance of their paper to make their work immediately, permanently, and freely accessible to all. The Journal of King Saud University Computer and Information Sciences is a refereed, international journal that covers all aspects of both foundations of computer and its practical applications.
×
引用
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学术官方微信