Strong Relaxations for the Train Timetabling Problem Using Connected Configurations

The task of the train timetabling problem or track allocation problem is to find conflict free schedules for a set of trains with predefined routes in a railway network. Especially for non-periodic instances models based on time expanded networks are often used. Unfortunately, the linear programming relaxation of these models is often extremely weak because these models do not describe combinatorial relations like overtaking possibilities very well. In this paper we extend the model by so called connected configuration subproblems. These subproblems perfectly describe feasible schedules of a small subset of trains (2-3) on consecutive track segments. In a Lagrangian relaxation approach we solve several of these subproblems together in order to produce solutions which consist of combinatorially compatible schedules along the track segments. The computational results on a mostly single track corridor taken from the INFORMS RAS Problem Solving Competition 2012 data indicate that our new solution approach is rather strong. Indeed, for this instance the solution of the Lagrangian relaxation is already integral

Evaluation of planning policies for marshalling track allocation using simulation

Planning the operational procedures in a railway marshalling yard is a complex problem. When a train arrives at a marshalling yard, it is uncoupled on an arrival yard and then its cars are rolled to a classification yard. All cars should eventually be rolled to the classification track that has been assigned to the train they’re supposed to depart with. However, there is normally not enough capacity to compound all trains at once. In Sweden, cars arriving before a track has been assigned to their train can be stored on separate tracks called mixing tracks. All cars on mixing tracks will be pulled back to the arrival yard, and then rolled to the classification yard again to allow for reclassification. Today all procedures are planned by experienced dispatchers, but there are no documented strategies or guidelines for efficient manual planning. The aim of this paper is to examine operational planning strategies that could help dispatchers find a feasible marshalling schedule that minimizes unnecessary mixing. In order to achieve this goal, two different online planning strategies have been tested using deterministic and stochastic simulation. The Hallsberg marshalling yard was used as a case study, and was simulated for the time period between December 2010 and May 2011. The first tested strategy simply assigns tracks to trains on a first come-first served basis, while the second strategy uses time limits to determine when tracks should be assigned to departing trains. The online planning algorithms have been compared with an offline optimized track allocation. The results from both the deterministic and the stochastic simulation show that the optimized allocation is better than all online strategies and that the second strategy with a time limit of 32 hours is the best online method

Commercialising Australia's interstate rail freight transport: Some ownership and investment issues

The paper addresses the issues of rights of way ownership and application of consistent investment appraisal techniques across modes of transport. There are linkages between ownership, rights of way, competitive strategies and market contestability which will have a significant bearing on the choice of investment criteria used by commercialised railways. Investment methodologies in competing modes of land transport must be consistent. Investment in individual elements of railway infrastructure must be integrated with the overall cost recovery strategy of the operator. Major railway projects must be submitted to both financial and economic evaluation, so that the interests of individual railway authorities and the community are considered

Estimating the damage and marginal cost of different vehicle types on rail infrastructure: combining economic and engineering approaches

EU legislation requires that European infrastructure managers set access charges based on the marginal cost of running trains on their networks. Two methods have been used in the literature for this purpose. Top-down methods relate actual costs to traffic volumes. Bottom-up methods use engineering models to simulate damage and then translate damage into costs based on assumptions about interventions and their unit costs. Whilst top down methods produce sensible results for marginal cost overall, they have struggled to differentiate between traffic types. The challenge for bottom-up approaches is how to translate damage into cost, with numerous assumptions being required which may be invalid. This paper proposes a new, two stage approach to estimating the marginal cost of rail infrastructure usage. The first stage uses engineering models to simulate damage caused by vehicles on the network. The second stage seeks to establish a statistical relationship between actual costs and damage. It is thus possible to convert damage estimates into costs using actual cost data, rather than through a set of potentially invalid assumptions as in previous approaches. Only the first stage is implemented in this paper. We show that it possible to produce total (annualised) damage measures for three damage mechanisms on five actual track sections in Sweden. Once extended, it will be possible to model the relationship between damage and actual costs for the first time; and thus better understand the relative costs of the different damage mechanisms and in turn inform the level and structure of track access charges

Train-scheduling optimization model for railway networks with multiplatform stations

This paper focuses on optimizing the schedule of trains on railway networks composed of busy complex stations. A mathematical formulation of this problem is provided as a Mixed Integer Linear Program (MILP). However, the creation of an optimal new timetable is an NP-hard problem; therefore, the MILP can be solved for easy cases, computation time being impractical for more complex examples. In these cases, a heuristic approach is provided that makes use of genetic algorithms to find a good solution jointly with heuristic techniques to generate an initial population. The algorithm was applied to a number of problem instances producing feasible, though not optimal, solutions in several seconds on a laptop, and compared to other proposals. Some improvements are suggested to obtain better results and further improve computation time. Rail transport is recognized as a sustainable and energy-efficient means of transport. Moreover, each freight train can take a large number of trucks off the roads, making them safer. Studies in this field can help to make railways more attractive to travelers by reducing operative cost, and increasing the number of services and their punctuality. To improve the transit system and service, it is necessary to build optimal train scheduling. There is an interest from the industry in automating the scheduling process. Fast computerized train scheduling, moreover, can be used to explore the effects of alternative draft timetables, operating policies, station layouts, and random delays or failures.Postprint (published version

Opportunities and challenges with new railway planning approach in Sweden

Long lead times in railway planning can give rise to a significant discrepancy between the original plan and the traffic eventually operated, resulting in inefficient utilization of capacity. Research shows that the railway sector in Sweden would benefit from a different planning approach in which capacity consuming decisions are pushed forward in time whenever possible. This approach is currently being implemented at Trafikverket, the Swedish Transport Administration. With it follows a number of mathematical opportunities and challenges, some of which will be presented in this paper

Overview of Infrastructure Charging, part 4, IMPROVERAIL Project Deliverable 9, “Improved Data Background to Support Current and Future Infrastructure Charging Systems”

Improverail aims are to further support the establishment of railway infrastructure management in accordance with Directive 91/440, as well as the new railway infrastructure directives, by developing the necessary tools for modelling the management of railway infrastructure; by evaluating improved methods for capacity and resources management, which allow the improvement of the Life Cycle Costs (LCC) calculating methods, including elements related to vehicle - infrastructure interaction and external costs; and by improving data background in support of charging for use of railway infrastructure. To achieve these objectives, Improverail is organised along 8 workpackages, with specific objectives, responding to the requirements of the task 2.2.1/10 of the 2nd call made in the 5th RTD Framework Programme in December 1999.This part is the task 7.1 (Review of infrastructure charging systems) to the workpackage 7 (Analysis of the relation between infrastructure cost variation and diversity of infrastructure charging systems).Before explaining the economic characteristics of railway and his basic pricing principles, authors must specify the objectives of railways infrastructure charging.principle of pricing ; rail infrastructure charging ; public service obligation ; rail charging practice ; Europe ; Improverail

Operations research in passenger railway transportation

In this paper, we give an overview of state-of-the-art OperationsResearch models and techniques used in passenger railwaytransportation. For each planning phase (strategic, tactical andoperational), we describe the planning problems arising there anddiscuss some models and algorithms to solve them. We do not onlyconsider classical, well-known topics such as timetabling, rollingstock scheduling and crew scheduling, but we also discuss somerecently developed topics as shunting and reliability oftimetables.Finally, we focus on several practical aspects for each of theseproblems at the largest Dutch railway operator, NS Reizigers.passenger railway transportation;operation research;planning problems