Large neighborhood search for the most strings with few bad columns problem
- 124 Downloads
In this work, we consider the following NP-hard combinatorial optimization problem from computational biology. Given a set of input strings of equal length, the goal is to identify a maximum cardinality subset of strings that differ maximally in a pre-defined number of positions. First of all, we introduce an integer linear programming model for this problem. Second, two variants of a rather simple greedy strategy are proposed. Finally, a large neighborhood search algorithm is presented. A comprehensive experimental comparison among the proposed techniques shows, first, that larger neighborhood search generally outperforms both greedy strategies. Second, while large neighborhood search shows to be competitive with the stand-alone application of CPLEX for small- and medium-sized problem instances, it outperforms CPLEX in the context of larger instances.
KeywordsMost strings with few bad columns Integer linear programming Large neighborhood search
- Lizárraga E, Blesa MJ, Blum C, Raidl GR (2015) On solving the most strings with few bad columns problem: an ILP model and heuristics. In: Proceedings of INISTA 2015—international symposium on innovations in intelligent systems and applications, IEEE Press, pp 1–8Google Scholar
- López-Ibáñez M, Dubois-Lacoste J, Stützle T, Birattari M (2011) The \(\sf irace\) package, iterated race for automatic algorithm configuration. Technical Report TR/IRIDIA/2011-004, IRIDIA, Université libre de Bruxelles, BelgiumGoogle Scholar
- Pisinger D, Ropke S (2010) Large neighborhood search. In: Gendreau M, Potvin JY (eds) Handbook of metaheuristics, International series in operations research and management science, vol 146. Springer, New York, pp 399–419Google Scholar