During the last years, impressive progress has been achieved in the field of speed-up techniques for DIJKSTRA’s algorithm. Due to the availability of road networks, most speed-up techniques were developed for such networks. The fastest known techniques use contraction, a procedure that reduces the graph size, in order to gain their impressive speed-ups. However, in a recent work it was observed...

Timetable construction belongs to the most important optimization problems in public transport. Finding optimal or near-optimal timetables under the subsidiary conditions of minimizing travel times and other criteria is a targeted contribution to the functioning of public transport. In addition to efficiency (given, e.g., by minimal average travel times), a significant feature of a timetable is...

In this paper we deal with the problem of building a timetable for the courses of a university faculty. We propose an integer linear programming approach based on column generation. Each column is associated to a weekly timetable of a single course. The constraints referring to classroom occupancy and non overlapping in time of courses are in the integer linear programming matrix. The constrain...

This paper proposes Hybrid Intelligent Water Drops (HIWD) algorithm to solve Tamhidi programs uncapacitated examination timetabling problem in Universiti Sains Islamic Malaysia (USIM). Intelligent Water Drops algorithm (IWD) is a population-based algorithm where each drop represents a solution and the sharing between the drops during the search lead to better drops. The results of this study pr...

Train crew management involves the development of a duty timetable for each of the drivers (crew) to cover a given train timetable in a rail transport organization. This duty timetable is spread over a certain period, known as the roster planning horizon. Train crew management may arise either from the planning stage, when the total number of crew and crew distributions are to be determined, or...

This paper describes the development and implementation of an optimization model used to resolve disruptions to an operating schedule in the rail industry. Alterations to the existing train timetable and crewing roster are made simultaneously in real time—previous treatments in the literature have always decoupled these two problems and solved them in series. An integer programming model is dev...

This paper presents the results of an investigation, and optimization of scheduling system in Sohar University (as a case study) using the genetic algorithm (GA). GA techniques are useful for solving real-world scheduling problem such as timetable which is a complex work and usually done manually. This work focuses on scheduling courses timetable to allocate events (time, subject, and lecturer)...

Many real-world applications are mapped into combinatorial problems. An example of such problem is timetable scheduling. In this case, the two basic characteristics can be defined by its distributed and dynamic environment. One efficient solution could be provided by an agent-based approach. A timetable scheduling problem can be modelled as a multi-agent system that provides the final schedule ...

-In this paper we glance through the various approaches used by the researchers to develop an automatic timetable using Genetic algorithms. The optimized genetic algorithm can be used with the heuristic approach to design and develop the timetable of an institute. At stake during the process of development, the stakeholders are the professors and the students. The efficient utilization of the i...

The Transit Network Timetabling and Scheduling Problem (TNTSP) aims at determining optimal timetables for each line in a transit network by establishing departure and arrival times at each station allocating a vehicle to each timetable. Customers could know departure times of the line runs offered by the system in a regular way. However, each user, traveling later or in advance than their desir...