Exploring Hyper-heuristic Methodologies with Genetic Programming
From MaRDI portal
Publication:3401729
DOI10.1007/978-3-642-01799-5_6zbMath1184.68207OpenAlexW1536647479MaRDI QIDQ3401729
John R. Woodward, Mathew R. Hyde, Gabriela Ochoa, Ender Özcan, Graham Kendall, Edmund Kieran 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
Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (21)
A review of hyper-heuristics for educational timetabling ⋮ An iterated multi-stage selection hyper-heuristic ⋮ An ensemble algorithm with self-adaptive learning techniques for high-dimensional numerical optimization ⋮ MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration ⋮ A RNN-based hyper-heuristic for combinatorial problems ⋮ Simplifying dispatching rules in genetic programming for dynamic job shop scheduling ⋮ A multi-agent based self-adaptive genetic algorithm for the long-term car pooling problem ⋮ A scatter search based hyper-heuristic for sequencing a mixed-model assembly line ⋮ Generating meta-heuristic optimization code using ADATE ⋮ A new dispatching rule based genetic algorithm for the multi-objective job shop problem ⋮ Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism ⋮ Autonomous operator management for evolutionary algorithms ⋮ Automatic generation of algorithms for robust optimisation problems using grammar-guided genetic programming ⋮ Arc routing under uncertainty: introduction and literature review ⋮ Recent advances in selection hyper-heuristics ⋮ Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems ⋮ Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling ⋮ Simulated-annealing-based hyper-heuristic for flexible job-shop scheduling ⋮ Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs ⋮ Genetic programming with adaptive search based on the frequency of features for dynamic flexible job shop scheduling ⋮ Evolution of group-theoretic cryptology attacks using hyper-heuristics
Uses Software
This page was built for publication: Exploring Hyper-heuristic Methodologies with Genetic Programming