• •    

DPCS2017+33+空间众包中多类型任务的分配与调度方法研究

毛莺池1,穆超2,包威1,李晓芳3   

  1. 1. 河海大学
    2. 河海大学计算机与信息学院
    3. 常州工学院 计算机信息工程学院,江苏 常州 213032
  • 收稿日期:2017-08-01 修回日期:2017-08-21 发布日期:2017-08-21
  • 通讯作者: 毛莺池

Spatial Crowdsourcing Oriented Multi-Type Task Assigment and Dispatch Scheme

  • Received:2017-08-01 Revised:2017-08-21 Online:2017-08-21
  • Contact: Yingchi Mao

摘要: 摘 要: 针对空间众包多类型任务完成的质量与数量问题,提出多类型任务的分配与调度方法。针对任务分配,结合空间众包中多类型任务和用户的特点,在贪婪分配算法进行改进,提出基于距离 值分配算法(Distance based Assignment, -DA),将任务分配给附近的用户,以提高任务完成质量;然后利用分支定界思想,根据专业匹配分数的大小,对任务序列进行调度,最后找到最佳的任务序列。由于分支定界思想的调度算法运行速度较慢,提出最有前途分支启发式算法(Most Promising Branch Heuristic, MPBH)。该算法利用局部最优,使用户在截止时间前完成最多的任务。实验证明,本文提出的任务分配和调度方法,能够提高任务完成的质量以及数量,并且在运行速度和精确性方面具有优势。

关键词: 空间众包, 任务分配, 任务调度, 分支定界, 局部最优

Abstract: Abstract: In order to solve the problem of the quality and quantity of multi type tasks in te spatial crowdsourcing, a method of multiple task assignment and scheduling was proposed. For multiple types of tasks, in the phase of task assignment, according to the temporal characteristics of spatial tasks, considering the character of tasks and workers, tasks are assigned based on -DA algorithm (Distance Based Assignment, -DA). -DA algorithm assigns tasks to proper workers to improve the the quality of task completed. To further improve the quality of the tasks dispatch, adopting the idea of branch and bound, the tasks sequences are scheduled to find the best one based on the professional matching scores. Due to the low speed of the branch and bound, Most Promising Branch Heuristic, MPBH, was put forward to utilize local optimizations that allows the user to complete the most tasks before the deadline. The experimental results illustrate that the proposed tasks assignment and dispatch can improve the quality and quantity of task completion and exhibit the advantages of speed and accuracy in the spatial crowdsourcing.

Key words: Keywords: Spatial crowdsourcing, tasks assignment, tasks dispatch, branch and bound, local optimizations