tutorial

Hyper-heuristics tutorial

Authors:

Daniel R. Tauritz,

John WoodwardAuthors Info & Claims

GECCO '18: Proceedings of the Genetic and Evolutionary Computation Conference Companion

Pages 685 - 719

https://doi.org/10.1145/3205651.3207868

Published: 06 July 2018 Publication History

Get Access

References

[1]

John Woodward. Computable and Incomputable Search Algorithms and Functions. IEEE International Conference on Intelligent Computing and Intelligent Systems (IEEE ICIS 2009), pages 871--875, Shanghai, China, November 20--22, 2009.

Google Scholar

[2]

John Woodward. The Necessity of Meta Bias in Search Algorithms. International Conference on Computational Intelligence and Software Engineering (CiSE), pages 1--4, Wuhan, China, December 10--12, 2010.

Google Scholar

[3]

John Woodward & Ruibin Bai. Why Evolution is not a Good Paradigm for Program Induction: A Critique of Genetic Programming. In Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, pages 593--600, Shanghai, China, June 12--14, 2009.

Digital Library

Google Scholar

[4]

Jerry Swan, John Woodward, Ender Ozcan, Graham Kendall, Edmund Burke. Searching the Hyper-heuristic Design Space. Cognitive Computation, 6:66--73, 2014.

Crossref

Google Scholar

[5]

Gisele L. Pappa, Gabriela Ochoa, Matthew R. Hyde, Alex A. Freitas, John Woodward, Jerry Swan. Contrasting meta-learning and hyper-heuristic research. Genetic Programming and Evolvable Machines, 15:3--35, 2014.

Digital Library

Google Scholar

[6]

Edmund K. Burke, Matthew Hyde, Graham Kendall, and John Woodward. Automating the Packing Heuristic Design Process with Genetic Programming. Evolutionary Computation, 20(1):63--89, 2012.

Digital Library

Google Scholar

[7]

Edmund K. Burke, Matthew R. Hyde, Graham Kendall, and John Woodward. A Genetic Programming Hyper-Heuristic Approach for Evolving Two Dimensional Strip Packing Heuristics. IEEE Transactions on Evolutionary Computation, 14(6):942--958, December 2010.

Digital Library

Google Scholar

[8]

Edmund K. Burke, Matthew R. Hyde, Graham Kendall, Gabriela Ochoa, Ender Ozcan and John R. Woodward. Exploring Hyper-heuristic Methodologies with Genetic Programming, Computational Intelligence: Collaboration, Fusion and Emergence, In C. Mumford and L. Jain (eds.), Intelligent Systems Reference Library, Springer, pp. 177--201, 2009.

Google Scholar

[9]

Edmund K. Burke, Matthew Hyde, Graham Kendall and John R. Woodward. The Scalability of Evolved On Line Bin Packing Heuristics. In Proceedings of the IEEE Congress on Evolutionary Computation, pages 2530--2537, September 25--28, 2007.

Google Scholar

[10]

R. Poli, John R. Woodward, and Edmund K. Burke. A Histogram-matching Approach to the Evolution of Bin-packing Strategies. In Proceedings of the IEEE Congress on Evolutionary Computation, pages 3500--3507, September 25--28, 2007.

Crossref

Google Scholar

[11]

Edmund K. Burke, Matthew Hyde, Graham Kendall, and John Woodward. Automatic Heuristic Generation with Genetic Programming: Evolving a Jack-of-all-Trades or a Master of One, In Proceedings of the Genetic and Evolutionary Computation Conference, pages 1559--1565, London, UK, July 2007.

Digital Library

Google Scholar

[12]

John R. Woodward and Jerry Swan. Template Method Hyper-heuristics, Metaheuristic Design Patterns (MetaDeeP) workshop, GECCO Comp'14, pages 1437--1438, Vancouver, Canada, July 12--16, 2014.

Digital Library

Google Scholar

[13]

Saemundur O. Haraldsson and John R. Woodward, Automated Design of Algorithms and Genetic Improvement: Contrast and Commonalities, 4th Workshop on Automatic Design of Algorithms (ECADA), GECCO Comp '14, pages 1373--1380, Vancouver, Canada, July 12--16, 2014.

Digital Library

Google Scholar

[14]

John R. Woodward, Simon P. Martin and Jerry Swan. Benchmarks That Matter For Genetic Programming, 4th Workshop on Evolutionary Computation for the Automated Design of Algorithms (ECADA), GECCO Comp '14, pages 1397--1404, Vancouver, Canada, July 12--16, 2014.

Digital Library

Google Scholar

[15]

