{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,13]],"date-time":"2026-10-13T18:36:22Z","timestamp":1791916582783,"version":"4.3.4"},"reference-count":44,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T00:00:00Z","timestamp":1649894400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Mobile crowd-sensing (MCS) is a well-known paradigm used for obtaining sensed data by using sensors found in smart devices. With the rise of more sensing tasks and workers in the MCS system, it is now essential to design an efficient approach for task allocation. Moreover, to ensure the completion of the tasks, it is necessary to incentivise the workers by rewarding them for participating in performing the sensing tasks. In this paper, we aim to assist workers in selecting multiple tasks while considering the time constraint of the worker and the requirements of the task. Furthermore, a pricing mechanism is adopted to determine each task budget, which is then used to determine the payment for the workers based on their willingness factor. This paper proves that the task-allocation is a non-deterministic polynomial (NP)-complete problem, which is difficult to solve by conventional optimization techniques. A worker multitask allocation-genetic algorithm (WMTA-GA) is proposed to solve this problem to maximize the workers welfare. Finally, theoretical analysis demonstrates the effectiveness of the proposed WMTA-GA. We observed that it performs better than the state-of-the-art algorithms in terms of average performance, workers welfare, and the number of assigned tasks.<\/jats:p>","DOI":"10.3390\/s22083013","type":"journal-article","created":{"date-parts":[[2022,4,19]],"date-time":"2022-04-19T02:39:31Z","timestamp":1650335971000},"page":"3013","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Location and Time Aware Multitask Allocation in Mobile Crowd-Sensing Based on Genetic Algorithm"],"prefix":"10.3390","volume":"22","author":[{"given":"Aridegbe","family":"Ipaye","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhigang","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6423-9809","authenticated-orcid":false,"given":"Muhammad","family":"Asim","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9711-0235","authenticated-orcid":false,"given":"Samia","family":"Chelloug","sequence":"additional","affiliation":[{"name":"Department of Information Technology, College of Computer and Information Sciences, Princess Nourah bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lin","family":"Guo","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ali","family":"Ibrahim","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5068-2033","authenticated-orcid":false,"given":"Ahmed","family":"Abd El-Latif","sequence":"additional","affiliation":[{"name":"EIAS Data Science Lab, College of Computer and Information Sciences, Prince Sultan University, Riyadh 11586, Saudi Arabia"},{"name":"Department of Mathematics and Computer Science, Faculty of Science, Menoufia University, Shebin El-Koom 32511, Egypt"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2022,4,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"He, Z., Cao, J., and Liu, X. (May, January 26). High quality participant recruitment in vehicle-based crowdsourcing using predictable mobility. Proceedings of the 2015 IEEE Conference on Computer Communications (INFOCOM), Kowloon, Hong Kong.","DOI":"10.1109\/INFOCOM.2015.7218644"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Karaliopoulos, M., Telelis, O., and Koutsopoulos, I. (May, January 26). User recruitment for mobile crowdsensing over opportunistic networks. Proceedings of the 2015 IEEE Conference on Computer Communications (INFOCOM), Kowloon, Hong Kong.","DOI":"10.1109\/INFOCOM.2015.7218612"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1494","DOI":"10.1109\/TMC.2019.2962457","article-title":"Multi-Task Allocation Under Time Constraints in Mobile Crowdsensing","volume":"20","author":"Li","year":"2021","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_4","first-page":"100698","article-title":"Energy and Task Completion Time Minimization Algorithm for UAVs-Empowered MEC system","volume":"35","author":"Asim","year":"2022","journal-title":"Sustain. Comput. Inform. Syst."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Guo, J., Chen, X., Hao, J., Zhou, X., and Zheng, K. (2021, January 19\u201322). Coalition-based Task Assignment in Spatial Crowdsourcing. Proceedings of the 2021 IEEE 37th International Conference on Data Engineering (ICDE), Chania, Greece.","DOI":"10.1109\/ICDE51399.2021.00028"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1109\/TMC.2019.2898950","article-title":"HyTasker: Hybrid Task Allocation in Mobile Crowd Sensing","volume":"19","author":"Wang","year":"2020","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"2336","DOI":"10.1109\/TKDE.2019.2922604","article-title":"Destination-Aware Task Assignment in Spatial Crowdsourcing: A Worker Decomposition Approach","volume":"32","author":"Zhao","year":"2020","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"48010","DOI":"10.1109\/ACCESS.2018.2865095","article-title":"Data Quality Aware Task Allocation with Budget Constraint in Mobile Crowdsensing","volume":"6","author":"Wei","year":"2018","journal-title":"IEEE Access"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.future.2020.02.045","article-title":"A Stackelberg game approach to multiple resources allocation and pricing in mobile edge computing","volume":"108","author":"Chen","year":"2020","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Dai, M., Su, Z., Wang, Y., and Xu, Q. (2018, January 20\u201322). Contract Theory Based Incentive Scheme for Mobile Crowd Sensing Networks. Proceedings of the 2018 International Conference on Selected Topics in Mobile and Wireless Networking (MoWNeT), Tangier, Morocco.","DOI":"10.1109\/MoWNet.2018.8428903"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Singla, A., and Krause, A. (2013). Truthful Incentives in Crowdsourcing Tasks Using Regret Minimization Mechanisms, Association for Computing Machinery.","DOI":"10.1145\/2488388.2488490"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"3831","DOI":"10.1109\/TVT.2021.3065688","article-title":"Coverage-Aware Stable Task Assignment in Opportunistic Mobile Crowdsensing","volume":"70","author":"Yucel","year":"2021","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Yucel, F., and Bulut, E. (2020). Location-Dependent Task Assignment for Opportunistic Mobile Crowdsensing, IEEE Press.","DOI":"10.1109\/CCNC46108.2020.9045210"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"65384","DOI":"10.1109\/ACCESS.2018.2878761","article-title":"MAIM: A Novel Incentive Mechanism Based on Multi-Attribute User Selection in Mobile Crowdsensing","volume":"6","author":"Xiong","year":"2018","journal-title":"IEEE Access"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Liu, W., Yang, Y., Wang, E., and Wu, J. (2020, January 6\u20139). Dynamic User Recruitment with Truthful Pricing for Mobile CrowdSensing. Proceedings of the IEEE INFOCOM 2020\u2014IEEE Conference on Computer Communications, Toronto, ON, Canada.","DOI":"10.1109\/INFOCOM41043.2020.9155242"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2476","DOI":"10.1109\/TII.2021.3094527","article-title":"OPAT: Optimized Allocation of Time-Dependent Tasks for Mobile Crowdsensing","volume":"18","author":"Huang","year":"2022","journal-title":"IEEE Trans. Ind. Inform."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.comnet.2017.12.010","article-title":"Heterogeneous Incentive Mechanism for Time-sensitive and Location-dependent Crowdsensing Networks with Random Arrivals","volume":"131","author":"Wang","year":"2017","journal-title":"Comput. Netw."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"49920","DOI":"10.1109\/ACCESS.2020.2980143","article-title":"DaTask: A Decomposition-Based Deadline-Aware Task Assignment and Workers\u2019 Path-Planning in Mobile Crowd-Sensing","volume":"8","author":"Akter","year":"2020","journal-title":"IEEE Access"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"2761","DOI":"10.1109\/TMC.2018.2815694","article-title":"Delay-Sensitive Mobile Crowdsensing: Algorithm Design and Economics","volume":"17","author":"Cheung","year":"2018","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Liu, W., Yang, Y., Wang, E., Han, Z., and Wang, X. (2017, January 12\u201314). Prediction Based User Selection in Time-Sensitive Mobile Crowdsensing. Proceedings of the 2017 14th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON), San Diego, CA, USA.","DOI":"10.1109\/SAHCN.2017.7964935"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"2219","DOI":"10.1109\/TVT.2019.2962064","article-title":"MB-GVNS: Memetic Based Bidirectional General Variable Neighborhood Search for Time-Sensitive Task Allocation in Mobile Crowd Sensing","volume":"69","author":"Wang","year":"2020","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1109\/THMS.2016.2599489","article-title":"ActiveCrowd: A Framework for Optimized Multitask Allocation in Mobile Crowdsensing Systems","volume":"47","author":"Guo","year":"2017","journal-title":"IEEE Trans. Hum.-Mach. Syst."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Yang, S., Qi, X., Wu, F., Gao, X., and Chen, G. (2017, January 4\u20136). Bandit User Selection Algorithm for Budgeted and Time-Limited Mobile Crowdsensing. Proceedings of the GLOBECOM 2017\u20132017 IEEE Global Communications Conference, Singapore.","DOI":"10.1109\/GLOCOM.2017.8254592"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"2080","DOI":"10.1109\/TMC.2020.2973990","article-title":"Towards Personalized Task-Oriented Worker Recruitment in Mobile Crowdsensing","volume":"20","author":"Wang","year":"2021","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Yucel, F., and Bulut, E. (2020, January 16\u201319). Time-dependent Stable Task Assignment in Participatory Mobile Crowdsensing. Proceedings of the 2020 IEEE 45th Conference on Local Computer Networks (LCN), Sydney, Australia.","DOI":"10.1109\/LCN48667.2020.9314829"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"2172","DOI":"10.1109\/TMC.2020.2975569","article-title":"Distributed Time-Sensitive Task Selection in Mobile Crowdsensing","volume":"20","author":"Cheung","year":"2021","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Korto\u00e7i, P., Mehrabi, A., Joe-Wong, C., and Di Francesco, M. (2021, January 6\u20139). Incentivizing Opportunistic Data Collection for Time-Sensitive IoT Applications. Proceedings of the 2021 18th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON), Rome, Italy.","DOI":"10.1109\/SECON52354.2021.9491593"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"10628","DOI":"10.1109\/ACCESS.2020.2965734","article-title":"Participant Service Quality Aware Data Collecting Mechanism with High Coverage for Mobile Crowdsensing","volume":"8","author":"Yang","year":"2020","journal-title":"IEEE Access"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"157270","DOI":"10.1109\/ACCESS.2020.3019537","article-title":"Optimal Data Collection for Mobile Crowdsensing over Integrated Cellular and Opportunistic Networks","volume":"8","author":"Majeed","year":"2020","journal-title":"IEEE Access"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"95808","DOI":"10.1109\/ACCESS.2021.3094528","article-title":"Time-Constrained Task Allocation and Worker Routing in Mobile Crowd-Sensing Using a Decomposition Technique and Deep Q-Learning","volume":"9","author":"Akter","year":"2021","journal-title":"IEEE Access"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1007\/s11390-017-1773-4","article-title":"FIMI: A Constant Frugal Incentive Mechanism for Time Window Coverage in Mobile Crowdsensing","volume":"32","author":"Xu","year":"2017","journal-title":"J. Comput. Sci. Technol."},{"key":"ref_32","first-page":"1","article-title":"A Novel User Selection Strategy with Incentive Mechanism Based on Time Window in Mobile Crowdsensing","volume":"2020","author":"Sun","year":"2020","journal-title":"Discret. Dyn. Nat. Soc."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"2589","DOI":"10.1109\/TMC.2018.2877459","article-title":"Online Quality-Aware Incentive Mechanism for Mobile Crowd Sensing with Extra Bonus","volume":"18","author":"Gao","year":"2019","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1109\/TCSS.2019.2907059","article-title":"An Optimization and Auction-Based Incentive Mechanism to Maximize Social Welfare for Mobile Crowdsourcing","volume":"6","author":"Wang","year":"2019","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"10053","DOI":"10.1109\/JIOT.2019.2935145","article-title":"Pay as How You Behave: A Truthful Incentive Mechanism for Mobile Crowdsensing","volume":"6","author":"Xu","year":"2019","journal-title":"IEEE Internet Things J."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Yang, S., Jiang, W., Duan, J., Huang, Z., and Lu, J. (2020). Max-Min Fairness Multi-task Allocation in Mobile Crowdsensing. Machine Learning for Cyber Security, Springer International Publishing.","DOI":"10.1007\/978-3-030-62460-6_15"},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Liu, H., Jiang, W., Yang, S., Lu, J., and Ning, D. (2020). Multi-term Multi-task Allocation for Mobile Crowdsensing with Weighted Max-Min Fairness. Machine Learning for Cyber Security, Springer International Publishing.","DOI":"10.1007\/978-3-030-62460-6_35"},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Wang, Z., Zhu, J., and Li, D. (2019). Prediction Based Reverse Auction Incentive Mechanism for Mobile Crowdsensing System. Combinatorial Optimization and Applications, Springer.","DOI":"10.1007\/978-3-030-36412-0_44"},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Wang, Z., Hu, J., Zhao, J., Yang, D., Chen, H., and Wang, Q. (2018, January 2\u20135). Pay On-Demand: Dynamic Incentive and Task Selection for Location-Dependent Mobile Crowdsensing Systems. Proceedings of the 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS), Vienna, Austria.","DOI":"10.1109\/ICDCS.2018.00066"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1137\/0203026","article-title":"Erratum: Genetic Algorithms and the Optimal Allocation of Trials","volume":"3","author":"Holland","year":"1974","journal-title":"SIAM J. Comput."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1109\/TETCI.2020.3007905","article-title":"A Review on Computational Intelligence Techniques in Cloud and Edge Computing","volume":"4","author":"Asim","year":"2020","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"125569","DOI":"10.1109\/ACCESS.2021.3111318","article-title":"A Novel Genetic Trajectory Planning Algorithm with Variable Population Size for Multi-UAV-Assisted Mobile Edge Computing System","volume":"9","author":"Asim","year":"2021","journal-title":"IEEE Access"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Asim, M., Mashwani, W.K., Habib, S., and Belhaouari, S.B. (2021). An evolutionary trajectory planning algorithm for multi-UAV-assisted MEC system. Soft Comput.","DOI":"10.21203\/rs.3.rs-794751\/v1"},{"key":"ref_44","unstructured":"Asim, M., and Abd El-Latif, A.A. (2021). Intelligent computational methods for multi-unmanned aerial vehicle-enabled autonomous mobile edge computing systems. ISA Trans."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/8\/3013\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:54:15Z","timestamp":1760136855000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/8\/3013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,14]]},"references-count":44,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2022,4]]}},"alternative-id":["s22083013"],"URL":"https:\/\/doi.org\/10.3390\/s22083013","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,14]]}}}