Abstract

With the rapid growth of edge computing applications, optimizing both edge server placement and task offloading decisions is critical for minimizing system latency in edge–cloud environments. However, these two problems are tightly coupled and jointly form a binary non-linear programming (BNLP) problem that is NP-hard. To address this challenge, this paper proposes a novel hybrid meta-heuristic algorithm with alternating iteration, which decouples the joint optimization into two interdependent subproblems: edge server placement and task offloading. These subproblems are solved alternately using particle swarm optimization (PSO) for placement and a genetic algorithm (GA) for offloading, respectively. PSO efficiently explores the discrete placement space under bound constraints, while GA effectively navigates the high-dimensional binary offloading space. Compact encoding schemes are designed to inherently satisfy problem constraints, reducing search overhead and improving convergence. The overall algorithm exhibits polynomial-time complexity, making it scalable for practical deployments. Extensive experiments comparing the proposed method against ten baseline algorithms demonstrate that it achieves the best latency with the smallest standard deviation. The results validate the effectiveness, robustness, and scalability of the proposed alternating iterative hybrid meta-heuristic approach for joint edge server placement and task offloading optimization.

IPC Classification

Keywords