Multi-Objective Task Scheduling Optimization in Spatial Crowdsourcing

Recently, with the development of mobile devices and the crowdsourcing platform, spatial crowdsourcing (SC) has become more widespread. In SC, workers need to physically travel to complete spatial–temporal tasks during a certain period of time. The main problem in SC platforms is scheduling a set of...

Full description

Bibliographic Details
Main Authors: Afra A. Alabbadi, Maysoon F. Abulkhair
Format: Article
Language:English
Published: MDPI AG 2021-02-01
Series:Algorithms
Subjects:
MOO
Online Access:https://www.mdpi.com/1999-4893/14/3/77
id doaj-9f03cf5731a046ffa1ec93c037b32cda
record_format Article
spelling doaj-9f03cf5731a046ffa1ec93c037b32cda2021-02-28T00:00:17ZengMDPI AGAlgorithms1999-48932021-02-0114777710.3390/a14030077Multi-Objective Task Scheduling Optimization in Spatial CrowdsourcingAfra A. Alabbadi0Maysoon F. Abulkhair1Faculty of Computing and Information Technology, King Abdulaziz University, Jeddah 21577, Saudi ArabiaFaculty of Computing and Information Technology, King Abdulaziz University, Jeddah 21577, Saudi ArabiaRecently, with the development of mobile devices and the crowdsourcing platform, spatial crowdsourcing (SC) has become more widespread. In SC, workers need to physically travel to complete spatial–temporal tasks during a certain period of time. The main problem in SC platforms is scheduling a set of proper workers to achieve a set of spatial tasks based on different objectives. In actuality, real-world applications of SC need to optimize multiple objectives together, and these objectives may sometimes conflict with one another. Furthermore, there is a lack of research dealing with the multi-objective optimization (MOO) problem within an SC environment. Thus, in this work we focused on task scheduling based on multi-objective optimization (TS-MOO) in SC, which is based on maximizing the number of completed tasks, minimizing the total travel costs, and ensuring the balance of the workload between workers. To solve the previous problem, we developed a new method, i.e., the multi-objective task scheduling optimization (MOTSO) model that consists of two algorithms, namely, the multi-objective particle swarm optimization (MOPSO) algorithm with our fitness function Alabbadi, et al. and the ranking strategy algorithm based on the task entropy concept and task execution duration. The main purpose of our ranking strategy is to improve and enhance the performance of our MOPSO. The primary goal of the proposed MOTSO model is to find an optimal solution based on the multiple objectives that conflict with one another. We conducted our experiment with both synthetic and real datasets; the experimental results and statistical analysis showed that our proposed model is effective in terms of maximizing the number of completed tasks, minimizing the total travel costs, and balancing the workload between workers.https://www.mdpi.com/1999-4893/14/3/77task schedulingspatial crowdsourcingranking strategyMOOMOPSO
collection DOAJ
language English
format Article
sources DOAJ
author Afra A. Alabbadi
Maysoon F. Abulkhair
spellingShingle Afra A. Alabbadi
Maysoon F. Abulkhair
Multi-Objective Task Scheduling Optimization in Spatial Crowdsourcing
Algorithms
task scheduling
spatial crowdsourcing
ranking strategy
MOO
MOPSO
author_facet Afra A. Alabbadi
Maysoon F. Abulkhair
author_sort Afra A. Alabbadi
title Multi-Objective Task Scheduling Optimization in Spatial Crowdsourcing
title_short Multi-Objective Task Scheduling Optimization in Spatial Crowdsourcing
title_full Multi-Objective Task Scheduling Optimization in Spatial Crowdsourcing
title_fullStr Multi-Objective Task Scheduling Optimization in Spatial Crowdsourcing
title_full_unstemmed Multi-Objective Task Scheduling Optimization in Spatial Crowdsourcing
title_sort multi-objective task scheduling optimization in spatial crowdsourcing
publisher MDPI AG
series Algorithms
issn 1999-4893
publishDate 2021-02-01
description Recently, with the development of mobile devices and the crowdsourcing platform, spatial crowdsourcing (SC) has become more widespread. In SC, workers need to physically travel to complete spatial–temporal tasks during a certain period of time. The main problem in SC platforms is scheduling a set of proper workers to achieve a set of spatial tasks based on different objectives. In actuality, real-world applications of SC need to optimize multiple objectives together, and these objectives may sometimes conflict with one another. Furthermore, there is a lack of research dealing with the multi-objective optimization (MOO) problem within an SC environment. Thus, in this work we focused on task scheduling based on multi-objective optimization (TS-MOO) in SC, which is based on maximizing the number of completed tasks, minimizing the total travel costs, and ensuring the balance of the workload between workers. To solve the previous problem, we developed a new method, i.e., the multi-objective task scheduling optimization (MOTSO) model that consists of two algorithms, namely, the multi-objective particle swarm optimization (MOPSO) algorithm with our fitness function Alabbadi, et al. and the ranking strategy algorithm based on the task entropy concept and task execution duration. The main purpose of our ranking strategy is to improve and enhance the performance of our MOPSO. The primary goal of the proposed MOTSO model is to find an optimal solution based on the multiple objectives that conflict with one another. We conducted our experiment with both synthetic and real datasets; the experimental results and statistical analysis showed that our proposed model is effective in terms of maximizing the number of completed tasks, minimizing the total travel costs, and balancing the workload between workers.
topic task scheduling
spatial crowdsourcing
ranking strategy
MOO
MOPSO
url https://www.mdpi.com/1999-4893/14/3/77
work_keys_str_mv AT afraaalabbadi multiobjectivetaskschedulingoptimizationinspatialcrowdsourcing
AT maysoonfabulkhair multiobjectivetaskschedulingoptimizationinspatialcrowdsourcing
_version_ 1724247842272313344