Grid-Oriented Scatter Search Algorithm

  • Antonio Gómez-Iglesias
  • Miguel A. Vega-Rodríguez
  • Miguel Cárdenas-Montes
  • Enrique Morales-Ramos
  • Francisco Castejón-Magaña
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5495)

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.

Keywords

Scatter Search Distributed Programming Concurrent Programming Grid Computing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Antonio Gómez-Iglesias
    • 1
  • Miguel A. Vega-Rodríguez
    • 2
  • Miguel Cárdenas-Montes
    • 3
  • Enrique Morales-Ramos
    • 4
  • Francisco Castejón-Magaña
    • 1
  1. 1.National Fusion LaboratoryCIEMATMadridSpain
  2. 2.Dep. of Technologies of Computers and CommunicationsUniversity of ExtremaduraCáceresSpain
  3. 3.Dep. of Basic ResearchCIEMATMadridSpain
  4. 4.ARCO Research GroupUniversity of ExtramduraCáceresSpain

Personalised recommendations