The automatic design of hyper-heuristic framework with gene expression programming for combinatorial optimization problems

Sabar, Nasar and Ayob, Masri and Kendall, Graham and Qu, Rong (2014) The automatic design of hyper-heuristic framework with gene expression programming for combinatorial optimization problems. IEEE Transactions on Evolutionary Computation . ISSN 1089-778X (In Press)

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (784kB) | Preview


Hyper-heuristic approaches aim to automate heuristic design in order to solve multiple problems instead of designing tailor-made methodologies for individual problems. Hyper-heuristics accomplish this through a high level heuristic (heuristic selection mechanism and an acceptance criterion). This automates heuristic selection, deciding whether to accept or reject the returned solution. The fact that different problems or even instances, have different landscape structures and complexity, the design of efficient high level heuristics can have a dramatic impact on hyper-heuristic performance. In this work, instead of using human knowledge to design the high level heuristic, we propose a gene expression programming algorithm to automatically generate, during the instance solving process, the high level heuristic of the hyper-heuristic framework. The generated heuristic takes information (such as the quality of the generated solution and the improvement made) from the current problem state as input and decides which low level heuristic should be selected and the acceptance or rejection of the resultant solution. The benefit of this framework is the ability to generate, for each instance, different high level heuristics during the problem solving process. Furthermore, in order to maintain solution diversity, we utilize a memory mechanism which contains a population of both high quality and diverse solutions that is updated during the problem solving process. The generality of the proposed hyper-heuristic is validated against six well known combinatorial optimization problem, with very different landscapes, provided by the HyFlex software. Empirical results comparing the proposed hyper-heuristic with state of the art hyper-heuristics, conclude that the proposed hyper-heuristic generalizes well across all domains and achieves competitive, if not superior, results for several instances on all domains.

Item Type: Article
Additional Information: (c) 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
Keywords: Hyper-heuristics, Gene Expression Programming, Timetabling, Vehicle Routing, Dynamic Optimization
Schools/Departments: University of Nottingham UK Campus > Faculty of Science > School of Computer Science
Identification Number:
Depositing User: Qu, Rong
Date Deposited: 19 Feb 2015 09:17
Last Modified: 17 Sep 2016 00:27

Actions (Archive Staff Only)

Edit View Edit View