Timetabling problems often consists from various requirements which can not be satisfied together [11]. Unsatisfiable requirements can be handled within optimization criteria as soft constraints. Such soft constraints may not be satisfied if there are some contradictions. The remaining hard constraints must be still satisfied. The set of hard and soft constraints can be naturally expressed usin...

In this study, the performance of Scatter Search (SS) meta-heuristic for the post-enrolment course timetabling problems reported in recent literature was reviewed. The aim is to address the strengths and limitations of the SS structure and mechanisms; to empower more studies; to investigate the capabilities of SS; and to enhance it for solving timetabling problems as a whole. The SS is almost s...

In railways, the long-term strategic planning is process of evaluating improvements to railway network (e.g., upgrading a single track line double line) and changes composition/frequency train services adding 1 per hour along certain route). The effects different combinations infrastructure upgrades updated (also called scenarios), are usually evaluated by creating new feasible timetables follo...

In this study, the University Course Timetabling Problem (UCTP) has been investigated. This is a form of Constraint Satisfaction Problem (CSP) and belongs to the NP-complete class. The nature of a such problem is highly descriptive, a solution therefore involves combining many aspects of the problem. Although various timetabling algorithms have been continuously developed for nearly half a cent...

Timetabling for railway services often aims at optimizing travel times passengers. At the same time, restricting assumptions on passenger behavior and modeling are made. While research has shown that discrete choice models suitable to estimate distribution of passengers routes, this not been considered in timetabling yet. We investigate how integrate a into an optimization framework present two...

This paper deals with the Lecture and Tutorial Timetabling Problem at an institution in a Tunisian University. Our objective is to construct a feasible timetable for all lectures and tutorials taken by different groups of each subsection of any section in the institution. For this, we describe the timetabling problem of the institution considered and list all specific hard and soft constraints....