Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/s10100-013-0321-8 | CEJOR |
Keywords | Field | DocType |
Bioinformatics,Hyper-heuristics,Simulated annealing,Choice function,Combinatorial problems,Sequencing by hybrydization | Simulated annealing,Mathematical optimization,Computer science,Heuristics,Bioinformatics,Combinatorial search,Choice function,Metaheuristic,Encoding (memory) | Journal |
Volume | Issue | ISSN |
22 | 3 | 1435-246X |
Citations | PageRank | References |
3 | 0.41 | 22 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aleksandra Swiercz | 1 | 39 | 4.54 |
| Edmund K. Burke | 2 | 5593 | 363.80 |
| Mateusz Cichenski | 3 | 6 | 1.13 |
| Grzegorz Pawlak | 4 | 18 | 3.17 |
| Sanja Petrovic | 5 | 3 | 0.41 |
| Tomasz Zurkowski | 6 | 3 | 0.41 |
| Jacek Blazewicz | 7 | 1064 | 154.23 |