The following pages link to (Q2779809):
Displaying 39 items.
- A stochastic local search algorithm with adaptive acceptance for high-school timetabling (Q284406) (← links)
- Unified encoding for hyper-heuristics with application to bioinformatics (Q301251) (← links)
- An iterated multi-stage selection hyper-heuristic (Q322405) (← links)
- Fast machine reassignment (Q338866) (← links)
- A hyper-heuristic approach to sequencing by hybridization of DNA sequences (Q367628) (← links)
- A simulated annealing hyper-heuristic methodology for flexible decision support (Q427562) (← links)
- Self-adaptive learning based particle swarm optimization (Q433095) (← links)
- A new dispatching rule based genetic algorithm for the multi-objective job shop problem (Q604936) (← links)
- Effective patient prioritization in mass casualty incidents using hyperheuristics and the pilot method (Q647505) (← links)
- A study on meme propagation in multimemetic algorithms (Q747522) (← links)
- A (0-1) goal programming model for scheduling the tour of a marketing executive (Q858472) (← links)
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation (Q863991) (← links)
- Solving urban transit route design problem using selection hyper-heuristics (Q1634298) (← links)
- A choice function hyper-heuristic framework for the allocation of maintenance tasks in Danish railways (Q1652574) (← links)
- Advancing Shannon entropy for measuring diversity in systems (Q1722720) (← links)
- Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system (Q1752832) (← links)
- Markov chain methods for the bipartite Boolean quadratic programming problem (Q1753461) (← links)
- The Gestalt heuristic: emerging abstraction to improve combinatorial search (Q1761739) (← links)
- Monte Carlo hyper-heuristics for examination timetabling (Q1761797) (← links)
- A classification-based heuristic approach for dynamic environments (Q2091551) (← links)
- A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties (Q2116843) (← links)
- A RNN-based hyper-heuristic for combinatorial problems (Q2163777) (← links)
- Recent advances in selection hyper-heuristics (Q2183846) (← links)
- Metaheuristics ``In the large'' (Q2242238) (← links)
- Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem (Q2250117) (← links)
- Hyper-heuristic approaches for strategic mine planning under uncertainty (Q2289889) (← links)
- Two-stage based ensemble optimization framework for large-scale global optimization (Q2355073) (← links)
- On easiest functions for mutation operators in bio-inspired optimisation (Q2362365) (← links)
- Two multi-start heuristics for the \(k\)-traveling salesman problem (Q2656560) (← links)
- An evolutionary algorithm based hyper-heuristic framework for the set packing problem (Q2656742) (← links)
- Decomposition-based hyperheuristic approaches for the bi-objective cold chain considering environmental effects (Q2664375) (← links)
- A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem (Q2668655) (← links)
- When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not (Q2680763) (← links)
- Analysing the Robustness of Multiobjectivisation Approaches Applied to Large Scale Optimisation Problems (Q4649212) (← links)
- Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems (Q6069215) (← links)
- Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge (Q6092665) (← links)
- Hyper-heuristic for integrated due-window scheduling and vehicle routing problem for perishable products considering production quality (Q6094436) (← links)
- A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems (Q6112785) (← links)
- A new taxonomy of global optimization algorithms (Q6137180) (← links)