Real-life examination timetabling

Solving a real-world university examination timetabling is an intractable problem. Examination timetabling problems (ETP) can be defined as a problem of assigning a set of final examinations schedules to a given number of timeslots and rooms subject to a set of constraints. These constraints are usually divided into hard and soft constraints. Hard constraints must be satisfied under any circumstances. Whilst, soft constraints are not only essential but also should be satisfied as much as possible. Due to the complexity of the problem, it is usually impossible to have solutions that satisfy all soft constraints. The quality of the timetable is measured based on soft constraints violation. A weighted penalty/value is attached to each violation of the soft constraint and the objective is to minimize the total penalty value of these violations. Although there have been a numerous approaches in solving the ETP, but this paper only focus on Genetic Algorithm (GA) method based on the fact that it is robust and can fits into complex problem space. This paper gives a summary of the GA method on ETP and it aims in helping other researcher to shorten their time in understanding the application of GA in the selected problem.


 
 
 
 Abstract:
 Aim: This study is on tackling Examination Timetabling Problem (ETP) of the Faculty of Economics And Administrative Sciences (FEAS) of the Ankara HBV University summer school, where the courses of fall and spring semesters are offered simultaneously and regulations on restricting enrollments in inter-department electives or in-department courses of distinct years are relaxed. Thus, the complexity of the nature of the ETP problem is exacerbated. The direct heuristics based on successive assignments that the university normally adopts was proven inadequate for assuming standard regulations hence, another approach we explain in this paper was needed.
 Design / Research methods: The ETP was formulated as a Linear Mixed-Integer Program (LMIP) and decomposed into three stages; timetabling exams, room assignment, student allocation. To manage the conflict between the stakeholders of the examination procedure, a lexicographic optimization process based on the priority of the parties was undertaken.
 Conclusions / findings: After a recursive timetabling process based on a trial-and-error method a clash-free timetable was generated and, a room assignment plan that minimizes the total number of proctoring duties, usage of higher floor rooms and total crowdedness of rooms respectively was put into action. Therefore no student group experienced any clashing exams, the faculty members saved time that can be spent on research instead, since the room usage was better planned the costs (elevator usage, lighting, air conditioning, the labor of the janitors) were assumed to be decreased.
 Originality / value of the article: Each examination period bares a different ETP due to its problem-specific nature (number of courses offered, structure of student enrollments, availability of rooms, etc.). Summer schools provide a more irregular structure that demands special attention, a trial-and-error reformulation of the ETP in our case. In addition, the traditional formulations of the ETP, to the extent we have been able to scan, do not include the minimization of the crowdedness of the rooms. Thus, in creating a more comfortable environment, easier to monitor exams and, ability in handling unexpected dysfunctionalities (broken classroom equipment, etc.) this study is novel.
 Limitations of the research: The algorithms to solve an ETP formulated as an LMIP are of high complexity therefore, we are not able to assert the optimality of our suggested solutions acquired within time limitations.
 
 
 
 
 Keywords: examination timetabling, group decision making, lexicographic optimization, linear mixed-integer programming
 JEL: C44, C61, M12
 
 
 

A double evolutionary pool memetic algorithm is proposed to solve the examination timetabling problem. To improve the performance of the proposed algorithm, two evolutionary pools, that is, the main evolutionary pool and the secondary evolutionary pool, are employed. The genetic operators have been specially designed to fit the examination timetabling problem. A simplified version of the simulated annealing strategy is designed to speed the convergence of the algorithm. A clonal mechanism is introduced to preserve population diversity. Extensive experiments carried out on 12 benchmark examination timetabling instances show that the proposed algorithm is able to produce promising results for the uncapacitated examination timetabling problem.

Hyper-heuristics can be identified as methodologies that search the space generated by a finite set of low level heuristics for solving search problems. An iterative hyper-heuristic framework can be thought of as requiring a single candidate solution and multiple perturbation low level heuristics. An initially generated complete solution goes through two successive processes (heuristic selection and move acceptance) until a set of termination criteria is satisfied. A motivating goal of hyper-heuristic research is to create automated techniques that are applicable to a wide range of problems with different characteristics. Some previous studies show that different combinations of heuristic selection and move acceptance as hyper-heuristic components might yield different performances. This study investigates whether learning heuristic selection can improve the performance of a great deluge based hyper-heuristic using an examination timetabling problem as a case study.

University examination timetabling problem is a complicated, multi-constraint combinatorial optimization problem. The current grouping genetic algorithm could get a better optimistic solution. Although the block encoding technique was applied in, the probabilities of crossover and mutation operation were still based on simple genetic algorithm. So the universality of this algorithm is not very well because the same probabilities of crossover and mutation operation could obtain different effects in different cases of examination arrangements. To find a more general algorithm, an Improved Adaptive Genetic Algorithm (IAGA) for practical applications was presented in this paper. IAGA can reconstruct the probabilities of crossover and mutation operation according to different cases of examination arrangements. To make further improvement of its convergence speed and overcome premature problem, IAGA appropriately adjusts mutation operation by Population's Maturity in addition. Moreover, the Memory Operator was added into the Algorithm to ensure getting the global optimization solution. Finally, IAGA was tested in function optimization and Examination Timetabling problems, and the experiments show that the results are promoted very well.

