Parallel LAN/WAN heuristics for optimization

  • Authors:
  • E. Alba;G. Luque;J. M. Troya

  • Affiliations:
  • Departamento de Lenguajes y Ciencias de la Computación, E.T.S. Ingeniería Informática, Campus de Teatinos (3.2.12), 29071 Málaga, Spain;Departamento de Lenguajes y Ciencias de la Computación, E.T.S. Ingeniería Informática, Campus de Teatinos (3.2.12), 29071 Málaga, Spain;Departamento de Lenguajes y Ciencias de la Computación, E.T.S. Ingeniería Informática, Campus de Teatinos (3.2.12), 29071 Málaga, Spain

  • Venue:
  • Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present in this work a wide spectrum of results on analyzing the behavior of parallel heuristics (both pure and hybrid) for solving optimization problems. We focus on several evolutionary algorithms as well as on simulated annealing. Our goal is to offer a first study on the possible changes in the search mechanics that the algorithms suffer when shifting from a LAN network to a WAN environment. We will address six optimization tasks of considerable complexity. The results show that, despite their expected slower execution time, the WAN versions of our algorithms consistently solve the problems. We report also some interesting results in which WAN algorithms outperform LAN ones. Those results are further extended to analyze the behavior of the heuristics in WAN with a larger number of processors and different connectivities.