A Comparison of Genetic Programming Variants for Hyper-Heuristics
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Modern society is faced with ever more complex problems, many of which can be formulated as generate-and-test optimization problems. General-purpose optimization algorithms are not well suited for real-world scenarios where many instances of the same problem class need to be repeatedly and efficiently solved, such as routing vehicles over highways with constantly changing traffic flows, because they are not targeted to a particular scenario. Hyper-heuristics automate the design of algorithms to create a custom algorithm for a particular scenario. Hyper-heuristics typically employ Genetic Programming (GP) and this project has investigated the relationship between the choice of GP and performance in Hyper-heuristics. Results are presented demonstrating the existence of problems for which there is a statistically significant performance differential between the use of different types of GP.
- Research Organization:
- Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE National Nuclear Security Administration (NNSA)
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 1177599
- Report Number(s):
- SAND--2015-2326R; 579486
- Country of Publication:
- United States
- Language:
- English
Similar Records
Visualization for Hyper-Heuristics: Back-End Processing
A Library of Local Search Heuristics for the Vehicle Routing Problem