Advertisement
Published in:
2010 | OriginalPaper | Chapter
Genetic-Annealing Algorithm in Grid Environment for Scheduling Problems
Authors : Marco Antonio Cruz-Chávez, Abelardo Rodríguez-León, Erika Yesenia Ávila-Melgar, Fredy Juárez-Pérez, Martín H. Cruz-Rosales, Rafael Rivera-López
Published in: Security-Enriched Urban Computing and Smart Grid
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
This paper presents a parallel hybrid evolutionary algorithm executed in a grid environment. The algorithm executes local searches using simulated annealing within a Genetic Algorithm to solve the job shop scheduling problem. Experimental results of the algorithm obtained in the “Tarantula MiniGrid” are shown. Tarantula was implemented by linking two clusters from different geographic locations in Mexico (Morelos-Veracruz). The technique used to link the two clusters and configure the Tarantula MiniGrid is described. The effects of latency in communication between the two clusters are discussed. It is shown that the evolutionary algorithm presented is more efficient working in Grid environments because it can carry out major exploration and exploitation of the solution space.