A simulated annealing hyper-heuristic methodology for flexible decision support
DOI10.1007/S10288-011-0182-8zbMATH Open1241.90077DBLPjournals/4or/BaiBBKM12OpenAlexW1963988630WikidataQ57387721 ScholiaQ57387721MaRDI QIDQ427562FDOQ427562
Authors: Ruibin Bai, Graham Kendall, Barry McCollum, Jacek Blazewicz, Edmund K. Burke 
Publication date: 13 June 2012
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-011-0182-8
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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Combinatorial optimization (90C27)
Cites Work
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Variable neighbourhood search: Methods and applications
- Convergence of an annealing algorithm
- A graph-based hyper-heuristic for educational timetabling problems
- Title not available (Why is that?)
- Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems
- Search Methodologies
- Case-based heuristic selection for timetabling problems
- An effective hybrid algorithm for university course timetabling
- Application of Bayesian approach to numerical methods of global and stochastic optimization
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- Using a randomised iterative improvement algorithm with composite neighbourhood structures for the university course timetabling problem
- Title not available (Why is that?)
- Handbook of metaheuristics
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
- New heuristics for one-dimensional bin-packing
- Lower bounds and reduction procedures for the bin packing problem
- Title not available (Why is that?)
- Bayesian heuristic approach to discrete and global optimization. Algorithms, visualization, software, and applications. Incl. 2 disks
- A set of examples of global and discrete optimization. Applications of Bayesian heuristic approach
- A time-predefined approach to course timetabling
- Title not available (Why is that?)
Cited In (15)
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- A review of hyper-heuristics for educational timetabling
- A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties
- Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system
- Learning to schedule heuristics for the simultaneous stochastic optimization of mining complexes
- A new model and a hyper-heuristic approach for two-dimensional shelf space allocation
- Metaheuristics for solving a multimodal home-healthcare scheduling problem
- A hyper-heuristic approach to sequencing by hybridization of DNA sequences
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Homogeneous grouping of non-prime steel products for online auctions: a case study
- A RNN-based hyper-heuristic for combinatorial problems
- Fast machine reassignment
- Local search approaches for the test laboratory scheduling problem with variable task grouping
- HyFlex: a benchmark framework for cross-domain heuristic search
- Decomposition-based algorithms for the crew scheduling and routing problem in road restoration
Uses Software
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)
