The Journal of Supercomputing

, Volume 58, Issue 3, pp 292–301

A parameterized shared-memory scheme for parameterized metaheuristics

  • Francisco Almeida
  • Domingo Giménez
  • Jose J. López-Espín

DOI: 10.1007/s11227-011-0585-5

Cite this article as:
Almeida, F., Giménez, D. & López-Espín, J.J. J Supercomput (2011) 58: 292. doi:10.1007/s11227-011-0585-5


This paper presents a parameterized shared-memory scheme for parameterized metaheuristics. The use of a parameterized metaheuristic facilitates experimentation with different metaheuristics and hybridation/combinations to adapt them to the particular problem we are working with. Due to the large number of experiments necessary for the metaheuristic selection and tuning, parallelism should be used to reduce the execution time. To obtain parallel versions of the metaheuristics and to adapt them to the characteristics of the parallel system, a unified parameterized shared-memory scheme is developed. Given a particular computational system and fixed parameters for the sequential metaheuristic, the appropriate selection of parameters in the unified parallel scheme eases the development of parallel efficient metaheuristics.


Parallel metaheuristics Shared-memory Parameterized algorithms Algorithms optimization 

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Francisco Almeida
    • 1
  • Domingo Giménez
    • 2
  • Jose J. López-Espín
    • 3
  1. 1.Departamento de Estadística, Investigación Operativa y ComputaciónUniversity of La LagunaLa LagunaSpain
  2. 2.Departamento de Informática y SistemasUniversity of MurciaMurciaSpain
  3. 3.Centro de Investigación OperativaUniversity Miguel HernándezElcheSpain

Personalised recommendations