A Genetic Algorithm with a Tabu Search (GTA) for Traveling Salesman Problem
One motivation of Grid computing (5) is to aggregate the power of widely distributed resources, and provide non trivial services to users. To achieve this goal, an efficient Grid scheduling system is an essential part of the Grid. Rather than covering the whole Grid scheduling area, this survey provides a review of the subject mainly from the perspective of scheduling algorithms. This Paper deals with the Traveling Salesman problem with various constraints. The main objective is to minimize the traveling cost and time. Both Genetic and the Tabu search algorithm is tested independently and also tested combine for the Traveling Salesman problem. With the implementation of our approach the cost and time are reduced for the TSP.