Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling
From MaRDI portal
Publication:2630226
DOI10.1016/j.ejor.2014.11.002zbMath1341.90049OpenAlexW2158276170MaRDI QIDQ2630226
Ruibin Bai, Jingpeng Li, Rong Qu, Yindong Shen
Publication date: 26 July 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1893/23712
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
A column generation approach for solving the examination-timetabling problem ⋮ A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A survey of search methodologies and automated system development for examination timetabling
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Case-based heuristic selection for timetabling problems
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- Hybrid variable neighbourhood approaches to university exam timetabling
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- A robust simulated annealing based examination timetabling system.
- Nurse rostering problems -- a bibliographic survey.
- Using tabu search with longer-term memory and relaxation to create examination timetables.
- Greedy randomized adaptive search procedures
- Record breaking optimization results using the ruin and recreate principle
- Theory of probability and random processes.
- A graph-based hyper-heuristic for educational timetabling problems
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems
- An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering
- A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Ant colony optimization for the examination scheduling problem
- Variable neighborhood search: Principles and applications
This page was built for publication: Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling
