IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-3-319-91086-4_14.html
   My bibliography  Save this book chapter

A Classification of Hyper-Heuristic Approaches: Revisited

In: Handbook of Metaheuristics

Author

Listed:
  • Edmund K. Burke

    (University of Leicester)

  • Matthew R. Hyde

    (University of Nottingham)

  • Graham Kendall

    (University of Nottingham Malaysia Campus
    University of Nottingham)

  • Gabriela Ochoa

    (University of Stirling)

  • Ender Özcan

    (University of Nottingham)

  • John R. Woodward

    (Queen Mary University of London)

Abstract

Hyper-heuristics comprise a set of approaches that aim to automate the development of computational search methodologies. This chapter overviews previous categorisations of hyper-heuristics and provides a unified classification and definition. We distinguish between two main hyper-heuristic categories: heuristic selection and heuristic generation. Some representative examples of each category are discussed in detail and recent research trends are highlighted.

Suggested Citation

  • Edmund K. Burke & Matthew R. Hyde & Graham Kendall & Gabriela Ochoa & Ender Özcan & John R. Woodward, 2019. "A Classification of Hyper-Heuristic Approaches: Revisited," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, edition 3, chapter 0, pages 453-477, Springer.
    • Handle: RePEc:spr:isochp:978-3-319-91086-4_14
    DOI: 10.1007/978-3-319-91086-4_14
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Cui, Tianxiang & Du, Nanjiang & Yang, Xiaoying & Ding, Shusheng, 2024. "Multi-period portfolio optimization using a deep reinforcement learning hyper-heuristic approach," Technological Forecasting and Social Change, Elsevier, vol. 198(C).
    2. Pagnozzi, Federico & Stützle, Thomas, 2021. "Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems with additional constraints," Operations Research Perspectives, Elsevier, vol. 8(C).
    3. Philipp Heyken Soares & Leena Ahmed & Yong Mao & Christine L Mumford, 2021. "Public transport network optimisation in PTV Visum using selection hyper-heuristics," Public Transport, Springer, vol. 13(1), pages 163-196, March.
    4. Karimi-Mamaghan, Maryam & Mohammadi, Mehrdad & Meyer, Patrick & Karimi-Mamaghan, Amir Mohammad & Talbi, El-Ghazali, 2022. "Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: A state-of-the-art," European Journal of Operational Research, Elsevier, vol. 296(2), pages 393-422.
    5. Jorge M. Cruz-Duarte & José C. Ortiz-Bayliss & Iván Amaya & Yong Shi & Hugo Terashima-Marín & Nelishia Pillay, 2020. "Towards a Generalised Metaheuristic Model for Continuous Optimisation Problems," Mathematics, MDPI, vol. 8(11), pages 1-23, November.
    6. Zeren, Bahadır & Özcan, Ender & Deveci, Muhammet, 2024. "An adaptive greedy heuristic for large scale airline crew pairing problems," Journal of Air Transport Management, Elsevier, vol. 114(C).
    7. Vladimir Stanovov & Eugene Semenkin, 2023. "Surrogate-Assisted Automatic Parameter Adaptation Design for Differential Evolution," Mathematics, MDPI, vol. 11(13), pages 1-19, June.
    8. Goerigk, Marc & Hartisch, Michael, 2023. "A framework for inherently interpretable optimization models," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1312-1324.

    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:isochp:978-3-319-91086-4_14. 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.