Cited By
View all- Krasnogor N(2012)Memetic AlgorithmsHandbook of Natural Computing10.1007/978-3-540-92910-9_29(905-935)Online publication date: 2012
Evolving heuristics with genetic programming
Pages 601 - 602
Abstract
Hyper-Heuristics are methods to choose and combine heuristics to generate new ones. In this work, we use a grammar-based genetic programming system as a Hyper-Heuristic framework. The framework is used for evolving effective incremental solvers for SAT (Inc*). Tests against well-known local search heuristics on a variety of benchmark problems reveal that the evolved heuristics are superior.
References
[1]
M. B. Bader-El-Den and R. Poli. A GP-based hyper-heuristic framework for evolving 3-SAT heuristics. In GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation, volume 2, pages 1749--1749, London, 7--11 July 2007. ACM Press.
[2]
M. B. Bader-El-Din and R. Poli. Generating SAT local-search heuristics using a GP hyper-heuristic framework. Proceedings of the 8th International Conference on Artificial Evolution, 36(1):141--152, 2007.
[3]
M. B. Bader-El-Din and R. Poli. Inc*: An incremental approach to improving local search heuristics. In EvoCOP 2008. Springer, March 2008. (to appear).
[4]
E. K. Burke, G. Kendall, J. Newall, E. Hart, P. Ross, and S. Schulenburg. Hyper-heuristics: an emerging direction in modern search technology. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 457--474. Kluwer Academic Publishers, 2003.
[5]
R. Poli, W. B. Langdon, and N. F. McPhee. A field guide to genetic programming. Published by lulu.com. Freely available at http://www.gp-field-guide.org.uk, 2008.
[6]
B. Selman, H. J. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In P. Rosenbloom and P. Szolovits, editors, Proceedings of the Tenth National Conference on Artificial Intelligence, pages 440--446, Menlo Park, California, 1992. AAAI Press.
Index Terms
- Evolving heuristics with genetic programming
Recommendations
Automated discovery of local search heuristics for satisfiability testing
The development of successful metaheuristic algorithms such as local search for a difficult problem such as satisfiability testing (SAT) is a challenging task. We investigate an evolutionary approach to automating the discovery of new local search ...
A genetic programming hyper-heuristic approach for the multi-skill resource constrained project scheduling problem
Highlights- A GP-HH scheme is proposed to solve the MS-RCPSP.
- A repair-based decoding ...
AbstractMulti-skill resource-constrained project scheduling problem (MS-RCPSP) is one of the most investigated problems in operations research and management science. In this paper, a genetic programming hyper-heuristic (GP-HH) algorithm is ...
A Comparison of Genetic Programming Variants for Hyper-Heuristics
GECCO Companion '15: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary ComputationGeneral-purpose optimization algorithms are often not well suited for real-world scenarios where many instances of the same problem class need to be repeatedly and efficiently solved. Hyper-heuristics automate the design of algorithms for a particular ...
Comments
Information & Contributors
Information
Published In
July 2008
1814 pages
Copyright © 2008 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 12 July 2008
Check for updates
Author Tags
Qualifiers
- Poster
Conference
Acceptance Rates
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 184Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Mar 2025
Other Metrics
Citations
Cited By
View all- Krasnogor N(2012)Memetic AlgorithmsHandbook of Natural Computing10.1007/978-3-540-92910-9_29(905-935)Online publication date: 2012
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in