John R. Woodward and Jerry Swan. The Automatic Generation of Mutation Operators for Genetic Algorithms, 2nd Workshop on Evolutionary Computation for the Automated Design of Algorithms (ECADA), GECCO Comp' 12, pages 67--74, Philadelphia, U.S.A., July 7--11, 2012.

Digital Library

Google Scholar

[16]

John R. Woodward and Jerry Swan. Automatically Designing Selection Heuristics. 1st Workshop on Evolutionary Computation for Designing Generic Algorithms, pages 583--590, Dublin, Ireland, 2011.

Digital Library

Google Scholar

[17]

Edmund K. Burke, Matthew Hyde, Graham Kendall, Gabriela Ochoa, Ender Ozcan, and John Woodward. A Classification of Hyper-heuristics Approaches, Handbook of Metaheuristics, pages 449--468, International Series in Operations Research & Management Science, M. Gendreau and J-Y Potvin (Eds.), Springer, 2010.

Google Scholar

[18]

Libin Hong and John Woodward and Jingpeng Li and Ender Ozcan. Automated Design of Probability Distributions as Mutation Operators for Evolutionary Programming Using Genetic Programming. Proceedings of the 16th European Conference on Genetic Programming (EuroGP 2013), volume 7831, pages 85--96, Vienna, Austria, April 3--5, 2013.

Digital Library

Google Scholar

[19]

Ekaterina A. Smorodkina and Daniel R. Tauritz. Toward Automating EA Configuration: the Parent Selection Stage. In Proceedings of CEC 2007 - IEEE Congress on Evolutionary Computation, pages 63--70, Singapore, September 25--28, 2007.

Google Scholar

[20]

