IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v31y2025i2d10.1007_s10732-025-09560-7.html
   My bibliography  Save this article

Tree search hyper-heuristic with application to combinatorial optimization

Author

Listed:
  • Francisco Javier Gil-Gala

    (University of Oviedo)

  • Marko Ɖurasevic

    (University of Zagreb)

  • Maria R. Sierra

    (University of Oviedo)

  • Ramiro Varela

    (University of Oviedo)

Abstract

In this study, we investigate using the state space search paradigm to construct heuristics in the form of Priority Rules for combinatorial optimisation problems. This is an alternative to Genetic Programming (GP) and other hyper–heuristics, which represent the most common approach currently used. To do that, we define the problem of designing heuristics as a Constraint Satisfaction Problem and then exploit Any-Time Depth-First Search to solve it. To limit the effective size of the search space, we introduced a set of powerful pruning mechanisms, some embedded into the problem definition as constraints, while others by means of constraint propagation procedures. To further reduce the search space, we propose a heuristic procedure that allows the algorithm to discard some non-promising PRs, at low computational cost. The proposed approach, termed Systematic Search and Heuristic Evaluation (SSHE), was evaluated on two hard combinatorial optimisation problems, namely the One Machine Scheduling Problem with time-varying capacity (denoted by $$(1,Cap(t)||\sum T_j)$$ ( 1 , C a p ( t ) | | ∑ T j ) ) and the classic Travelling Salesman Problem. The results of the experimental study show that SSHE is quite competitive with GP in building PRs; in particular, the PRs obtained by SSHE and GP showcase similar performance, but the ones produced by SSHE have generally lower size and so better readability than the PRs produced by GP.

Suggested Citation

  • Francisco Javier Gil-Gala & Marko Ɖurasevic & Maria R. Sierra & Ramiro Varela, 2025. "Tree search hyper-heuristic with application to combinatorial optimization," Journal of Heuristics, Springer, vol. 31(2), pages 1-42, June.
  • Handle: RePEc:spr:joheur:v:31:y:2025:i:2:d:10.1007_s10732-025-09560-7
    DOI: 10.1007/s10732-025-09560-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-025-09560-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10732-025-09560-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joheur:v:31:y:2025:i:2:d:10.1007_s10732-025-09560-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.