Combined discrete particle swarm optimization and simulated annealing for grid computing scheduling problem

  • Authors:

  • Ruey-Maw Chen;Der-Fang Shiau;Shih-Tang Lo

  • Affiliations:

  • Department of Computer Science and Information Engineering, National Chin-yi University of Technology, Taichung, Taiwan, R.O.C.;Department of Information Management, Fooyin University, Kaohsiung, Taiwan, R.O.C.;Department of Information Management, Kun-Shan University, Tainan, Taiwan, R.O.C.

  • Venue:
  • ICIC'09 Proceedings of the Intelligent computing 5th international conference on Emerging intelligent computing technology and applications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The grid scheduling problem is concerted with some tasks assigning to a grid distributed system that the relative tasks have to exchange information on different grids. In the original particle swarm optimization (PSO) algorithm, particles search solutions in a continuous solution space. Since the solution space of the grid scheduling problem is discrete. This paper presents a discrete particle swarm optimization (PSO) that combines the simulated annealing (SA) method to solve the grid scheduling problems. The proposed discrete PSO uses a population of particles through a discrete space on the basis of information about each particle's local best solution and global best solution of all particles. For generating the next solution of each particle, the SA is adopted into the discrete PSO. The objective is to minimize the maximum cost of the grid, which includes computing cost and communication cost. Simulation results show that the grid scheduling problem can be solved efficiently by the proposed method.