A simulated annealing hyper-heuristic methodology for flexible decision support
From MaRDI portal
Recommendations
- A simulated annealing technique for multi-objective simulation optimization
- A combined procedure for discrete simulation-optimization problems based on the simulated annealing framework
- scientific article; zbMATH DE number 721857
- Intelligent decision model based on optimization simulated annealing algorithm
- scientific article; zbMATH DE number 2134711
- Simulated annealing heuristics for the dynamic facility layout problem
- scientific article; zbMATH DE number 906528
- Simulation-based optimization using simulated annealing with ranking and selection
Cites work
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- A graph-based hyper-heuristic for educational timetabling problems
- A set of examples of global and discrete optimization. Applications of Bayesian heuristic approach
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
- A time-predefined approach to course timetabling
- An effective hybrid algorithm for university course timetabling
- Application of Bayesian approach to numerical methods of global and stochastic optimization
- Bayesian heuristic approach to discrete and global optimization. Algorithms, visualization, software, and applications. Incl. 2 disks
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Case-based heuristic selection for timetabling problems
- Convergence of an annealing algorithm
- Handbook of metaheuristics
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- scientific article; zbMATH DE number 1728538 (Why is no real title available?)
- scientific article; zbMATH DE number 4168184 (Why is no real title available?)
- scientific article; zbMATH DE number 43985 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 558543 (Why is no real title available?)
- scientific article; zbMATH DE number 2040652 (Why is no real title available?)
- scientific article; zbMATH DE number 970353 (Why is no real title available?)
- Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems
- Lower bounds and reduction procedures for the bin packing problem
- New heuristics for one-dimensional bin-packing
- Search Methodologies
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
- Using a randomised iterative improvement algorithm with composite neighbourhood structures for the university course timetabling problem
- Variable neighbourhood search: Methods and applications
Cited in
(15)- Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system
- A new model and a hyper-heuristic approach for two-dimensional shelf space allocation
- A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties
- Homogeneous grouping of non-prime steel products for online auctions: a case study
- A RNN-based hyper-heuristic for combinatorial problems
- Decomposition-based algorithms for the crew scheduling and routing problem in road restoration
- A review of hyper-heuristics for educational timetabling
- Metaheuristics for solving a multimodal home-healthcare scheduling problem
- HyFlex: a benchmark framework for cross-domain heuristic search
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Fast machine reassignment
- A hyper-heuristic approach to sequencing by hybridization of DNA sequences
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- Learning to schedule heuristics for the simultaneous stochastic optimization of mining complexes
- Local search approaches for the test laboratory scheduling problem with variable task grouping
This page was built for publication: A simulated annealing hyper-heuristic methodology for flexible decision support
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427562)
