Method for Spatial Crowdsourcing Task Assignment Based on Integrating of Genetic Algorithm and Ant Colony Optimization

21Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

With the rapid development of mobile networks and the proliferation of mobile devices, Spatial Crowdsourcing (SC) has attracted the interest of industry and research groups. In addition to considering the specific spatial constraints in the existing research spatial crowdsourcing, each task has an effective duration, operational complexity, number of workers required, and incentive budget constraints. In this scenario, we studied the MQC-TA (Maximum Quality and Minimum Cost Task Assignment) problem. Firstly, the worker incentive model is established. The MQC-GAC algorithm is designed according to the MQC-TA problem to maximize the task completion quality and minimize the incentive budget. The algorithm combined the fast convergence of Genetic Algorithm and the positive feedback mechanism of Ant Colony Optimization Algorithm. Finally, the effectiveness and efficiency of the proposed method are verified by a comprehensive experiment on the data set.

Cite

CITATION STYLE

APA

Wang, Y., Zhao, C., & Xu, S. (2020). Method for Spatial Crowdsourcing Task Assignment Based on Integrating of Genetic Algorithm and Ant Colony Optimization. IEEE Access, 8, 68311–68319. https://doi.org/10.1109/ACCESS.2020.2983744

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free