The urban transport planning process has four basic activities: network design, timetable construction, vehicle scheduling and crew scheduling. In this work we focus on the urban bus timetable construction problem which has two sub-activities: bus frequency calculation and bus departures setting. Typically, these sub-activities are done sequentially, which has some drawbacks: to overcome these ...

We consider an academic timetabling and rostering problem involving periodic retraining of large numbers of employees at an Australian electricity distributor. This problem is different from traditional high-school and university timetabling problems studied in the literature in several aspects. We propose a three-stage heuristic consisting of timetable generation, timetable improvement, and tr...

In this paper we propose a novel approach that combines compatible examinations in order to accelerate both the initial timetable construction, as well as a later search. The conditions for combining exams are described, and we show that we are able to offer some guarantees as to the quality of solutions that remain in the reduced search space. The approach is applied to one of the standard ben...

The World Wide Web provides a variety of information and services, however, its usability is still under discussion. In order to clarify concrete difficulties in Web use, the behavior of younger and elderly users was observed with eye tracking during a timetable search task using electronic timetable systems on the Web. The result shows on the one hand common difficulties for younger and elderl...

In this paper a variable neighborhood search approach as a method for solving combinatory optimization problems is presented. A variable neighborhood search based algorithm for solving the problem concerning the university course timetable design has been developed. This algorithm is used to solve the real problem regarding the university course timetable design. It is compared with other algor...

A feasible exam timetable is generated using a method based on constraint satisfaction and heuristics. We investigate the usage of tabu search to further improve the quality of the exam timetable. Different length of short term tabu list and the long term tabu list is examined. Short term tabu list without long term tabu list and vice versa is also tested. Different search iteration based on ma...

the paper discusses the current state of research concerning railway network timetabling and traffic management. timetable effectiveness is governed by frequency, regularity, accurate running, recovery and layover times, as well as minimal headway, buffer times and waiting times. analytic (queuing) models and stochastic microsimulation are predominantly used for estimation of waiting times and ...