Friendship-aware task planning in mobile crowdsourcing

摘要: Recently, crowdsourcing platforms have attracted a number of citizens to perform variety location-specific tasks. However, most existing approaches consider the arrangement set tasks for crowd workers, while few workers arriving in dynamic manner. Therefore, how arrange suitable such that obtain maximum satisfaction when sequentially represents challenge. To address limitation approaches, we first identify more general and useful model considers not only but also all arrivals workers. Then, present an effective crowd-task which is applied offline online settings, respectively. solve problem setting, observe characteristics task planning (CTP) devise CTP algorithm problem. We propose greedy method integrated simulated annealing (ISA) techniques improve performance. develop planning. Finally, verify effectiveness efficiency proposed solutions through extensive experiments using real synthetic datasets.