The closest string problem (CSP) consists in finding a string t with minimum Hamming distance from the strings of a given finite input set. To overcome its NP-hardness, we propose a simulated annealing approach along with a new heuristic for finding a good initial solution for the problem, which allows one to speed up sensibly the convergence of the algorithm. To assess its effectiveness and robustness, we extensively compared our approach with the integer-programming (IP) exact solution, and with other heuristic approaches present in the literature, both on artificial and real instances. Experimental results show that our approach allows one to locate good solutions for the problem, that are close to the optimum found by the IP formulation and outperforms other heuristic methods for the CSP.
|Titolo:||A Combined Greedy-Walk Heuristic and Simulated Annealing Approach for the Closest String Problem|
|Data di pubblicazione:||2014|
|Citazione:||A Combined Greedy-Walk Heuristic and Simulated Annealing Approach for the Closest String Problem / Pappalardo E; Cantone D; Pardalos P M. - In: OPTIMIZATION METHODS & SOFTWARE. - ISSN 1055-6788. - 29:4(2014), pp. 673-702.|
|Appare nelle tipologie:||1.1 Articolo in rivista|