Online delivery route recommendation in spatial crowdsourcing

Abstract

With the emergence of many crowdsourcing platforms, crowdsourcing has gained much attention. Spatial crowdsourcing is a rapidly developing extension of the traditional crowdsourcing, and its goal is to organize workers to perform spatial tasks. Route recommendation is an important concern in spatial crowdsourcing. In this paper, we define a novel problem called the Online Delivery Route Recommendation (OnlineDRR) problem, in which the income of a single worker is maximized under online scenarios. It is proved that no deterministic online algorithm for this problem has a constant competitive ratio. We propose an algorithm to balance three influence factors on a worker’s choice in terms of which task to undertake next. In order to overcome its drawbacks resulting from the dynamic nature of tasks, we devise an extended version which attaches gradually increased importance to the destination of the worker over time. Extensive experiments are conducted on both synthetic and real-world datasets and the results prove the algorithms proposed in this paper are effective and efficient.