Unified encoding for hyper-heuristics with application to bioinformatics

This paper introduces a new approach to applying hyper-heuristic algorithms to solve combinatorial problems with less effort, taking into account the modelling and algorithm construction process. We propose a unified encoding of a solution and a set of low level heuristics which are domain-independent and which change the solution itself. This approach enables us to address NP-hard problems and generate good approximate solutions in a reasonable time without a large amount of additional work required to tailor search methodologies for the problem in hand. In particular, we focused on solving DNA sequencing by hybrydization with errors, which is known to be strongly NP-hard. The approach was extensively tested by solving multiple instances of well-known combinatorial problems and compared with results generated by meta heuristics that have been tailored for specific problem domains.

[1]  Fred W. Glover,et al.  Dealing with repetitions in sequencing by hybridization , 2006, Comput. Biol. Chem..

[2]  Abraham P. Punnen,et al.  Experimental analysis of heuristics for the bottleneck traveling salesman problem , 2012, J. Heuristics.

[3]  Graham Kendall,et al.  A Classification of Hyper-heuristic Approaches , 2010 .

[4]  Bernd Bischl,et al.  Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness , 2012, LION.

[5]  Fred W. Glover,et al.  DNA Sequencing - Tabu and Scatter Search Combined , 2004, INFORMS J. Comput..

[6]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[7]  Waleed A. Youssef,et al.  An Enhanced Genetic Algorithm for DNA Sequencing by Hybridization with Positive and Negative Errors , 2004, GECCO.

[8]  Kate Smith-Miles,et al.  Measuring instance difficulty for combinatorial optimization problems , 2012, Comput. Oper. Res..

[9]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[10]  Graham Kendall,et al.  An Investigation of Automated Planograms Using a Simulated Annealing Based Hyper-Heuristic , 2005 .

[11]  Peter Ross,et al.  Learning a Procedure That Can Solve Hard Bin-Packing Problems: A New GA-Based Approach to Hyper-heuristics , 2003, GECCO.

[12]  Graham Kendall,et al.  Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.

[13]  Edmund K. Burke,et al.  A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation , 2007, Eur. J. Oper. Res..

[14]  R. Drmanac,et al.  Sequencing of megabase plus DNA by hybridization: theory of the method. , 1989, Genomics.

[15]  Graham Kendall,et al.  Hyperheuristics: A Tool for Rapid Prototyping in Scheduling and Optimisation , 2002, EvoWorkshops.

[16]  Jacek Blazewicz,et al.  Complexity of DNA sequencing by hybridization , 2003, Theor. Comput. Sci..

[17]  Luiz Antonio Nogueira Lorena,et al.  Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem , 2008, EvoCOP.

[18]  Sanja Petrovic,et al.  A graph-based hyper-heuristic for educational timetabling problems , 2007, Eur. J. Oper. Res..

[19]  Janusz Kaczmarek,et al.  Sequential and parallel algorithms for DNA sequencing , 1997, Comput. Appl. Biosci..

[20]  Graham Kendall,et al.  A Tabu-Search Hyperheuristic for Timetabling and Rostering , 2003, J. Heuristics.

[21]  Ender Özcan,et al.  A comprehensive analysis of hyper-heuristics , 2008, Intell. Data Anal..

[22]  P. Pevzner.  1-Tuple DNA sequencing: computer analysis. , 1989, Journal of biomolecular structure & dynamics.

[23]  Kathryn A. Dowsland,et al.  Simulated Annealing , 1989, Encyclopedia of GIS.

[24]  Graham Kendall,et al.  A hyper-heuristic approach to sequencing by hybridization of DNA sequences , 2013, Ann. Oper. Res..

[25]  Abraham P. Punnen,et al.  An efficient heuristic algorithm for the bottleneck traveling salesman problem , 2009 .

[26]  Maciej Drozdowski,et al.  Five Phase and Genetic Hive Hyper-Heuristics for the Cross-Domain Search , 2012, LION.

[27]  S. B. Needleman,et al.  A general method applicable to the search for similarities in the amino acid sequence of two proteins. , 1970, Journal of molecular biology.

[28]  Graham Kendall,et al.  A Tabu Search Hyper-heuristic Approach to the Examination Timetabling Problem at the MARA University of Technology , 2004, PATAT.

[29]  Kathryn A. Dowsland,et al.  Off-the-Peg or Made-to-Measure? Timetabling and Scheduling with SA and TS , 1997, PATAT.

[30]  K. Khrapko,et al.  [Determination of the nucleotide sequence of DNA using hybridization with oligonucleotides. A new method]. , 1988, Doklady Akademii nauk SSSR.

[31]  Michel Gendreau,et al.  Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..

[32]  John R. Rice,et al.  The Algorithm Selection Problem , 1976, Adv. Comput..

[33]  Ceyda Oguz,et al.  DNA Sequencing by Hybridization via Genetic Search , 2006, Oper. Res..

[34]  Maciej Drozdowski,et al.  Hyper-heuristics for cross-domain search , 2012 .

[35]  Jacek Blazewicz,et al.  A heuristic managing errors for DNA sequencing , 2002, Bioinform..

[36]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[37]  Kunkel Jm,et al.  Spontaneous subclavain vein thrombosis: a successful combined approach of local thrombolytic therapy followed by first rib resection. , 1989 .

[38]  Graham Kendall,et al.  A Hyperheuristic Approach to Scheduling a Sales Summit , 2000, PATAT.

[39]  John R. Woodward,et al.  Hyper-Heuristics , 2015, GECCO.