Gravitational Attraction Search With Virtual Mass Gasvm To Solve Static Grid Job Scheduling Problem
Amin Jula, Narjes Khatoon Naseri, Amir Masood Rahmani · Journal of Mathematics and Computer Science · 2010
Achieving the most grid computing efficiency requires optimized job scheduling, that is a problem with vast search space and Attaining optimal solutions using deterministic algorithm is extremely difficult or impossible. Besides, Falling in the trap of local minima is considered to be one of the problems existing in gravitational attraction search. GASVM proposed two modifications. First, defining virtual mass (VM) for K best solutions. For each solution, VM is defined depends on mass and ranking in the sorted list of solutions. VMs will increase gravitational mass of proper solutions and attract others to them. Second, we calculate gravitational force of just K proper solutions on the others to prevent current good solutions, more searching about, and attracting other solutions in the direction of them. In each modification, we obtain K by using roulette wheel algorithm. Analyzing the results of GASVM executions shows that the proposed algorithm is able to achieve its intended aims to modify gravitational attraction search algorithm.