Hybrid bee colony optimization for examination timetabling problems
DOI10.1016/J.COR.2014.09.005zbMATH Open1348.90238OpenAlexW2082961839MaRDI QIDQ337354FDOQ337354
Authors: M. Alzaqebah, S. Abdullah
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.09.005
Recommendations
- Hybrid artificial bee colony search algorithm based on disruptive selection for examination timetabling problems
- An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling
- Co-evolving bee colonies by forager migration: a multi-swarm based artificial bee colony algorithm for global search space
- Bee Colony Optimization - part I: The algorithm overview
- A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
simulated annealingbee colony optimization algorithmexamination timetabling problemslate acceptance Hill climbing algorithmselection strategyself-adaptive mechanism
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimization by simulated annealing
- A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
- Adaptive linear combination of heuristic orderings in constructing examination timetables
- ITC2007 solver description: a hybrid approach
- Setting the research agenda in automated timetabling: the second international timetabling competition
- Adaptive selection of heuristics for improving exam timetables
- Solving examination timetabling problems through adaption of heuristic orderings
- A survey of search methodologies and automated system development for examination timetabling
- Ant colony optimization for the examination scheduling problem
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- Novel local-search-based approaches to university examination timetabling
- Hybrid artificial bee colony search algorithm based on disruptive selection for examination timetabling problems
- Metaheuristics for Hard Optimization
Cited In (11)
- Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems
- Kidney-inspired algorithm for optimization problems
- An assignment problem and its application in education domain: a review and potential path
- Feature-based tuning of single-stage simulated annealing for examination timetabling
- An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling
- A practical three‐phase ILP approach for solving the examination timetabling problem
- A column generation approach for solving the examination-timetabling problem
- Genetic based discrete particle swarm optimization for elderly day care center timetabling
- Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling
- A cellular memetic algorithm for the examination timetabling problem
- Hybrid artificial bee colony search algorithm based on disruptive selection for examination timetabling problems
This page was built for publication: Hybrid bee colony optimization for examination timetabling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337354)