To satisfy the growing demand in railway transportation, infrastructure managers have the necessity to design more effective timetables. To this aim it is necessary to rely on automatic timetabling support tools that can provide feasible timetables with improved performance. In this paper we propose a hierarchical framework for timetable design that includes a microscopic, mesoscopic and macros...

1 The congestion problem of urban transportation is becoming increasingly critical for many 2 metropolises. The Urban Rail Transit (URT) system has attracted substantial attention due to its 3 safety, high speed, high capacity and sustainability. With a focus on providing a holistic 4 modelling framework for train scheduling problems, this paper proposes a novel optimization 5 methodology that ...

In this paper we study the design and optimization of train timetabling adapted to a dynamic demand environment. This problem arises in rapid train services which are common in most important cities. We present four formulations for the problem, with the aim of minimizing passenger average waiting time. The first one consists of a mixed integer non-linear programming model in which binary varia...

The ant colony optimisation metaheuristic has shown promise on simplified artificial instances of university course timetabling problems. However, limited work has been done applying it to practical timetabling problems. In this paper, we describe the application of the ant colony optimisation to a highly constrained real–world instance of the university course timetabling problem. We present t...

A timetable is a temporal arrangement of a set of meetings such that all given constraints are satissed. A timetabling problem can be suitably modelled in terms of a set of constraints. We use Constraint Logic Programming and develop methods, techniques and concepts for a combination of interactive and automatic timetabling of university courses and school curricula. An exemplary application of...

The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of various types. [1] Course timetabling is a multidimensional NP-Complete problem. [2] In this paper we present MultiResource Timetabling Problem (MRTP), which is our model for generalized high-school timetabling proble...

The 2nd International Timetabling Competition (ITC2007) is made up of three tracks; one on examination timetabling and two on course timetabling. This paper describes the examination timetabling track introduced as part of the competition. Both the model and the datasets are based on current real world instances introduced by EventMAP Limited. It is hoped that the interest generated as part of ...

The general timetabling problem is an assignment of activ ities to xed time intervals adhering to a prede ned set of resource availabilities Timetabling problems are di cult to solve and can be ex tremely time consuming without some computer assistance In this paper the application of constraint based reasoning to timetable generation is examined Speci cally we consider how a timetabling proble...

Automated timetabling is a current and relevant eld of research. A timetabling problem can be suitably modelled in terms of a set of constraints. Using Constraint Logic Programming we develop methods, techniques and concepts for a combination of interactive and automatic timetabling of university courses and school curricula. An exemplary application of such a timetabling system was developed f...