The philosophy and practice of Taktfahrplan: a case-study of the East Coast Main Line.

Executive Summary This Working Paper has three purposes, represented by three Parts: - to explain the principles of the Taktfahrplan approach to railway timetabling; - to summarise the implications of the background research on the structure of the network; and - to describe the exercise of constructing a Taktfahrplan for the East Coast Main Line that formed the case-study of the potential benefits of such a scheme compared with the existing timetable. In Part I the broad principles and objectives are first outlined, and the advantages and disadvantages discussed [§ 1.1,1.2]. A Taktfahrplan is based on standard hours and the careful, network-wide coordination of sewices. It is recognised that ultimately the choice between this and conventional timetabling methods must depend on an evaluation of the loss of present flexibility to adjust to time-specific market demands against the gains from enhanced connectivity and from the fact of regularity. Issues concerning resources and the management of peak periods are also explained. Terminology is then dealt with because words and phrases are being used with imprecise and various meanings [§1.3]. There follows a detailed account of the arithmetic rules through which the ideal relationships between train (and bus) sewices can be attained, together with an explanation of the measures that can be taken to make the best compromises in the face of the characteristics of the real network - or to adjust it over time [§ 1.4]. In Part 2 the research to highlight features of the underlying demand for travel is described. This is not a necessary component of strategic timetable planning, but it is argued that it is desirable in order both to break free from the historical baggage and to seize the business, environmental and social-policy opportunities that a 'clean- sheet' timetable would present [§2.1]. The provisional findings from this work (it was left incomplete for reasons that are explained) are then deployed to form the skeleton of a national network connecting 100 important centres with 158 links. This is followed by an analysis of the very variable standards of the rail timetable on those links and of the road competition and by an account of some first thoughts as to how a full-scale Taktfahrplan might start to be developed on this network [§2.2]. This emphasises the inter-relationships between sewices and the inescapable consequences for pathing trains, once it is accepted that sensible spacing of services and striving for good connectivity are more important than optimising routes on a self-contained basis. It was thought appropriate to include a summary of the findings regarding the low-density end of the current rail system in order to indicate the issues that Taktfahrplan might raise in this respect [§2.3]. The East Coast case-study is presented in Part 3. Some technical matters are explained first, including the key point that the exercise used the Viriato timetabling software employed by the Swiss Federal Railways (and many other systems) to construct Taktfahrpliine [§3.1]. Successive sub-parts then describe groups of services: long-distance [§3.2], services within Scotland [§3.3], services in North East England [§3.4], the trans-Pennine network [§3.5] and some of the Yorkshire services [§3.6]

Integer programming based solution approaches for the train dispatching problem

Railroads face the challenge of competing with the trucking industry in a fastpaced environment. In this respect, they are working toward running freight trains on schedule and reducing travel times. The planned train schedules consist of departure and arrival times at main stations on the rail network. A detailed timetable, on the other hand, consists of the departure and arrival times of each train in each track section of its route. The train dispatching problem aims to determine detailed timetables over a rail network in order to minimize deviations from the planned schedule. We provide a new integer programming formulation for this problem based on a spacetime network; we propose heuristic algorithms to solve it and present computational results of these algorithms. Our approach includes some realistic constraints that have not been previously considered as well as all the assumptions and practical issues considered by the earlier works

Dynamic Modeling Framework to Predict Instantaneous Status of a Tractor-Dolly System

A dynamic modeling framework was established to predict the position and alignment (turning angle) of a tractor-dolly towing system receiving different driver inputs. This framework consists of three primary components: (1) a state space model to determine position and velocity of the system through Newton’s second law; (2) a model that transfers angular acceleration through each successive towed vehicle; and (3) a polygon model to draw an instantaneous shape of the vehicle representing its location and alignment. Input parameters of this model include initial conditions of the system, real time location of a reference point that can be determined through a beacon and radar system, and instantaneous accelerations, which come from driver maneuvers found on a data collecting system installed on the tractor. The purpose is to create an output that presents the position of the dolly vehicles with reference to the tractor at any time point

