Dynamic Task Assignment Framework for Mobile Crowdsensing with Deep Reinforcement Learning
Task assignment is a key issue in mobile crowdsensing (MCS). Previous task assignment methods were mainly static offline assignment. However, the MCS platform needs to process dynamically changing workers and tasks online in the actual assignment process.
Yanming Fu +6 more
wiley +1 more source
Research trends in combinatorial optimization
Abstract Real‐world problems are becoming highly complex and therefore have to be solved with combinatorial optimization (CO) techniques. Motivated by the strong increase in publications on CO, 8393 articles from this research field are subjected to a bibliometric analysis.
Jann Michael Weinand +4 more
wiley +1 more source
Search Trajectory Networks Applied to the Cyclic Bandwidth Sum Problem
Search trajectory networks (STNs) were proposed as a tool to analyze the behavior of metaheuristics in relation to their exploration ability and the search space regions they traverse.
Valentina Narvaez-Teran +2 more
doaj +1 more source
Multiobjective Green Time‐Dependent Location‐Routing Problem and Algorithms
To reduce the logistic cost and carbon emission and improve customer satisfaction, this study proposes a multiobjective green time‐dependent location routing problem (MOGTDLRP) model in which the objectives are to minimize the distribution total cost, delivery time, and fuel consumption.
Hua-Xin Zhang +2 more
wiley +1 more source
Intelligent Warehouse Robot Scheduling System Using a Modified Nondominated Sorting Algorithm
In intelligent warehouse, the problem of transporting goods in intelligent warehouse is becoming increasingly complex, and the traditional way of automatically guiding vehicles (AGVs) is inefficient, so automated robot systems are introduced into intelligent warehouses.
Jia Ma, Shujun Yang, Hao Jing, Shi Cheng
wiley +1 more source
Hyperheuristics for explicit resource partitioning in simultaneous multithreadedprocessors [PDF]
In simultaneous multithreaded (SMT) processors, various data path resources are concurrently shared by many threads. A few heuristic approaches that explicitly distribute those resources among threads with the goal of improved overall performance have already been proposed.
Isa Ahmet Güney +3 more
openaire +2 more sources
A Feature-Independent Hyper-Heuristic Approach for Solving the Knapsack Problem
Recent years have witnessed a growing interest in automatic learning mechanisms and applications. The concept of hyper-heuristics, algorithms that either select among existing algorithms or generate new ones, holds high relevance in this matter.
Xavier Sánchez-Díaz +5 more
doaj +1 more source
Hyperheuristics: Recent Developments [PDF]
Yes We present a thorough review of hyperheuristic research to date, and analyse/compare hyperheuristic papers based on the methods used.
Chakhlevitch, K., Cowling, Peter I.
openaire +2 more sources
PENDEKATAN HYPER HEURISTIC DENGAN KOMBINASI ALGORITMA PADA EXAMINATION TIMETABLING PROBLEM
Generally, exam scheduling is still done manually and definitely will take a long time. Many researches have developed various studies to find a more appropriate strategy. Hyperheuristic was proposed in this study.
Vicha Azthanty Supoyo, Ahmad Muklason
doaj +1 more source
Learning Combinatorial Interaction Test Generation Strategies Using Hyperheuristic Search [PDF]
The surge of search based software engineering research has been hampered by the need to develop customized search algorithms for different classes of the same problem.
Cohen, MB, Harman, M, Jia, Y, Petke, J
core +1 more source

