earticle

논문검색

Gridification of Genetic Algorithm with Reduced Communication for the Job Shop Scheduling Problem

초록

영어

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 conFigureure 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.

목차

Abstract
 1. Introduction
 2. Job Shop Scheduling Problem
 3. Hybrid Evolutionary Algorithm in Grid Environment
 4. Test Scenario
 5. Experimental Results
  5.1 Computing bandwidth in the Grid
 6. Conclusions
 References

저자정보

  • Marco Antonio Cruz - Chávez CIICAp

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.