Maintaining high on-time performance and at the same time having high capacity utilization is a challenge for several railway traffic systems. The system becomes sensitive to disturbances and delays are easily propagating in the network. One way to handle this problem is to create more robust timetables; timetables that can absorb delays and prevent them from propagating. This paper presents an...

Unexpected disruptions occur for many reasons in railway networks and cause delays, cancellations, and, eventually, passenger inconvenience. This research focuses on the railway timetable rescheduling problem from a macroscopic point of view in case of large disruptions. The originality of our approach is to integrate three objectives to generate a disposition timetable: the passenger satisfact...

One of the main challenges for any university administrations is building a timetable for course sessions. Such a challenge not only relates to how to build a usable timetable but also how to build an optimal timetable at the same time. The university course timetable is classified as an NP-Complete problem. In general, it means assigning predefined courses to certain rooms and timeslots under ...

During the last years, impressive speed-up techniques for DIJKSTRA’s algorithm have been developed. Unfortunately, recent research mainly focused on road networks. However, fast algorithms are also needed for other applications like timetable information systems. Even worse, the adaption of recently developed techniques to timetable information is more complicated than expected. In this work, w...

This paper presents a technique to construct generic university timetables using case-based reasoning (CBR) with genetic algorithms (GAs). The case-based reasoning methodology allows a past memory of timetables to be stored and accessed via retrieval mechanisms, finding a past solution most fitting to the new timetable input problem. In the instance that a past solution is not well suited to th...

Timetable generation is a combinatorial optimization problem. Meta Heuristic methods and Evolutionary Algorithms have given the best results when it comes to solving the problem of timetable generation. In our paper the problem of timetable generation for the Computer Science and Engineering Dept. of BMS College of Engineering is solved with the help of Genetic Algorithm and Tabu Search which b...

We investigate the influence of loan and syndicate characteristics and information disclosure and legal environment factors on the arrangement timetable of bank loan syndications (measured as the time elapsed from the launching until the completion of the deal) from 68 countries over the 1992-2006 period. Employing accelerated failure time models from survival analysis methodology, we find that...

In recent years, many speed-up techniques for DIJKSTRA’s algorithm have been developed. Unfortunately, research mainly focused on road networks although fast algorithms are also needed for other applications like timetable information systems. Even worse, the adaption of recently developed techniques to graphs deriving from timetable information problems is often more complicated than expected....

Efficient evaluation and comparison criteria of network timetables are not yet well-defined and planners usually have to rely on time-consuming simulations of (sub)networks. PETER (Performance Evaluation of Timed Events in Railways) is a new analytical tool that quickly assesses network performance indicators in a deterministic setting corresponding to the design times used in timetable constru...