GRASP-Tabu Search Algorithms for the Route Planning Problem in Spatial Crowdsourcing

With the speedy progress of mobile devices, a lot of commercial enterprises have exploited crowdsourcing as a useful approach to gather information to develop their services. Thus, spatial crowdsourcing has appeared as a new platform in e-commerce and which implies procedures of requesters and workers. A requester submits spatial tasks request to the workers who choose and achieve them during a limited time. Thereafter, the requester pays only the worker for the well-accomplished task. In spatial crowdsourcing, each worker is required to physically move to the place to accomplish the spatial task, and each task is linked with location and time. The objective of this article is to find an optimal route to the worker through maximizing her rewards with respecting some constraint, using an approach based on GRASP with Tabu. The proposed algorithm is used in the literature for benchmark instances. Computational results indicate that the proposed and the developed algorithm is competitive with other solution approaches.