New Insights Into Diversification of Hyper-Heuristics

• Published in: IEEE transactions on cybernetics Vol. 44; no. 10; pp. 1747 - 1761
• Main Authors: Ren, Zhilei, Jiang, He, Xuan, Jifeng, Hu, Yan, Luo, Zhongxuan
• Format: Journal Article
• Language: English
• Published: United States IEEE 01-10-2014; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Acronyms; Genetic programming; Glass; Grammar; Grammars; Heuristic; Hyper-heuristics; instance perturbation; Ising spin glass; linear genetic programming; Linear programming; Low level; Mathematical models; p-median; Perturbation methods; Problem-solving; Run time (computers); Search problems; Spin glass; Vectors; instance perturbation; p -median; Hyper-heuristics; Ising spin glass; linear genetic programming
• ISSN: 2168-2267; 2168-2275
• DOI: 10.1109/TCYB.2013.2294185

There has been a growing research trend of applying hyper-heuristics for problem solving, due to their ability of balancing the intensification and the diversification with low level heuristics. Traditionally, the diversification mechanism is mostly realized by perturbing the incumbent solutions to escape from local optima. In this paper, we report our attempt toward providing a new diversification mechanism, which is based on the concept of instance perturbation. In contrast to existing approaches, the proposed mechanism achieves the diversification by perturbing the instance under solving, rather than the solutions. To tackle the challenge of incorporating instance perturbation into hyper-heuristics, we also design a new hyper-heuristic framework HIP-HOP (recursive acronym of HIP-HOP is an instance perturbation-based hyper-heuristic optimization procedure), which employs a grammar guided high level strategy to manipulate the low level heuristics. With the expressive power of the grammar, the constraints, such as the feasibility of the output solution could be easily satisfied. Numerical results and statistical tests over both the Ising spin glass problem and the p-median problem instances show that HIP-HOP is able to achieve promising performances. Furthermore, runtime distribution analysis reveals that, although being relatively slow at the beginning, HIP-HOP is able to achieve competitive solutions once given sufficient time.