An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling
DOI10.1007/S10951-013-0352-YzbMATH Open1297.90181OpenAlexW2021695314MaRDI QIDQ398923FDOQ398923
Authors: M. Alzaqebah, S. Abdullah 
Publication date: 18 August 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-013-0352-y
Recommendations
- Hybrid artificial bee colony search algorithm based on disruptive selection for examination timetabling problems
- An adaptive artificial bee colony algorithm for global optimization
- A modified artificial bee colony algorithm based on search space division and disruptive selection strategy
- Hybrid bee colony optimization for examination timetabling problems
- Self-adaptive artificial bee colony
artificial bee colonyexamination timetabling problemsselection strategylate-acceptance hill climbingself-adaptive strategy
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- 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
- A comparative study of artificial bee colony algorithm
- A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
- A new design method based on artificial bee colony algorithm for digital IIR filters
- ITC2007 solver description: a hybrid approach
- A survey of metaheuristic-based techniques for university timetabling problems
- Setting the research agenda in automated timetabling: the second international timetabling competition
- Solving examination timetabling problems through adaption of heuristic orderings
- A survey of search methodologies and automated system development for examination timetabling
- Hybrid variable neighbourhood approaches to university exam timetabling
- Using a randomised iterative improvement algorithm with composite neighbourhood structures for the university course timetabling problem
- An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem
- 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
Cited In (9)
- Kidney-inspired algorithm for optimization problems
- Feature-based tuning of single-stage simulated annealing for examination timetabling
- A step counting hill climbing algorithm applied to university examination timetabling
- A column generation approach for solving the examination-timetabling problem
- Hybrid bee colony optimization for examination timetabling problems
- The late acceptance hill-climbing heuristic
- An adaptive flex-deluge approach to university exam timetabling
- A cellular memetic algorithm for the examination timetabling problem
- Hybrid artificial bee colony search algorithm based on disruptive selection for examination timetabling problems
Uses Software
This page was built for publication: An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398923)
