Reactive stochastic local search algorithms for the genomic median problem

  • Authors:

  • Renaud Lenne;Christine Solnon;Thomas Stützle;Eric Tannier;Mauro Birattari

  • Affiliations:

  • LIRIS, UMR, CNRS, Université de Lyon 1, Lyon, France and IRIDIA-CoDE, Université Libre de Bruxelles, Brussels, Belgium;LIRIS, UMR, CNRS, Université de Lyon 1, Lyon, France;IRIDIA-CoDE, Université Libre de Bruxelles, Brussels, Belgium;INRIA Rhône-Alpes, LBBE, UMR, CNRS, Université de Lyon 1, France;IRIDIA-CoDE, Université Libre de Bruxelles, Brussels, Belgium

  • Venue:
  • EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The genomic median problem is an optimization problem inspired by a biological issue: it aims to find the chromosome organization of the common ancestor to multiple living species. It is formulated as the search for a genome that minimizes a rearrangement distance measure among given genomes. Several attempts have been reported for solving this NP-hard problem. These range from simple heuristic methods to a stochastic local search algorithm inspired by WalkSAT, a well-known local search algorithm for the satisfiability problem in propositional logic. The main objective of this research is to develop improved algorithmic techniques for tackling the genomic median problem and to provide new state-of-the-art solutions. In particular, we have developed an algorithm that is based on tabu search and iterated local search and that shows high performance. To alleviate the dependence of the algorithm performance on a single fixed parameter setting, we have included a reactive scheme that automatically adapts the tabu list length of the tabu search part and the perturbation strength of the iterated local search part. In fact, computational results show that we have developed a new very high-performing stochastic local search algorithm for the genomic median problem and we also have found a new best solution for a realworld case.