4.7 Article

Evolutionary multi-task allocation for mobile crowdsensing with limited resource

期刊

SWARM AND EVOLUTIONARY COMPUTATION
卷 63, 期 -, 页码 -

出版社

ELSEVIER
DOI: 10.1016/j.swevo.2021.100872

关键词

Crowdsensing; Mobile user; Multi-task allocation; Evolutionary algorithm; Constraints

资金

  1. National Natural Science Foundation of China [61973305]
  2. Six talent peaks project in Jiangsu Province [2017-DZXX-046]

向作者/读者索取更多资源

The new comprehensive multi-task allocation model aims to maximize the sensing quality of all tasks while considering total budget, task sensing quality, and mobile user workload. It introduces an aggregative indicator to estimate overall quality of a mobile user and proposes a large-scale evolutionary algorithm to solve the problem efficiently. The algorithm generates superior feasible assignments and outperforms state-of-the-art algorithms in experimental results.
Multi-task allocation, as a crucial issue on mobile crowdsensing (MCS), is to find the optimal participants-task pair under limited resource. The previous assignment methods normally maximize the benefit of participants or task requester, giving no consideration to the comprehensive interests of all parties in MCS. Besides, the sensing ability of a mobile user is commonly evaluated by the detection quality or the probability of covering the target area, causing the unqualified measurement with low spatial coverage degree or bad accuracy. To overcome these drawbacks, a comprehensive multi-task allocation model for MCS is formulated, in which maximizing the overall sensing quality of all tasks is the objective and three constraints come from the total budget shared by all tasks, the sensing quality of each task and the workload of each mobile user. An aggregative indicator that integrates the spatial coverage degree with the sensing accuracy is presented to estimate the overall quality of a mobile user. Following that, a large-scale evolutionary algorithm with problem-specific repair strategy and the new genetic operators is presented as a problem-solver. The former generates the superior feasible solutions for the overloaded participants and the unqualified tasks, while the latter introduces the new promising users to explore the high dimension decision space, with the purpose of speeding up the convergence and avoiding falling into the local optimum. The experimental results based on 30 test instances indicate that the proposed evolutionary multi-task allocation method can generate the superior feasible assignments as more as possible, which outperform the state-of-the-art algorithms.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Computer Science, Artificial Intelligence

MOEA/D-based participant selection method for crowdsensing with social awareness

Jianjiao Ji, Yinan Guo, Dunwei Gong, Wanbao Tang

APPLIED SOFT COMPUTING (2020)

Article Automation & Control Systems

Q-Learning-Based Hyperheuristic Evolutionary Algorithm for Dynamic Task Allocation of Crowdsensing

Jian-Jiao Ji, Yi-Nan Guo, Xiao-Zhi Gao, Dun-Wei Gong, Ya-Peng Wang

Summary: Task allocation in mobile crowdsensing is a crucial issue, as existing systems do not consider the sudden departure of users, impacting the quality of long-term sensing tasks. To address this, a dynamic task allocation model is proposed, along with a novel indicator for evaluating the sensing ability of users. A Q-learning-based hyperheuristic evolutionary algorithm is suggested, showing superior performance compared to other algorithms.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Article Computer Science, Artificial Intelligence

Energy-efficient flexible job shop scheduling problem considering discrete operation sequence flexibility

Guiliang Gong, Jiuqiang Tang, Dan Huang, Qiang Luo, Kaikai Zhu, Ningtao Peng

Summary: This paper proposes a flexible job shop scheduling problem with discrete operation sequence flexibility and designs an improved memetic algorithm to solve it. Experimental results show that the algorithm outperforms other algorithms in terms of performance. The proposed model and algorithm can help production managers obtain optimal scheduling schemes considering operations with or without sequence constraints.

SWARM AND EVOLUTIONARY COMPUTATION (2024)

Article Computer Science, Artificial Intelligence

A differential evolution algorithm for solving mixed-integer nonlinear programming problems

Daniel Molina-Perez, Efren Mezura-Montes, Edgar Alfredo Portilla-Flores, Eduardo Vega-Alvarado, Barbara Calva-Yanez

Summary: This paper presents a new proposal based on two fundamental strategies to improve the performance of the differential evolution algorithm when solving MINLP problems. The proposal considers a set of good fitness-infeasible solutions to explore promising regions and introduces a composite trial vector generation method to enhance combinatorial exploration and convergence capacity.

SWARM AND EVOLUTIONARY COMPUTATION (2024)