A Methodology for Classifying Search Operators as Intensification or Diversification Heuristics

• Published in: Complexity (New York, N.Y.) Vol. 2020; no. 2020; pp. 1 - 10
• Main Authors: Ornelas-Rodriguez, Manuel, Sotelo-Figueroa, Marco Aurelio, Espinal, A., Ochoa, Gabriela, Soria-Alcaraz, Jorge Alberto, Rostro-Gonzalez, H.
• Format: Journal Article
• Language: English
• Published: Cairo, Egypt Hindawi Publishing Corporation 2020; Hindawi; John Wiley & Sons, Inc; Hindawi Limited; Hindawi-Wiley
• Subjects: Algorithms; Amplification; Classification; Distance learning; Diversification; Domains; Heuristic; Heuristic methods; Methodology; Methods; Optimization; Route planning; Search process; Vehicle routing; Mexico; Germany
• ISSN: 1076-2787; 1099-0526
• DOI: 10.1155/2020/2871835

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.