A simulated annealing method based on a specialised evolutionary algorithm

  • Authors:

  • C. García-Martínez;M. Lozano;F. J. Rodríguez-Díaz

  • Affiliations:

  • Department of Computing and Numerical Analysis, University of Córdoba, 14071, Spain;Department of Computer Science and Artificial Intelligence, CITIC-UGR (Research Center on Information and Communications Technology), University of Granada, 18071, Spain;Department of Computer Science and Artificial Intelligence, CITIC-UGR (Research Center on Information and Communications Technology), University of Granada, 18071, Spain

  • Venue:
  • Applied Soft Computing
  • Year:
  • 2012

Quantified Score

Hi-index 0.01

Visualization

Abstract

The flexible architecture of evolutionary algorithms allows specialised models to be obtained with the aim of performing as other search methods do, but more satisfactorily. In fact, there exist several evolutionary proposals in the literature that play the role of local search methods. In this paper, we make a step forward presenting a specialised evolutionary approach that carries out a search process equivalent to the one of simulated annealing. An empirical study comparing the new model with classic simulated annealing methods, hybrid algorithms and state-of-the-art optimisers concludes that the new alternative scheme for combining ideas from simulated annealing and evolutionary algorithms introduced by our proposal may outperform this kind of hybrid algorithms, and achieve competitive results with regard to proposals presented in the literature for binary-coded optimisation problems.