Brian W. Goldman and Daniel R. Tauritz. Self-Configuring Crossover. In Proceedings of the 13th Annual Conference Companion on Genetic and Evolutionary Computation (GECCO '11), pages 575--582, Dublin, Ireland, July 12--16, 2011.

Digital Library

Google Scholar

[21]

Matthew A. Martin and Daniel R. Tauritz. Evolving Black-Box Search Algorithms Employing Genetic Programming. In Proceedings of the 15th Annual Conference Companion on Genetic and Evolutionary Computation (GECCO '13), pages 1497--1504, Amsterdam, The Netherlands, July 6--10, 2013.

Digital Library

Google Scholar

[22]

Nathaniel R. Kamrath, Brian W. Goldman and Daniel R. Tauritz. Using Supportive Coevolution to Evolve Self-Configuring Crossover. In Proceedings of the 15th Annual Conference Companion on Genetic and Evolutionary Computation (GECCO '13), pages 1489--1496, Amsterdam, The Netherlands, July 6--10, 2013.

Digital Library

Google Scholar

[23]

Matthew A. Martin and Daniel R. Tauritz. A Problem Configuration Study of the Robustness of a Black-Box Search Algorithm Hyper-Heuristic. In Proceedings of the 16th Annual Conference Companion on Genetic and Evolutionary Computation (GECCO '14), pages 1389--1396, Vancouver, BC, Canada, July 12--16, 2014.

Digital Library

Google Scholar

[24]

Sean Harris, Travis Bueter, and Daniel R. Tauritz. A Comparison of Genetic Programming Variants for Hyper-Heuristics. In Proceedings of the 17th Annual Conference Companion on Genetic and Evolutionary Computation (GECCO '15), pages 1043--1050, Madrid, Spain, July 11--15, 2015.

Digital Library

Google Scholar

[25]

Matthew A. Martin and Daniel R. Tauritz. Hyper-Heuristics: A Study On Increasing Primitive-Space. In Proceedings of the 17th Annual Conference Companion on Genetic and Evolutionary Computation (GECCO '15), pages 1051--1058, Madrid, Spain, July 11--15, 2015.

Digital Library

Google Scholar

[26]

Alex R. Bertels and Daniel R. Tauritz. Why Asynchronous Parallel Evolution is the Future of Hyper-heuristics: A CDCL SAT Solver Case Study. In Proceedings of the 18th Annual Conference Companion on Genetic and Evolutionary Computation (GECCO '16), pages 1359--1365, Denver, Colorado, USA, July 20--24, 2016.

Digital Library

Google Scholar

[27]

Aaron S. Pope, Daniel R. Tauritz and Alexander D. Kent. Evolving Random Graph Generators: A Case for Increased Algorithmic Primitive Granularity. In Proceedings of the 2016 IEEE Symposium Series on Computational Intelligence (IEEE SSCI 2016), Athens, Greece, December 6--9, 2016.

Google Scholar

[28]

Aaron S. Pope, Daniel R. Tauritz and Alexander D. Kent. Evolving Multi-level Graph Partitioning Algorithms. In Proceedings of the 2016 IEEE Symposium Series on Computational Intelligence (IEEE SSCI 2016), Athens, Greece, December 6--9, 2016.

Google Scholar

[29]

Islam Elnabarawy, Daniel R. Tauritz, Donald C. Wunsch. Evolutionary Computation for the Automated Design of Category Functions for Fuzzy ART: An Initial Exploration. In Proceedings of the 19th Annual Conference Companion on Genetic and Evolutionary Computation (GECCO'17), pages 1133--1140, Berlin, Germany, July 15--19, 2017.

Digital Library

Google Scholar

[30]

Adam Harter, Daniel R. Tauritz, William M. Siever. Asynchronous Parallel Cartesian Genetic Programming. In Proceedings of the 19th Annual Conference Companion on Genetic and Evolutionary Computation (GECCO'17), pages 1820--1824, Berlin, Germany, July 15--19, 2017.

Digital Library

Google Scholar

[31]

Marketa Illetskova, Alex R. Bertels, Joshua M. Tuggle, Adam Harter, Samuel Richter, Daniel R. Tauritz, Samuel Mulder, Denis Bueno, Michelle Leger and William M. Siever. Improving Performance of CDCL SAT Solvers by Automated Design of Variable Selection Heuristics. In Proceedings of the 2017 IEEE Symposium Series on Computational Intelligence (SSCI 2017), Honolulu, Hawaii, U.S.A., November 27 - December 1, 2017.

Crossref

Google Scholar

[32]

John R. Woodward and Jerry Swan. 2014. Template method hyper-heuristics. In Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation (GECCO Comp '14). ACM, New York, NY USA, 1437--1438.

Digital Library

Google Scholar

[33]

Saemundur O. Haraldsson and John R. Woodward. 2014. Automated design of algorithms and genetic improvement: contrast and commonalities. In Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation (GECCO Comp '14). ACM, New York, NY, USA, 1373--1380.

Digital Library

Google Scholar

[34]

John R. Woodward, Jerry Swan, "Why classifying search algorithms is essential", Progress in Informatics and Computing (PIC) 2010 IEEE International Conference on, vol. 1, pp. 285--289, 2010.

Crossref

Google Scholar

[35]

Hong L., Woodward J., Li J., Özcan E. (2013) Automated Design of Probability Distributions as Mutation Operators for Evolutionary Programming Using Genetic Programming. In: Krawiec K., Moraglio A., Hu T., Etaner-Uyar A.Ş., Hu B. (eds) Genetic Programming. EuroGP 2013. Lecture Notes in Computer Science, vol 7831. Springer, Berlin, Heidelberg

Digital Library

Google Scholar

Cited By

View all

Scott EDe Jong K(2023)First Complexity Results for Evolutionary Knowledge TransferProceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms10.1145/3594805.3607137(140-151)Online publication date: 30-Aug-2023
https://dl.acm.org/doi/10.1145/3594805.3607137

Recommendations

A comparative study of hyper-heuristics for solving the school timetabling problem
SAICSIT '13: Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference

Hyper-heuristics have proven to be an effective means of obtaining generalized solutions to optimization problems. One such domain in which they have been a success is educational timetabling. However, all the research in this area has focused on ...
Batched Mode Hyper-heuristics
LION 7: Revised Selected Papers of the 7th International Conference on Learning and Intelligent Optimization - Volume 7997

A primary role for hyper-heuristics is to control search processes based on moves generated by neighbourhood operators. Studies have shown that such hyper-heuristics can be effectively used, without modification, for solving unseen problem instances not ...
Selection Hyper-Heuristic Using a Portfolio of Derivative Heuristics
GECCO Companion '15: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation

Generally, we distinguish between two classes of hyper-heuristic approaches, heuristic selection and heuristic generation. The former one works with existing heuristics and tries to find their optimal order for solving the instance. The later approach ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

GECCO '18: Proceedings of the Genetic and Evolutionary Computation Conference Companion

July 2018

1968 pages

ISBN:9781450357647

DOI:10.1145/3205651

Editor:
Hernan Aguirre
Shinshu University
,
General Chair:
Keiki Takadama
The University of Electro-Communications

Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 July 2018

Check for updates

Qualifiers

Tutorial

Conference

GECCO '18

Sponsor:

SIGEVO

GECCO '18: Genetic and Evolutionary Computation Conference

July 15 - 19, 2018

Kyoto, Japan

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
151
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Scott EDe Jong K(2023)First Complexity Results for Evolutionary Knowledge TransferProceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms10.1145/3594805.3607137(140-151)Online publication date: 30-Aug-2023
https://dl.acm.org/doi/10.1145/3594805.3607137

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

A comparative study of hyper-heuristics for solving the school timetabling problem

Batched Mode Hyper-heuristics

Selection Hyper-Heuristic Using a Portfolio of Derivative Heuristics