International Journal of Internet, Broadcasting and Communication

The Institute of Internet, Broadcasting and Communication (한국인터넷방송통신학회)
권호 표지
DOI QR코드

DOI QR Code

A hybrid tabu search algorithm for Task Allocation in Mobile Crowd-sensing

  • Akter, Shathee (Department of Electrical and Computer Engineering, University of Ulsan) ;
  • Yoon, Seokhoon (Department of Electrical and Computer Engineering, University of Ulsan)
  • Received : 2020.08.19
  • Accepted : 2020.08.27
  • Published : 2020.11.30
Download PDF
⟨ Previous Next ⟩

Abstract

One of the key features of a mobile crowd-sensing (MCS) system is task allocation, which aims to recruit workers efficiently to carry out the tasks. Due to various constraints of the tasks (such as specific sensor requirement and a probabilistic guarantee of task completion) and workers heterogeneity, the task allocation become challenging. This assignment problem becomes more intractable because of the deadline of the tasks and a lot of possible task completion order or moving path of workers since a worker may perform multiple tasks and need to physically visit the tasks venues to complete the tasks. Therefore, in this paper, a hybrid search algorithm for task allocation called HST is proposed to address the problem, which employ a traveling salesman problem heuristic to find the task completion order. HST is developed based on the tabu search algorithm and exploits the premature convergence avoiding concepts from the genetic algorithm and simulated annealing. The experimental results verify that our proposed scheme outperforms the existing methods while satisfying given constraints.

Keywords

References

  1. S. Akter and S. Yoon, "Location-aware Task Assignment and Routing in Mobile Crowd Sensing," paper presented to The 11th International Conference on ICT Convergence (ICTC 2020), Jeju, Korea, October 21, 2020.
  2. B. Guo et al., "Mobile crowd sensing and computing: The review of an emerging human-powered sensing paradigm ", ACM Computing Surveys, vol. 48, no. 1, pp. 1-31, August 2015. DOI: https://doi.org/10.1145/2794400
  3. S. Akter and S. Yoon, "DaTask: A Decomposition-Based Deadline-Aware Task Assignment and Workers' PathPlanning in Mobile Crowd-Sensing", IEEE Access, vol. 8, pp. 49920-49932, March 2020. DOI: https://doi.org/10.1109/ACCESS.2020.2980143
  4. G. Pataki, "Teaching Integer Programming Formulations Using The Traveling Salesman Problem", SIAM Review, Vol. 45, No. 1, pp. 116-123, 2003. DOI: https://doi.org/10.1137/S00361445023685
  5. D. Whitley, "A genetic algorithm tutorial", Statistics and Computing, vol. 4, no. 2, pp. 65-85, June 1994. DOI: https://doi.org/10.1007/BF00175354
  6. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by Simulated Annealing", Science, Vol. 220, No. 4598, pp. 671-680, May 1983. DOI: https://doi.org/10.1126/science.220.4598.671
  7. F. Glover, "Tabu Search: part I", ORSA Journal on Computing, Vol. 1, pp. 190-206, August 1989. DOI: https://doi.org/10.1287/ijoc.1.3.190
  8. H. Youssef, S. M. Sait, and H. Adiche, "Evolutionary algorithms, simulated annealing and tabu search: a comparative study", Engineering Applications of Artificial Intelligence, Vol.14, No. 2, pp. 167-181, April 2001. DOI: https://doi.org/10.1016/S0952-1976(00)00065-8
  9. A.J. Umbarkar1 and P.D.Sheth, "Crossover operators in genetic algorithm: A review", ICTACT Journal on Soft Computing, Vol. 6, No. 1, October, 2015. DOI: https://doi.org/10.21917/ijsc.2015.0150
  10. L. Bracciale et al., CRAWDAD dataset roma/taxi (v. 2014-07-17), Jul 2014. https://crawdad.org/roma/taxi/20140717