This paper presents an integer programming formulation for integrating maintenance planning tasks in the railway rolling stock circulation problem. This is a key problem in railway rostering planning that requires to cover a given set of services and maintenance works with a minimum amount of rolling stock units. An additional objective is to limit the number of empty rides. The constraints of ...

In this paper a greedy algorithm to detect conflict cliques in interval graphs and circular-arc graphs is analysed. In a graph, a stable set requires that at most one vertex is chosen for each edge. It is equivalent to requiring that at most one vertex for each maximal clique is chosen. We show that this algorithm finds all maximal cliques for interval graphs, i.e. it can compute the convex hul...

In this article we introduce an integrated agent-based train, passenger and incident simulation engine for data-driven incident response in urban railway networks. We model the movement of passengers and trains as individual agents behaving according to parsimonious models defined by data availability. Appropriate statistical routines are implemented for model calibration. We also design a gene...

In a modern rail–rail transshipment yard huge gantry cranes transship containers between different freight trains, so that hub-and-spoke railway systems are enabled. In this context, we consider the transshipment yard scheduling problem (TYSP) where trains have to be assigned to bundles, which jointly enter and leave the yard. The objective is to minimize split moves and revisits. Split moves a...

This paper describes the development and use of a model designed to optimise train schedules on single line rail corridors. The model has been developed with two major applications in mind, namely: as a decision support tool for train dispatchers to schedule trains in real time in an optimal way; and as a planning tool to evaluate the impact of timetable changes, as well as railroad infrastruct...

Train path (infrastructure), rolling stock and crew scheduling are three critical planning decisions in railway transportation. These resources are usually planned separately in a sequential process that typically starts from planning (1) train paths and goes further on to (2) rolling stock and (3) train drivers. Such a sequential approach helps to handle the complexity of the planning process ...

This paper discusses optimization of freight train locomotive rescheduling under a disrupted situation in the daily operations in Japan. In the light of the current framework of dispatching processes that passenger railway operators modify the entire timetables, the adjusted timetable is distributed to a freight train operator. We solve the locomotive rescheduling problem for the given adjusted...

The privatisation of British Rail into twenty five train operating companies and three freight companies has highlighted the need for each company to have efficient operating schedules. Manpower costs are a significant element in any transport organisation, and the ability to minimise these costs is seen as crucial to the well running of these companies. In addition, the need to try out differe...

Train path (infrastructure), rolling stock and crew scheduling are three critical planning decisions in railway transportation. These resources are usually planned separately in a sequential process that typically starts from planning (1) train paths and goes further on to (2) rolling stock and (3) train drivers. Such a sequential approach helps to handle the complexity of the planning process ...

The Union Pacific Railroad (UPRR) has over 3 1,000 miles of track covering a 24 state region. Planning and scheduling the production, packaging, delivery, and pickup of rail, involved in the maintenance of this network, is a very complex task. Manually scheduling only a subset of the resources required has historically taken several days to accomplish. Moreover, the inability to fully schedule ...