Exploring hyper-heuristic methodologies with genetic programming

DOI10.1007/978-3-642-01799-5_6MaRDI QIDQ3401729zbMATH OpenOpenAlexFDO

Authors Mathew R. Hyde, Graham Kendall, Gabriela Ochoa, Ender Ozcan, John R. Woodward, Edmund K. Burke

Publication date 1 February 2010

Published in Intelligent Systems Reference Library (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-01799-5_6

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Searching and sorting (68P10)

Recommendations

• Hyper-Heuristics: An Emerging Direction in Modern Search Technology
• Recent advances in selection hyper-heuristics
• Towards the design of heuristics by means of self-assembly
• Hyper-heuristic approaches for strategic mine planning under uncertainty
• Using a large set of low level heuristics in a hyperheuristic approach to personnel scheduling

Cited in

(28)

• Hyper-Heuristics: An Emerging Direction in Modern Search Technology
• Automatic generation of algorithms for robust optimisation problems using grammar-guided genetic programming
• A cooperative coevolutionary genetic programming hyper-heuristic for multi-objective makespan and cost optimization in cloud workflow scheduling
• Enhancing generalization in genetic programming hyper-heuristics through mini-batch sampling strategies for dynamic workflow scheduling
• A review of hyper-heuristics for educational timetabling
• Unified encoding for hyper-heuristics with application to bioinformatics
• Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling
• A multi-agent based self-adaptive genetic algorithm for the long-term car pooling problem
• An ensemble algorithm with self-adaptive learning techniques for high-dimensional numerical optimization
• Recent advances in selection hyper-heuristics
• A scatter search based hyper-heuristic for sequencing a mixed-model assembly line
• Autonomous operator management for evolutionary algorithms
• Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems
• MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
• Hyper-heuristic approaches for strategic mine planning under uncertainty
• An iterated multi-stage selection hyper-heuristic
• Simulated-annealing-based hyper-heuristic for flexible job-shop scheduling
• A RNN-based hyper-heuristic for combinatorial problems
• Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism
• Arc routing under uncertainty: introduction and literature review
• Genetic programming with adaptive search based on the frequency of features for dynamic flexible job shop scheduling
• Generating meta-heuristic optimization code using ADATE
• A new dispatching rule based genetic algorithm for the multi-objective job shop problem
• Evolution of group-theoretic cryptology attacks using hyper-heuristics
• Towards the design of heuristics by means of self-assembly
• Using a large set of low level heuristics in a hyperheuristic approach to personnel scheduling
• Simplifying dispatching rules in genetic programming for dynamic job shop scheduling
• Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs

Describes a project that uses

Uses Software

• Paramils

This page was built for publication: Exploring hyper-heuristic methodologies with genetic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3401729)