{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T08:15:19Z","timestamp":1771661719217,"version":"3.50.1"},"reference-count":36,"publisher":"Zhejiang University Press","issue":"7","license":[{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front Inform Technol Electron Eng"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1631\/fitee.2500035","type":"journal-article","created":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T00:00:07Z","timestamp":1751673607000},"page":"1144-1163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Spatial crowdsourcing task allocation for heterogeneous multi-task hybrid scenarios: a model-embedded role division approach"],"prefix":"10.1631","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7004-8868","authenticated-orcid":false,"given":"Zhenhui","family":"Feng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0951-2734","authenticated-orcid":false,"given":"Renbin","family":"Xiao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-2547-9626","authenticated-orcid":false,"given":"Mingzhi","family":"Xiao","sequence":"additional","affiliation":[]}],"member":"635","published-online":{"date-parts":[[2025,7,5]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.3390\/ijgi13060168"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/tmc.2020.2984380"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.elerap.2023.101262"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733047"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3390\/math10040539"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/icdcs.2019.00124"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2020.3046629"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1631\/fitee.2200585"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2024.102736"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100732"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/jiot.2018.2815982"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/uic-atc-scalcom.2014.68"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3494522"},{"issue":"12","key":"ref14","first-page":"3836","article-title":"3D-online stable matching problem for new spatial crowdsourcing plat-forms","volume":"31","author":"Li","year":"2020","journal-title":"J Softw"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/tcss.2022.3155868"},{"issue":"6","key":"ref16","doi-asserted-by":"crossref","first-page":"186605","DOI":"10.1007\/s11704-023-3133-6","article-title":"Aggregation-based dual heterogeneous task allocation in spatial crowdsourcing","volume":"18","author":"Lin","year":"2024","journal-title":"Front Comput Sci"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.11.084"},{"issue":"19","key":"ref18","doi-asserted-by":"crossref","first-page":"8337","DOI":"10.3390\/su16198337","article-title":"A review of urban digital twins integration, challenges, and future directions in smart city development","volume":"16","author":"Mazzetto","year":"2024","journal-title":"Sustainability"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s42486-022-00110-9"},{"issue":"3","key":"ref20","first-page":"611","article-title":"Online task assign-ment for three types of objects under spatial crowdsourcing environment","volume":"28","author":"Song","year":"2017a","journal-title":"J Softw"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/icde.2017.147"},{"issue":"1","key":"ref22","first-page":"35","article-title":"Survey on spatio-temporal crowdsourced data management techniques","volume":"28","author":"Tong","year":"2017","journal-title":"J Softw"},{"issue":"1","key":"ref23","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s00778-019-00568-7","article-title":"Spatial crowdsourcing: a survey","volume":"29","author":"Tong","year":"2020","journal-title":"VLDB J"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2019.2948863"},{"issue":"7","key":"ref25","doi-asserted-by":"crossref","first-page":"1637","DOI":"10.1109\/TMC.2017.2771259","article-title":"Multi-objective optimization based allocation of heterogeneous spatial crowdsourcing tasks","volume":"17","author":"Wang","year":"2018","journal-title":"IEEE Trans Mob Comput"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2022.109749","article-title":"Task assign-ment for hybrid scenarios in spatial crowdsourcing: a Q-Learning-based approach","volume":"131","author":"Wang","year":"2022","journal-title":"Appl Soft Comput"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/tcss.2019.2907059"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2017.08.094"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1631\/fitee.2300459"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1504\/ijbic.2023.133500"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2023.102110"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.dcan.2021.10.005"},{"issue":"3","key":"ref33","first-page":"2267","article-title":"Two-stage bilateral online priority assignment in spatio-temporal crowdsourcing","volume":"16","author":"Zhang","year":"2023","journal-title":"IEEE Trans Serv Comput"},{"key":"ref34","first-page":"2245","article-title":"Preference-aware task assignment in on-demand taxi dispatching: an online stable matching approach","volume-title":"Proc 33 rd AAAI Conf on Artificial Intelligence","author":"Zhao","year":"2019"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"106750","DOI":"10.1016\/j.engappai.2023.106750","article-title":"A cooperative population-based iterated greedy algorithm for distributed permutation flowshop group scheduling problem","volume":"125","author":"Zhao","year":"2023","journal-title":"Eng Appl Artif Intell"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2023.101984"}],"container-title":["Frontiers of Information Technology &amp; Electronic Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1631\/FITEE.2500035.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1631\/FITEE.2500035\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1631\/FITEE.2500035.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T07:31:39Z","timestamp":1771659099000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1631\/FITEE.2500035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7]]},"references-count":36,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["35"],"URL":"https:\/\/doi.org\/10.1631\/fitee.2500035","relation":{},"ISSN":["2095-9184","2095-9230"],"issn-type":[{"value":"2095-9184","type":"print"},{"value":"2095-9230","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7]]},"assertion":[{"value":"15 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"All the authors declare that they have no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}