Publicado

2014-03-01

Proactive local search based on FDC

DOI:

https://doi.org/10.15446/dyna.v81n184.37303

Palabras clave:

Metaheuristics, Agents, Proactive Behavior, Variable Neighborhood Search, FDC (es)

Descargas

Autores/as

  • Mailyn Moreno-Espino Fac. Ing. Informática, Instituto Superior Politécnico "José Antonio Echeverría"
  • Alejandro Rosete-Suárez Fac. Ing. Informática, Instituto Superior Politécnico "José Antonio Echeverría"
This paper introduces a proactive version of Hill Climbing (or Local Search). It is based on the identification of the best neighborhood through the repeated application of mutations and the evaluation of theses neighborhood by using FDC (Fitness Distance Correlation). The best neighborhood is used during a time window, and then the analysis is repeated. An experimental study was conducted in 28 functions on binary strings. The proposed algorithm achieves good performance compared to other metaheuristics (Evolutionary Algorithms, Great Deluge Algorithm, Threshold Accepting, and RRT).

Dimensions

PlumX

Visitas a la página del resumen del artículo

469

Descargas

Los datos de descarga aún no están disponibles.

Cómo citar

[1]
M. Moreno-Espino y A. Rosete-Suárez, «Proactive local search based on FDC», DYNA, vol. 81, n.º 184, pp. 201–208, mar. 2014, doi: 10.15446/dyna.v81n184.37303.