Bi-Objective simplified swarm optimization for fog computing task scheduling

In the face of burgeoning data volumes, latency issues present a formidable challenge to cloud computing. This problem has been strategically tackled through the advent of fog computing, shifting computations from central cloud data centers to local fog devices. This process minimizes data transmission to distant servers, resulting in significant cost savings and instantaneous responses for users. Despite the urgency of many fog computing applications, existing research falls short in providing time-effective and tailored algorithms for fog computing task scheduling. To bridge this gap, we introduce a unique local search mechanism, Card Sorting Local Search (CSLS), that augments the non-dominated solutions found by the Bi-objective Simplified Swarm Optimization (BSSO). We further propose Fast Elite Selecting (FES), a ground-breaking one-front non-dominated sorting method that curtails the time complexity of non-dominated sorting processes. By integrating BSSO, CSLS, and FES, we are unveiling a novel algorithm, Elite Swarm Simplified Optimization (EliteSSO), specifically developed to conquer time-efficiency and non-dominated solution issues, predominantly in large-scale fog computing task scheduling conundrums. Computational evidence reveals that our proposed algorithm is both highly efficient in terms of time and exceedingly effective, outstripping other algorithms on a significant scale.