A survey of practical applications of examination timetabling algorithms
Operations Research
Journal of Computational Physics
A Survey of Automated Timetabling
Artificial Intelligence Review
Tabu Search Techniques for Examination Timetabling
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
New Algorithms for Examination Timetabling
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
A perspective on bridging the gap between theory and practice in university timetabling
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
An artificial fish swarm algorithm based and ABC supported qos unicast routing scheme in NGI
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
Dual sequence simulated annealing with round-robin approach for university course timetabling
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
A novel similarity measure for heuristic selection in examination timetabling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
A hybrid multi-objective evolutionary algorithm for the uncapacitated exam proximity problem
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Information Sciences: an International Journal
Supervised hybrid feature selection based on PSO and rough sets for medical diagnosis
Computer Methods and Programs in Biomedicine
Hi-index | 0.00 |
A hybrid fish swarm algorithm has been proposed to solve exam timetabling problems where the movement of the fish is simulated when searching for food inside water (refer as a search space). The search space is categorised into three categories which are crowded, not crowded and empty areas. The movement of fish (where the fish represents the solution) is determined based on a Nelder-Mead simplex search algorithm. The quality of the solution is enhanced using a great deluge algorithm or a steepest descent algorithm. The proposed hybrid approach is tested on a set of benchmark examination timetabling problems in comparison with a set of state-of-the-art methods from the literature. The experimental results show that the proposed hybrid approach is able to produce promising results for the test problem.