An informed genetic algorithm for the examination timetabling problem

The examination timetabling problem involves assigning exams to a specific or limited number of timeslots and rooms with the aim of satisfying all hard constraints (without compromise) and satisfying the soft constraints as far as possible. Most of the techniques reported in the literature have been applied to simplified examination benchmark data sets. In this paper, we bridge the gap between research and practice by investigating a problem taken from the real world. This paper introduces a modified and extended great deluge algorithm (GDA) for the examination timetabling problem that uses a single, easy to understand parameter. We investigate different initial solutions, which are used as a starting point for the GDA, as well as altering the number of iterations. In addition, we carry out statistical analyses to compare the results when using these different parameters. The proposed methodology is able to produce good quality solutions when compared with the solution currently produced by the host organisation, generated in our previous work and from the original GDA.

Among the methods proposed for identifying the number of latent traits in multidimensional IRT models, DETECT has attracted the attention of both methodologists and applied researchers as a nonparametric counterpart to other procedures. The current study investigated the overall performance of the DETECT procedure and its outcomes using a real-data sampling design recommended by MacCallum (2003) and compared the results from a purely simulated data set that was generated with a well-specified “perfect” model. The comparison revealed that the sampling behavior of the maximized DETECT value and R-ratio statistics was quite robust to minor factors and other model misspecifications that potentially exist in the real data set, as there were negligible differences between the results of the real and simulated data sets. Item classification accuracy was also nearly identical for the real and simulated data sets. The accuracy of the identified number of dimensions reported by DETECT was the only outcome with an obvious difference between the purely simulated data set and the real data set. While the difference was small for smaller sample sizes, the identified number of dimensions was more accurate for larger sample sizes when the population data set was purely simulated. In many instances, exploratory DETECT analysis outperformed the cross-validated DETECT analysis in terms of overall accuracy.

An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables

We introduce the term ‘mixed social environments’ as a strategic learning construct to augment student interaction when utilizing virtual world environments such as Second Life in the classroom. While an increasing number of institutions are investigating the use of virtual world environments for enhanced learning, at present there are at least three major areas that are underdeveloped: interdisciplinary research, documentation of best practices, and exploration of the use of mixed social environments. In the spring of 2007, a new interdisciplinary research seminar addressing these aspects was offered at a large American university. We present an overview of the resultant learning artifacts, outcomes, and research questions in hopes of helping to inform best practices, expand interdisciplinary research, and assist in the design of future mixed social environments for enhanced learning.

Ensuring that test-score use brings about socially positive consequences for test-takers is an important aspect of test validation. While many studies use an inductive approach to evaluate test consequences, few studies have implemented Appraisal analysis. To that end, this case study investigated the test consequences of an English reading placement test administered at a large American university. In this study, English as a second language (ESL) students (n=8) who took the placement test and an ESL reading course were interviewed; an Appraisal analysis was conducted to identify the students’ positive and/or negative perceptions toward the placement test and reading course. Using an argument-based approach to validity framework, the findings were treated as evidence to evaluate the test consequences of the placement test. The results showed that, while taking the ESL course helped students gain some valuable academic reading skills, students felt that test anxiety, fatigue, and verbally demanding questions hindered their test performances. Understanding what students experienced while taking the test can help test-developers devise solutions that will improve the test-taking situation for future test-takers. This study also illustrates how an Appraisal analysis of test-takers’ discourses can provide a systematic and fine-grained approach to evaluating positive and/or negative test consequences.

This paper takes a critical interactional sociolinguistic approach to examine the construction ofinterculturality(e.g., Nishizaka 1995; Mori 2003) through the use of vocatives in the discourse of a multi-cultural graduate student project group at a large American university. Interviews and descriptive information contextualize the analysis to demonstrate that the use of vocatives achieves a tight linking of inclusion but also inequality in the group talk that involves the Japanese member. The group’s vocatives show a shared interest in bringing the Japanese member into the interaction, but they also construct unequal rights to the floor. They contribute to an interculturality of subordination and an artificial sense of intimacy, characteristics consistent with the institutional setting of the group and attitudes members held about each other. In this environment, the status quo of power identities and a deficit view of the Japanese member goes largely uncontested and limits the ability of American members to learn from their Japanese partner.

Extensive Copy-Number Variation of the Human Olfactory Receptor Gene Family

In general, uncapacitated exam timetabling is conducted manually, which can be time-consuming. Many studies aim to automate and optimize uncapacitated exam timetabling. However, pinpointing the most efficient algorithm is challenging since most studies assert that their algorithms surpass previous ones. To identify the optimal algorithm, this research evaluates the performance of four algorithms: Hill climbing (HC), simulated annealing (SA), great deluge (GD), and tabu search (TS) in addressing the exam timetabling problem. The Kempe chain operator’s influence on optimization solutions is also examined. A simple random method is employed to select the low-level heuristic (LLH). The Carter (Toronto) dataset served as the test material, with each algorithm undergoing 200,000 iterations for comparison. The results indicate that the TS algorithm is superior, providing the best solution in 13 instances. The use of a tabu list enhanced the search process’s efficiency by preventing redundant modifications. The Kempe chain LLH exhibited a tendency towards achieving better solutions.

Hybrid bee colony optimization for examination timetabling problems