Whale Optimization Algorithm for Efficient Task Allocation in the Internet of Things

In order to solve the problem of reducing worker costs and improving worker efficiency, the author proposes a whale optimization algorithm for efficient task allocation in the Internet of Things. This algorithm adopts the fuzzy chance constrained programming method to model the online time of workers, and introduces delay costs and idle costs based on whether there is delay or not, Due to the fact that the corresponding problem is a combinatorial optimization problem and belongs to the NP hard problem category, a two-stage task allocation algorithm is designed to solve it in combination with the whale optimization algorithm. The experimental results show that after being simulated by the algorithm, half of the workers reached the highest efficiency of 1, and the expected online time of the workers was less than 30, and the task execution time of the workers was less than 35. The task allocation algorithm designed by the author has higher worker efficiency compared to other algorithms and has broad application prospects

Authors

Institutions

Publication Details

Journal
Scalable Computing Practice and Experience
Published
2025-04-01
DOI
https://doi.org/10.12694/scpe.v26i3.4127
Primary Topic
Advanced Computing and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Whale Optimization Algorithm for Efficient Task Allocation in the Internet of Things

Wanchang Shu
2 links
Scalable Computing Practice and Experience
Advanced Computing and Algorithms
article

Whale Optimization Algorithm for Efficient Task Allocation in the Internet of Things

Wanchang Shu
article en

Abstract

In order to solve the problem of reducing worker costs and improving worker efficiency, the author proposes a whale optimization algorithm for efficient task allocation in the Internet of Things. This algorithm adopts the fuzzy chance constrained programming method to model the online time of workers, and introduces delay costs and idle costs based on whether there is delay or not, Due to the fact that the corresponding problem is a combinatorial optimization problem and belongs to the NP hard problem category, a two-stage task allocation algorithm is designed to solve it in combination with the whale optimization algorithm. The experimental results show that after being simulated by the algorithm, half of the workers reached the highest efficiency of 1, and the expected online time of the workers was less than 30, and the task execution time of the workers was less than 35. The task allocation algorithm designed by the author has higher worker efficiency compared to other algorithms and has broad application prospects

Scalable Computing Practice and ExperienceVol. 26(3)
Jiangxi College of Applied Technology (CN)
Openalex Percentile: Top 91%
Advanced Computing and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Whale Optimization Algorithm for Efficient Task Allocation in the Internet of Things — Wanchang Shu · Scalable Computing Practice and Experience (2025) | TGRS Research Map | TGRS