A tensor-based selection hyper-heuristic for cross-domain heuristic search
Hyper-heuristics have emerged as automated high level search methodologies that manage a set of low level heuristics for solving computationally hard problems. A generic selection hyper-heuristic combines heuristic selection and move acceptance methods under an iterative single point-based search fr...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Published: |
Elsevier
2015
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/32188/ |
| _version_ | 1848794353210753024 |
|---|---|
| author | Asta, Shahriar Özcan, Ender |
| author_facet | Asta, Shahriar Özcan, Ender |
| author_sort | Asta, Shahriar |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | Hyper-heuristics have emerged as automated high level search methodologies that manage a set of low level heuristics for solving computationally hard problems. A generic selection hyper-heuristic combines heuristic selection and move acceptance methods under an iterative single point-based search framework. At each step, the solution in hand is modified after applying a selected heuristic and a decision is made whether the new solution is accepted or not. In this study, we represent the trail of a hyper-heuristic as a third order tensor. Factorization of such a tensor reveals the latent relationships between the low level heuristics and the hyper-heuristic itself. The proposed learning approach partitions the set of low level heuristics into two subsets where heuristics in each subset are associated with a separate move acceptance method. Then a multi-stage hyper-heuristic is formed and while solving a given problem instance, heuristics are allowed to operate only in conjunction with the associated acceptance method at each stage. To the best of our knowledge, this is the first time tensor analysis of the space of heuristics is used as a data science approach to improve the performance of a hyper-heuristic in the prescribed manner. The empirical results across six different problem domains from a benchmark indeed indicate the success of the proposed approach. |
| first_indexed | 2025-11-14T19:14:50Z |
| format | Article |
| id | nottingham-32188 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T19:14:50Z |
| publishDate | 2015 |
| publisher | Elsevier |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-321882020-05-04T17:03:13Z https://eprints.nottingham.ac.uk/32188/ A tensor-based selection hyper-heuristic for cross-domain heuristic search Asta, Shahriar Özcan, Ender Hyper-heuristics have emerged as automated high level search methodologies that manage a set of low level heuristics for solving computationally hard problems. A generic selection hyper-heuristic combines heuristic selection and move acceptance methods under an iterative single point-based search framework. At each step, the solution in hand is modified after applying a selected heuristic and a decision is made whether the new solution is accepted or not. In this study, we represent the trail of a hyper-heuristic as a third order tensor. Factorization of such a tensor reveals the latent relationships between the low level heuristics and the hyper-heuristic itself. The proposed learning approach partitions the set of low level heuristics into two subsets where heuristics in each subset are associated with a separate move acceptance method. Then a multi-stage hyper-heuristic is formed and while solving a given problem instance, heuristics are allowed to operate only in conjunction with the associated acceptance method at each stage. To the best of our knowledge, this is the first time tensor analysis of the space of heuristics is used as a data science approach to improve the performance of a hyper-heuristic in the prescribed manner. The empirical results across six different problem domains from a benchmark indeed indicate the success of the proposed approach. Elsevier 2015-04-01 Article PeerReviewed Asta, Shahriar and Özcan, Ender (2015) A tensor-based selection hyper-heuristic for cross-domain heuristic search. Information Sciences, 299 . 412 - 432. ISSN 1872-6291 Hyper-Heuristic Data Science Machine Learning Move Acceptance Tensor Analysis Algorithm Selection http://www.sciencedirect.com/science/article/pii/S0020025514011591 doi:10.1016/j.ins.2014.12.020 doi:10.1016/j.ins.2014.12.020 |
| spellingShingle | Hyper-Heuristic Data Science Machine Learning Move Acceptance Tensor Analysis Algorithm Selection Asta, Shahriar Özcan, Ender A tensor-based selection hyper-heuristic for cross-domain heuristic search |
| title | A tensor-based selection hyper-heuristic for cross-domain heuristic search |
| title_full | A tensor-based selection hyper-heuristic for cross-domain heuristic search |
| title_fullStr | A tensor-based selection hyper-heuristic for cross-domain heuristic search |
| title_full_unstemmed | A tensor-based selection hyper-heuristic for cross-domain heuristic search |
| title_short | A tensor-based selection hyper-heuristic for cross-domain heuristic search |
| title_sort | tensor-based selection hyper-heuristic for cross-domain heuristic search |
| topic | Hyper-Heuristic Data Science Machine Learning Move Acceptance Tensor Analysis Algorithm Selection |
| url | https://eprints.nottingham.ac.uk/32188/ https://eprints.nottingham.ac.uk/32188/ https://eprints.nottingham.ac.uk/32188/ |