THE PROGRAM PATHING TRUST MODEL FOR CRITICAL SYSTEM PROCESS AUTHORIZATION

Since computers are relied upon to run critical infrastructures – from nuclear power plants to electronic battlefield simulations – the concept of a “trusted” or tamperproof system has become even more important. Some applications have become so critical that it is imperative that they run as intended, without interference. The consequences of these systems not running as intended could be catastrophic. This research offers a solution for a key element for protecting these critical servers – validating process invocation sequences. The purpose of this research is to increase operating system security by detecting, validating, and enforcing process invocation sequences within a critical system. If the processes on a critical system are not those that are intended to run or support the critical system, or if a system is able to run processes in an unauthorized sequence, then the system is compromised and cannot be trusted. This research uses a computational theory approach to create a framework for a solution for the process invocation sequence problem. Using the Program Pathing Trust Model, a solution capable of identifying both valid and invalid process invocation sequences is developed

An optimization model for line planning and timetabling in automated urban metro subway networks

In this paper we present a Mixed Integer Nonlinear Programming model that we developed as part of a pilot study requested by the R&D company Metrolab in order to design tools for finding solutions for line planning and timetable situations in automated urban metro subway networks. Our model incorporates important factors in public transportation systems from both, a cost-oriented and a passenger-oriented perspective, as time-dependent demands, interchange stations, short-turns and technical features of the trains in use. The incoming flows of passengers are modeled by means of piecewise linear demand functions which are parameterized in terms of arrival rates and bulk arrivals. Decisions about frequencies, train capacities, short-turning and timetables for a given planning horizon are jointly integrated to be optimized in our model. Finally, a novel Math-Heuristic approach is proposed to solve the problem. The results of extensive computational experiments are reported to show its applicability and effectiveness to handle real-world subway networksComment: 30 pages, 6 figures, 9 table

Eco-reliable path finding in time-variant and stochastic networks

This paper addresses a route guidance problem for finding the most eco-reliable path in time-variant and stochastic networks such that travelers can arrive at the destination with the maximum on-time probability while meeting vehicle emission standards imposed by government regulators. To characterize the dynamics and randomness of transportation networks, the link travel times and emissions are assumed to be time-variant random variables correlated over the entire network. A 0–1 integer mathematical programming model is formulated to minimize the probability of late arrival by simultaneously considering the least expected emission constraint. Using the Lagrangian relaxation approach, the primal model is relaxed into a dualized model which is further decomposed into two simple sub-problems. A sub-gradient method is developed to reduce gaps between upper and lower bounds. Three sets of numerical experiments are tested to demonstrate the efficiency and performance of our proposed model and algorithm

Train planning in a fragmented railway: a British perspective

Train Planning (also known as railway scheduling) is an area of substantial importance to the success of any railway. Through train planning, railway managers aim to meet the needs of customers whilst using as low a level of resources (infrastructure, rolling stock and staff) as possible. Efficient and effective train planning is essential to get the best possible performance out of a railway network. The author of this thesis aims, firstly, to analyse the processes which are used to develop train plans and the extent to which they meet the objectives that they might be expected to meet and, secondly, to investigate selected new and innovative software approaches that might make a material difference to the effectiveness and/or efficiency of train planning processes. These aims are delivered using a range of primarily qualitative research methods, including literature reviews, interviews, participant observation and case studies, to understand these processes and software. Conclusions regarding train planning processes include how the complexity of these processes hinders their effectiveness, the negative impact of the privatisation of British Rail on these processes and the conflicting nature of objectives for train planning in the privatised railway. Train planning software is found not to adequately support train planners in meeting the objectives they are set. The potential for timetable generation using heuristics and for timetable performance simulation to improve the effectiveness of train planning are discussed and recommendations made for further research and development to address the limitations of the software currently available