Evolving Local Search Algorithms

EasyChair Preprint no. 2487

Abstract

Local search algorithms consist to evolve a solution by means of an evaluation function, which is usually directly derived from the objective function of the problem. The resolution difficulties appear when the fitness landscape naturally induced by the problem instance is not perfectly exploitable, has a certain level of ruggedness and therefore has many local optima. We propose here to shift the problem of searching a solution, from searching an evaluation function which maximizes the efficiency of the corresponding local search algorithm.

Keyphrases: métaheuristiques, Optimisation combinatoire, recherche locale, Sélection d'algorithmes, évolution artificielle

@Booklet{EasyChair:2487,
  author = {Vincent Hénaux and Adrien Goëffon and Frédéric Saubion},
  title = {Evolving Local Search Algorithms},
  howpublished = {EasyChair Preprint no. 2487},

  year = {EasyChair, 2020}}