Grid-oriented scatter search algorithm

  • Authors:
  • Antonio Gómez-Iglesias;Miguel A. Vega-Rodríguez;Miguel Cárdenas-Montes;Enrique Morales-Ramos;Francisco Castejón-Magaña

  • Affiliations:
  • National Fusion Laboratory, CIEMAT, Madrid, Spain;Dep. of Technologies of Computers and Communications, University of Extremadura, Cáceres, Spain;Dep. of Basic Research, CIEMAT, Madrid, Spain;ARCO Research Group, University of Extramdura, Cáceres, Spain;National Fusion Laboratory, CIEMAT, Madrid, Spain

  • Venue:
  • ICANNGA'09 Proceedings of the 9th international conference on Adaptive and natural computing algorithms
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

Scatter search (SS) is an evolutionary algorithm (EA) becoming more important in current researches as the increasing number of publications shows. It is a very promising method for solving combinatorial and nonlinear optimisation problems. This algorithm is being widely implemented for solving problems not taking long, but in case of processes requiring of high execution times likely to be executed using grid computing there is not an implementation for it. Some problems arise when we try to execute this algorithm using the grid, but once they are solved, the obtained results are really promising for many complex and scientific applications like, for example, applications for optimising nuclear fusion devices. Using concurrent programming and distributed techniques associated to the grid, the algorithm works as it could do it in a single computer.