2021
DOI: 10.1016/j.compeleceng.2021.107419
|View full text |Cite
|
Sign up to set email alerts
|

Hybrid ant genetic algorithm for efficient task scheduling in cloud data centers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
17
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 51 publications
(17 citation statements)
references
References 14 publications
0
17
0
Order By: Relevance
“…In [11], the authors proposed a Hybrid ant genetic approach for scheduling tasks. The presented technique adopts features of genetic algorithm (GA) and ant colony optimization (ACO) and splits virtual machines and tasks into small groups.…”
Section: Related Workmentioning
confidence: 99%
“…In [11], the authors proposed a Hybrid ant genetic approach for scheduling tasks. The presented technique adopts features of genetic algorithm (GA) and ant colony optimization (ACO) and splits virtual machines and tasks into small groups.…”
Section: Related Workmentioning
confidence: 99%
“…They proposed a hybrid fuzzy ant colony algorithm in order to distribute the load efficiently on servers, and showed the effectiveness of the proposed hybrid algorithm, especially in the case of a high number of nodes. Ajmal et al [22] proposed a combined an ant colony algorithm with a genetic algorithm in order to efficiently scheduling tasks in a cloud data center. By splitting tasks into groups and identifying loaded virtual machines, they showed that the proposed approach considerably reduces solution space.…”
Section: Related Workmentioning
confidence: 99%
“…The initial acceptance probability of annealing is close to 1, and the pheromone update is performed on the deployment plan corresponding to the updated centralized solution to make the pheromone distribution more widely and avoid falling into a local optimum. After all the ants complete one iteration, the algorithm performs cooling processing, setting a reasonable cooling processing mechanism, such as in (22). As the number of iterations increases, the temperature gradually decreases, the acceptance probability decreases, and the probability of a poor solution being accepted decreases, which makes the pheromone distribution on the path more concentrated and speeds up the algorithm convergence speed.…”
Section: ) Simulated Annealing Mechanismmentioning
confidence: 99%
“…The developed algorithm is of two sections, the first section is used for identifying the load buses required for appropriate load shedding, while the other section decides which of the optimum loads is required to be shed at the chosen load buses, using differential evolution. Validation of the method is conducted using a genetic algorithm, a method that has often been proven by different authors to be fast and accurate [15][16][17][18]. The remaining of this paper is structured as follows: Section 2 describes the proposed methodology, which includes nodal analysis and a DE algorithm for optimizing the load shedding.…”
Section: Introductionmentioning
confidence: 99%