Nature-Inspired and Evolutionary Techniques for Automation

Gen, Mitsuo; Lin, Lin

doi:10.1007/978-3-030-96729-1_21

Cited by 2 publications

(1 citation statement)

References 80 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Pareto optimality is a state in which a group of solutions exists where no individual solution can be enhanced without causing a deterioration in another solution (Gen and Cheng, 2000 ; Zhang et al, 2022 ; Gen and Lin, 2023b ). Task scheduling involves the identification of schedules that optimize many goals concurrently, such as minimizing makespan and resource utilization.…”

Section: The Proposed Algorithmmentioning

confidence: 99%

Optimizing multi-objective task scheduling in fog computing with GA-PSO algorithm for big data application

Saad,

Enam,

Qureshi

2024

Front. Big Data

View full text Add to dashboard Cite

As the volume and velocity of Big Data continue to grow, traditional cloud computing approaches struggle to meet the demands of real-time processing and low latency. Fog computing, with its distributed network of edge devices, emerges as a compelling solution. However, efficient task scheduling in fog computing remains a challenge due to its inherently multi-objective nature, balancing factors like execution time, response time, and resource utilization. This paper proposes a hybrid Genetic Algorithm (GA)-Particle Swarm Optimization (PSO) algorithm to optimize multi-objective task scheduling in fog computing environments. The hybrid approach combines the strengths of GA and PSO, achieving effective exploration and exploitation of the search space, leading to improved performance compared to traditional single-algorithm approaches. The proposed hybrid algorithm results improved the execution time by 85.68% when compared with GA algorithm, by 84% when compared with Hybrid PWOA and by 51.03% when compared with PSO algorithm as well as it improved the response time by 67.28% when compared with GA algorithm, by 54.24% when compared with Hybrid PWOA and by 75.40% when compared with PSO algorithm as well as it improved the completion time by 68.69% when compared with GA algorithm, by 98.91% when compared with Hybrid PWOA and by 75.90% when compared with PSO algorithm when various tasks inputs are given. The proposed hybrid algorithm results also improved the execution time by 84.87% when compared with GA algorithm, by 88.64% when compared with Hybrid PWOA and by 85.07% when compared with PSO algorithm it improved the response time by 65.92% when compared with GA algorithm, by 80.51% when compared with Hybrid PWOA and by 85.26% when compared with PSO algorithm as well as it improved the completion time by 67.60% when compared with GA algorithm, by 81.34% when compared with Hybrid PWOA and by 85.23% when compared with PSO algorithm when various fog nodes are given.

show abstract

Section: The Proposed Algorithmmentioning

confidence: 99%