년 - 년
Gridification of Genetic Algorithm with Reduced Communication for the Job Shop Scheduling Problem
보안공학연구지원센터(IJGDC) International Journal of Grid and Distributed Computing vol.3 no.3 2010.09 pp.13-28
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
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.
0개의 논문이 장바구니에 담겼습니다.
선택하신 파일을 압축중입니다.
잠시만 기다려 주십시오.