Pages that link to "Item:Q3401729"
From MaRDI portal
The following pages link to Exploring Hyper-heuristic Methodologies with Genetic Programming (Q3401729):
Displaying 21 items.
- A review of hyper-heuristics for educational timetabling (Q284387) (← links)
- An iterated multi-stage selection hyper-heuristic (Q322405) (← links)
- A multi-agent based self-adaptive genetic algorithm for the long-term car pooling problem (Q367225) (← links)
- Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs (Q521579) (← links)
- A scatter search based hyper-heuristic for sequencing a mixed-model assembly line (Q604932) (← links)
- Generating meta-heuristic optimization code using ADATE (Q604934) (← links)
- A new dispatching rule based genetic algorithm for the multi-objective job shop problem (Q604936) (← links)
- Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism (Q604940) (← links)
- Autonomous operator management for evolutionary algorithms (Q604944) (← links)
- An ensemble algorithm with self-adaptive learning techniques for high-dimensional numerical optimization (Q1644541) (← links)
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration (Q1652297) (← links)
- Genetic programming with adaptive search based on the frequency of features for dynamic flexible job shop scheduling (Q2057128) (← links)
- Evolution of group-theoretic cryptology attacks using hyper-heuristics (Q2059940) (← links)
- A RNN-based hyper-heuristic for combinatorial problems (Q2163777) (← links)
- Simplifying dispatching rules in genetic programming for dynamic job shop scheduling (Q2163788) (← links)
- Recent advances in selection hyper-heuristics (Q2183846) (← links)
- Automatic generation of algorithms for robust optimisation problems using grammar-guided genetic programming (Q2668793) (← links)
- Arc routing under uncertainty: introduction and literature review (Q2669541) (← links)
- Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems (Q6069740) (← links)
- Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling (Q6173707) (← links)
- Simulated-annealing-based hyper-heuristic for flexible job-shop scheduling (Q6191890) (← links)