Examination timetabling is one of the most important administrative activities that takes place
in all academic institutions. In this paper, we present a critical discussion of the research on …

Timetabling and rostering research often starts from particular real world problems. The last
two decennia have seen a large number of papers discussing cases, models and …

Exam timetabling is one of the most important administrative activities that takes place in
academic institutions. In this paper we present a critical discussion of the research on exam …

Since timetable scheduling is a discrete NP-Hard problem, it becomes a complicated case to
be solved by a heuristic approach. Gravitational Search Algorithm (GSA) was developed …

In this paper, we describe a package delivery problem and propose a method based on the
Extended Simulated Annealing (ESA) algorithm which is able to find an optimal routing path …

Practical optimization problems are often not well-defined, in the sense that the quality of a
solution cannot be easily calculated. Many algorithms that attempt to solve such problems …

Over the last decade, the examination timetabling problem has been studied by researchers
across the world, exploring a wide variety of techniques, many of which are very recent …

Examination timetabling is one of the most important administrative activities that takes place
in all academic institutions. In this paper we present a critical discussion of the research on …