No abstract

No abstract

No abstract

No abstract

No abstract

Spatial mobile crowdsourcing (SMCS) enables a task requester to commission workers to physically travel to specific locations to perform a set of spatial assignments (i.e., tasks are related to a specific geographical location besides time). To efficiently perform such tasks and guarantee the best possible quality of returned results, optimizing the worker recruitment and task assignment processes must be conducted. Because both workers and task requesters impose certain criteria, this procedure is not obvious. To tackle this issue, we propose a novel formulation of the SMCS recruitment where task matching and worker scheduling are jointly optimized. A Mixed Integer Linear Program (MILP) is first developed to optimally maximize the quality of matching measured as a weighted score function of different recruitment metrics while determining the trajectory of each selected worker executing tasks. To cope with NP-hardness, we propose a heuristic SMCS recruitment approach allowing the achievement of sub-optimal matching and recruitment solution by iteratively solving a weighted bipartite graph problem. Simulation results illustrate the performance of the SMCS framework for selected scenarios and show that our proposed SMCS recruitment algorithm outperforms an existing greedy recruitment approach. Moreover, compared to the optimal MILP solution, the proposed SMCS recruitment approach achieves close results with significant computational time saving.

No abstract

No abstract