A New Intense Stochastic Search Method Based On Hypercube Evaluation for Examination Timetabling Problems

This study of article presents a novel optimization search algorithm to solve the examination timetabling problems. These are discrete, multi-objective and combinatorial optimization problem which is generally solved using stochastic search techniques as evolutionary algorithms (EAs) and heuristic technique. In this study, the purposed optimization search algorithm is to give a brief introduction to examination timetabling problems that have been solved using Hypercube Optimization Search (HOS) algorithm which is a new intense stochastic search technique that is based on a hypercube evolution. The proposed method is applied to solve a timetabling problem which is hard to solve for many institutions of higher education and as a result this approach has shown good performance when the proposed method is compared with other performances of existing approaches.