Related Experiment Video
Updated: Oct 18, 2025

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
Published on: December 9, 2012
Q-Learning-Based Hyperheuristic Evolutionary Algorithm for Dynamic Task Allocation of Crowdsensing
Abstract:
Task allocation is a crucial issue of mobile crowdsensing. The existing crowdsensing systems normally select the optimal participants giving no consideration to the sudden departure of mobile users, which significantly affects the sensing quality of tasks with a long sensing period. Furthermore, the ability of a mobile user to collect high-precision data is commonly treated as the same for different types of tasks, causing the unqualified data for some tasks provided by a competitive user. To address the issue, a dynamic task allocation model of crowdsensing is constructed by considering mobile user availability and tasks changing over time. Moreover, a novel indicator for comprehensively evaluating the sensing ability of mobile users collecting high-quality data for different types of tasks at the target area is proposed. A new Q -learning-based hyperheuristic evolutionary algorithm is suggested to deal with the problem in a self-learning way. Specifically, a memory-based initialization strategy is developed to seed a promising population by reusing participants who are capable of completing a particular task with high quality in the historical optima. In addition, taking both sensing ability and cost of a mobile user into account, a novel comprehensive strength-based neighborhood search is introduced as a low-level heuristic (LLH) to select a substitute for a costly participant. Finally, based on a new definition of the state, a Q -learning-based high-level strategy is designed to find a suitable LLH for each state. Empirical results of 30 static and 20 dynamic experiments expose that this hyperheuristic achieves superior performance compared to other state-of-the-art algorithms.
Related Concept Videos
Statically Indeterminate Problem Solving
Heuristics
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Distributed Loads: Problem Solving
Maxwell-Boltzmann Distribution: Problem Solving
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
Ampere-Maxwell's Law: Problem-Solving
To solve the problem, we can use the equations from the analysis of an RC circuit and Maxwell's version of Ampère's law.
For the first part of...

