Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/30723
Appears in Collections:Computing Science and Mathematics Journal Articles
Peer Review Status: Refereed
Title: A Methodology for Classifying Search Operators as Intensification or Diversification Heuristics
Author(s): Soria-Alcaraz, Jorge A
Ochoa, Gabriela
Espinal, Andres
Sotelo-Figueroa, Marco A
Ornelas-Rodriguez, Manuel
Rostro-Gonzalez, Horacio
Issue Date: 2020
Citation: Soria-Alcaraz JA, Ochoa G, Espinal A, Sotelo-Figueroa MA, Ornelas-Rodriguez M & Rostro-Gonzalez H (2020) A Methodology for Classifying Search Operators as Intensification or Diversification Heuristics. Complexity, 2020 p. 10, Art. No.: 2871835. https://doi.org/10.1155/2020/2871835
Abstract: Selection hyper-heuristics are generic search tools that dynamically choose, from a given pool, the most promising operator (low-level heuristic) to apply at each iteration of the search process. The performance of these methods depends on the quality of the heuristic pool. Two types of heuristics can be part of the pool: diversification heuristics, which help to escape from local optima, and intensification heuristics, which effectively exploit promising regions in the vicinity of good solutions. An effective search strategy needs a balance between these two strategies. However, it is not straightforward to categorize an operator as intensification or diversification heuristic on complex domains. Therefore, we propose an automated methodology to do this classification. This brings methodological rigor to the configuration of an iterated local search hyper-heuristic featuring diversification and intensification stages. The methodology considers the empirical ranking of the heuristics based on an estimation of their capacity to either diversify or intensify the search. We incorporate the proposed approach into a state-of-the-art hyper-heuristic solving two domains: course timetabling and vehicle routing. Our results indicate improved performance, including new best-known solutions for the course timetabling problem.
DOI Link: 10.1155/2020/2871835
Rights: Copyright © 2020 Jorge A. Soria-Alcaraz et al. .is is an open access article distributed under the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Licence URL(s): http://creativecommons.org/licenses/by/4.0/

Files in This Item:
File Description SizeFormat 
2871835.pdfFulltext - Published Version1.35 MBAdobe PDFView/Open



This item is protected by original copyright



A file in this item is licensed under a Creative Commons License Creative Commons

Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.