第6期 潘庆先，等：基于禁忌搜索的时空众包任务分配算法 ·1047· 内得到分配。最后通过在真实数据集实验，验证 real-time reliable crowdsourcing[C]//2014 IEEE 34th Inter- 了该算法在降低任务分配时间、提高匹配效率上 national Conference on Distributed Computing Systems 具有高效性。在未来工作中，还要进行更多研究 (ICDCS).Madrid,Spain,2014:1-10. 来降低算法的复杂度。同时，我们将继续研究路 [10]宋天舒，童咏昕，王立斌，等.空间众包环境下的3类对 径规划中其他的经典算法，并将之应用到众包 象在线任务分配).软件学报，2017,28(3)：611-630. 领域。 SONG Tianshu,TONG Yongxin,WANG Libin,et al. 参考文献： Online task assignment for three types of objects under spatial crowdsourcing environment[J].Journal of soft- [1]LAW E,VON AHN L.Human computation[J].Synthesis ware,2017,28(3):611-630. lectures on artificial intelligence and machine learning, [11]刘辉，李盛恩.时空众包环境下基于统计预测的自适应 2011,5(3):1-121. 阈值算法U.计算机应用，2018,38(2)415-420 [2]童咏昕，袁野，成雨蓉，等.时空众包数据管理技术研究 LIU Hui,LI Shengen.Adaptive threshold algorithm based 综述[).软件学报，2017,28(1)：35-58 on statistical prediction under spatial crowdsourcing en- TONG Yongxin,YUAN Ye,CHENG Yurong,et al.Sur- vironment[J].Journal of computer applications,2018, vey on spatiotemporal crowdsourced data management 38(2:415-420 techniques[J].Journal of software,2017,28(1):35-58. [12]HASSAN UU,CURRY E.Efficient task assignment for [3]刘辉.时控众包环境下在线任务分配策略的研究D].济 spatial crowdsourcing:a combinatorial fractional optimiz- 南：山东建筑大学，2018. ation approach with semi-bandit learning[J].Expert sys- LIU Hui.Research of online task allocation strategy in spa- tio-temporal crowdsourcing environment[D].Jinan:Shan- tems with applications,2016,58:36-56. [13]GAREY M R,JOHNSON D S.Computers and intractab- dong Jianzhu University,2018. [4]KAZEMI L.SHAHABI C.Geocrowd:enabling query an- ility:a guide to the theory of NP-completeness[M].New swering with spatial crowdsourcing[C]/Proceedings of the York:W.H.Freeman Co.,1979:79-87 [14]DANTZIG G B,RAMSER J H.The truck dispatching 20th International Conference on Advances in Geographic Information Systems.Redondo Beach,USA,2012: problem[J].Management science,1959,6(1):80-91 189-199 [15]毕国通.车辆路径问题及其优化算法研究综述)物流 [5]TONG Yongxin,SHE Jieying,DING Bolin,et al.Online 科技，2016,39(6)：95-97 mobile micro-task allocation in spatial crowdsourcing[C]// BI Guotong.The review of vehicle routing problem and 2016 IEEE 32nd International Conference on Data Engin- its optimization algorithm[J].Logistics sci-tech,2016. eering (ICDE).Helsinki,Finland.2016:49-60 396):95-97 [6]LI Yu,YIU ML,XU Wenjian.Oriented online route re- [16]苏畅，徒君.一种自适应最大最小蚁群算法[.模式识 commendation for spatial crowdsourcing task workers[Cl// 别与人工智能2007,20(5)：688-691 Proceedings of the 14th International Symposium on Spa- SU Chang,TU Jun.An adaptive max-min ant colony al- tial and Temporal Databases.Hong Kong,China,2015: gorithm[J].Pattern recognition and artificial intelligence, 137-156. 2007.20(5:688-691. [7]LI Guoliang,WANG Jiannan,ZHENG Yudian,et al. [17]BAI Jie,YANG Genke,CHEN Yuwang,et al.A model Crowdsourced data management:a survey[J].IEEE trans- induced max-min ant colony optimization for asymmetric actions on knowledge and data engineering,2016,28(9): traveling salesman problem[J].Applied soft computing, 2296-2319 2013.13(3:1365-1375. [8]PAN Qingxian,DONG Hongbin,WANG Yingjie,et al. [18]YU Jiapeng,WANG Chengen.A max-min ant colony Recommendation of crowdsourcing tasks based on system for assembly sequence planning[J].The interna- word2vec semantic tags[J].Wireless communications and tional journal of advanced manufacturing technology, mobile computing,2019,2019:2121850. 2013.67(9/10/11/12):2819-2835 [9]BOUTSIS I,KALOGERAKI V.On task assignment for [19]REN Chunyu.Solving min-max vehicle routing内得到分配。最后通过在真实数据集实验，验证 了该算法在降低任务分配时间、提高匹配效率上 具有高效性。在未来工作中，还要进行更多研究 来降低算法的复杂度。同时，我们将继续研究路 径规划中其他的经典算法，并将之应用到众包 领域。 参考文献： LAW E, VON AHN L. Human computation[J]. Synthesis lectures on artificial intelligence and machine learning, 2011, 5(3): 1–121. [1] 童咏昕, 袁野, 成雨蓉, 等. 时空众包数据管理技术研究 综述 [J]. 软件学报, 2017, 28(1): 35–58. TONG Yongxin, YUAN Ye, CHENG Yurong, et al. Sur￾vey on spatiotemporal crowdsourced data management techniques[J]. Journal of software, 2017, 28(1): 35–58. [2] 刘辉. 时空众包环境下在线任务分配策略的研究 [D]. 济 南: 山东建筑大学, 2018. LIU Hui. Research of online task allocation strategy in spa￾tio-temporal crowdsourcing environment[D]. Jinan: Shan￾dong Jianzhu University, 2018. [3] KAZEMI L, SHAHABI C. Geocrowd: enabling query an￾swering with spatial crowdsourcing[C]//Proceedings of the 20th International Conference on Advances in Geographic Information Systems. Redondo Beach, USA, 2012: 189−199. [4] TONG Yongxin, SHE Jieying, DING Bolin, et al. Online mobile micro-task allocation in spatial crowdsourcing[C]// 2016 IEEE 32nd International Conference on Data Engin￾eering (ICDE). Helsinki, Finland, 2016: 49−60. [5] LI Yu, YIU M L, XU Wenjian. Oriented online route re￾commendation for spatial crowdsourcing task workers[C]// Proceedings of the 14th International Symposium on Spa￾tial and Temporal Databases. Hong Kong, China, 2015: 137−156. [6] LI Guoliang, WANG Jiannan, ZHENG Yudian, et al. Crowdsourced data management: a survey[J]. IEEE trans￾actions on knowledge and data engineering, 2016, 28(9): 2296–2319. [7] PAN Qingxian, DONG Hongbin, WANG Yingjie, et al. Recommendation of crowdsourcing tasks based on word2vec semantic tags[J]. Wireless communications and mobile computing, 2019, 2019: 2121850. [8] [9] BOUTSIS I, KALOGERAKI V. On task assignment for real-time reliable crowdsourcing[C]//2014 IEEE 34th Inter￾national Conference on Distributed Computing Systems (ICDCS). Madrid, Spain, 2014: 1−10. 宋天舒, 童咏昕, 王立斌, 等. 空间众包环境下的 3 类对 象在线任务分配 [J]. 软件学报, 2017, 28(3): 611–630. SONG Tianshu, TONG Yongxin, WANG Libin, et al. Online task assignment for three types of objects under spatial crowdsourcing environment[J]. Journal of soft￾ware, 2017, 28(3): 611–630. [10] 刘辉, 李盛恩. 时空众包环境下基于统计预测的自适应 阈值算法 [J]. 计算机应用, 2018, 38(2): 415–420. LIU Hui, LI Shengen. Adaptive threshold algorithm based on statistical prediction under spatial crowdsourcing en￾vironment[J]. Journal of computer applications, 2018, 38(2): 415–420. [11] HASSAN U U, CURRY E. Efficient task assignment for spatial crowdsourcing: a combinatorial fractional optimiz￾ation approach with semi-bandit learning[J]. Expert sys￾tems with applications, 2016, 58: 36–56. [12] GAREY M R, JOHNSON D S. Computers and intractab￾ility: a guide to the theory of NP-completeness[M]. New York: W. H. Freeman & Co., 1979: 79−87. [13] DANTZIG G B, RAMSER J H. The truck dispatching problem[J]. Management science, 1959, 6(1): 80–91. [14] 毕国通. 车辆路径问题及其优化算法研究综述 [J]. 物流 科技, 2016, 39(6): 95–97. BI Guotong. The review of vehicle routing problem and its optimization algorithm[J]. Logistics sci-tech, 2016, 39(6): 95–97. [15] 苏畅, 徒君. 一种自适应最大最小蚁群算法 [J]. 模式识 别与人工智能, 2007, 20(5): 688–691. SU Chang, TU Jun. An adaptive max-min ant colony al￾gorithm[J]. Pattern recognition and artificial intelligence, 2007, 20(5): 688–691. [16] BAI Jie, YANG Genke, CHEN Yuwang, et al. A model induced max-min ant colony optimization for asymmetric traveling salesman problem[J]. Applied soft computing, 2013, 13(3): 1365–1375. [17] YU Jiapeng, WANG Chengen. A max-min ant colony system for assembly sequence planning[J]. The interna￾tional journal of advanced manufacturing technology, 2013, 67(9/10/11/12): 2819–2835. [18] [19] REN Chunyu. Solving min-max vehicle routing 第 6 期 潘庆先，等：基于禁忌搜索的时空众包任务分配算法 ·1047·