%0 Journal Article
%T 时空众包中多目标优化任务分配<br>Multi-Objective Task Assignment in Spatio-Temporal Crowdsourcing
%A 吴胜男
%J Computer Science and Application
%P 549-560
%@ 2161-881X
%D 2021
%I Hans Publishing
%R 10.12677/CSA.2021.113056
%X <div style=\"text-align:justify;\">
	<span style=\"font-size:14px;\">随着移动网络的快速发展以及配备各种内部传感器的移动设备的普及，时空众包已成为解决基于位置的传感任务的新兴范例。在现有研究中，时空众包系统主要最大化平台效用。为了最大化社会福利，本文提出了一种多目标优化任务分配(MOO-TA)模型，以最大化平台和众包工人的效用，激励众包工人执行偏远地区任务，扩大数据覆盖率。本文提出一种组合算法LWS_NSGA_II，结合传统的线性加权求和(LWS)算法和带精英策略的快速非支配排序遗传算法(NSGA_II)算法，以搜索针对多目标优化任务分配问题的所有可选择的帕累托最优解供平台选择。通过在真实数据集上进行比较实验，评估了该方法的有效性和可行性。<br />
With the rapid development of mobile networks and the popularity of mobile devices equipped with various internal sensors, spatio-temporal crowdsourcing has become an emerging paradigm for solving location-based sensing tasks. In the existing research, the spatio-temporal crowdsourcing system mainly maximizes the utility of the platform. In order to maximize social welfare, this paper proposes the Multi-Objective Optimization Task Assignment (MOO-TA) model to maximize the utility of the platform and crowds workers. It encourages crowds workers to perform crowds tasks in remote areas, and expands data coverage. In this paper, the combination algorithm LWS_NSGA_II is proposed, which combines the traditional linear weighted Summation (LWS) algorithm and the Fast Non-dominated Sorting Genetic Algorithm (NSGA_II) algorithm to search for all selectable Pareto optimal solutions for multi-objective optimization task assignment problems for system selection. Through comparison experiments on real data sets, the effectiveness and feasibility of the proposed method are evaluated.</span> 
</div>
%K 时空众包，任务分配，多目标优化，帕累托最优解<br>Spatio-Temporal Crowdsourcing
%K Task Assignment
%K Multi-Objective Optimization
%K Pareto Optimal Solutions
%U http://www.hanspub.org/journal/PaperInformation.aspx?PaperID=41006