Exploiting Base-Station Separability in Constrained Multiobjective Task Offloading for the Industrial Internet of Things: A Decomposition Multitasking Method with Exact Pareto-Front Synthesis
TL;DR
CR-MTMEMTO-D is proposed, a structure-aware decomposition multitasking method that treats each region as an independent subtask, solves it with a feasibility-repaired NSGA-II, and reconstructs the global feasible Pareto front as the non-dominated subset of the Minkowski sum of the regional fronts, an exact composition that adds no global evaluations.
Abstract
In Industrial Internet of Things (IIoT) deployments, mobile edge computing (MEC) offloads computation-intensive tasks, a constrained biobjective problem trading time delay against energy consumption (MTOP). We show that this benchmark is exactly separable across micro base-station (MiBS) regions: its delay and energy objectives are additive over regions, and the only coupling, intra-cell interference, stays within a region. Exploiting this, we propose CR-MTMEMTO-D, a structure-aware decomposition multitasking method that treats each region as an independent subtask, solves it with a feasibility-repaired NSGA-II, and reconstructs the global feasible Pareto front as the non-dominated subset of the Minkowski sum of the regional fronts, an exact composition that adds no global evaluations. Across 12 instances (45–432 variables, 20 seeds), it attains the best hypervolume and IGD on every instance (mean HV 0.9340 vs. 0.8021 for a plain NSGA-II baseline; average rank 1.00), with the margin widening as the problem scales, and it is unchanged under total-evaluation matching because every evaluation is a regional main task. A feasibility-priority acceptance gate keeps the population fully feasible. Under matched budgets, a prior cheap-task pool with bandit-controlled transfer adds no significant gain, which motivates the structural approach.