A simulated annealing hyper-heuristic methodology for flexible decision support

DOI10.1007/S10288-011-0182-8zbMath1241.90077DBLPjournals/4or/BaiBBKM12OpenAlexW1963988630WikidataQ57387721 ScholiaQ57387721MaRDI QIDQ427562

Graham Kendall, Ruibin Bai, Barry McCollum, Jacek Błażewicz, Edmund Kieran 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

zbMATH Keywords

simulated annealingbin packinghyper-heuristicscourse timetabling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90)

Related Items (13)

A review of hyper-heuristics for educational timetabling ⋮ Metaheuristics for solving a multimodal home-healthcare scheduling problem ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Fast machine reassignment ⋮ Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ A RNN-based hyper-heuristic for combinatorial problems ⋮ A hyper-heuristic approach to sequencing by hybridization of DNA sequences ⋮ Decomposition-based algorithms for the crew scheduling and routing problem in road restoration ⋮ 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 ⋮ A new model and a hyper-heuristic approach for two-dimensional shelf space allocation ⋮ Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system ⋮ A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties

Uses Software

• Hyperheuristics
• Bison

Cites Work

• A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
• Case-based heuristic selection for timetabling problems
• An effective hybrid algorithm for university course timetabling
• Lower bounds and reduction procedures for the bin packing problem
• Variable neighbourhood search: Methods and applications
• 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
• A set of examples of global and discrete optimization. Applications of Bayesian heuristic approach
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• A graph-based hyper-heuristic for educational timetabling problems
• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
• A time-predefined approach to course timetabling
• Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems
• Search Methodologies
• Convergence of an annealing algorithm
• The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
• Handbook of metaheuristics
• New heuristics for one-dimensional bin-packing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A simulated annealing hyper-heuristic methodology for flexible decision support