Estimating the robustness of long-haul train plans

In Australia, and elsewhere, the movement of trains on long-haul rail networks is usually planned in advance. Typically, a train plan is developed to confirm that the required train movements and track maintenance activities can occur. The plan specifies when track segments will be occupied by particular trains and maintenance activities. On the day of operation, a train controller monitors and controls the movement of trains and maintenance crews, and updates the train plan in response to unplanned disruptions. It can be difficult to predict how good a plan will be in practice. The main performance indicator for a train service should be reliability - the proportion of trains running the service that complete at or before the scheduled time. We define the robustness of a planned train service to be the expected reliability. The robustness of individual train services and for a train plan as a whole can be estimated by simulating the train plan many times with random, but realistic, perturbations to train departure times and segment durations, and then analysing the distributions of arrival times. This process can also be used to set arrival times that will achieve a desired level of robustness for each train service.

Scheduling and Platforming Trains at Busy Complex Stations

We consider the problem of train planning or scheduling for large, busy, complex train stations, which are common in Europe and elsewhere, though not in North America. We develop the constraints and objectives for this problem, but these are too computationally complex to solve by standard combinatorial search or integer programming methods. Also, the problem is somewhat political in nature, that is, it does not have a clear objective function because it involves multiple train operators with conflicting interests. We therefore develop scheduling heuristics analogous to those successfully adopted by train planners using ''manual'' methods. We tested the model and algorithms by applying to a typical large station that exhibits most of the complexities found in practice. The results compare well with those found by traditional methods, and take account of cost and preference trade-offs not handled by those methods. With successive refinements, the algorithm eventually took only a few seconds to run, the time depending on the version of the algorithm and the scheduling problem. The scheduling models and algorithms developed and tested here can be used on their own, or as key components for a more general system for train scheduling for a rail line or network.Train scheduling for a busy station includes ensuring that there are no conflicts between several hundred trains per day going in and out of the station on intersecting paths from multiple in-lines and out-lines to multiple platforms, while ensuring that each train is allowed at least its minimum required headways, dwell time, turnaround time and trip time. This has to be done while minimizing (costs of) deviations from desired times, platforms or lines, allowing for conflicts due to through-platforms, dead-end platforms, multiple sub-platforms, and possible constraints due to infrastructure, safety or business policy.

Modeling circulation of train-set with multiple routing

Planning on utilization of train-set is one of the key tasks of transport organization for passenger dedicated railway in China. It also has strong relationships with timetable scheduling and operation plans at a station. To execute such a task in a railway hub pooling multiple railway lines, the characteristics of multiple routing for train-set is discussed in term of semicircle of train-sets' turnover. In programming the described problem, the minimum dwell time is selected as the objectives with special derive constraints of the train-set's dispatch, the connecting conditions, the principle of uniqueness for train-sets, and the first plus for connection in the same direction based on time tolerance σ. A compact connection algorithm based on time tolerance is then designed. The feasibility of the model and the algorithm is proved by the case study. The result indicates that the circulation model and algorithm about multiple routing can deal with the connections between the train-sets of multiple directions, and reduce the train's pulling in or leaving impact on the station's throat.

Making the train : an examination of five perspectives of rail access and how they resonate with existing and potential passengers

Rail operators recognize a need to increase ridership in order to improve the economic viability of rail service, and to magnify the role that rail travel plays in making cities feel liveable. This study extends previous research that used cluster analysis with a small sample of rail passengers to identify five salient perspectives of rail access (Zuniga et al, 2013). In this project stage, we used correlation techniques to determine how those perspectives would resonate with two larger study populations, including a relatively homogeneous sample of university students in Brisbane, Australia and a diverse sample of rail passengers in Melbourne, Australia. Findings from Zuniga et al. (2013) described a complex typology of current passengers that was based on respondents’ subjective attitudes and perceptions rather than socio-demographic or travel behaviour characteristics commonly used for segmentation analysis. The typology included five qualitative perspectives of rail travel. Based on the transport accessibility literature, we expected to find that perspectives from that study emphasizing physical access to rail stations would be shared by current and potential rail passengers who live further from rail stations. Other perspectives might be shared among respondents who live nearby, since the relevance of distance would be diminished. The population living nearby would thus represent an important target group for increasing ridership, since making rail travel accessible to them does not require expansion of costly infrastructure such as new lines or stations. By measuring the prevalence of each perspective in a larger respondent pool, results from this study provide insight into the typical socio-demographic and travel behaviour characteristics that correspond to each perspective of intra-urban rail travel. In several instances, our quantitative findings reinforced Zuniga et al.’s (2013) qualitative descriptions of passenger types, further validating the original research. This work may directly inform rail operators’ approach to increasing ridership through marketing and improvements to service quality and station experience. Operators in other parts of Australia and internationally may also choose to replicate the study locally, to fine-tune understanding of diverse customer bases. Developing regional and international collaboration would provide additional opportunities to evaluate and benchmark service and station amenities as they address the various access dimensions.

Planning for sustainability of non motorised public transport in a developing city

Most large cities around the world are undergoing rapid transport sector development to cater for increased urbanization. Subsequently the issues of mobility, access equity, congestion, operational safety and above all environmental sustainability are becoming increasingly crucial in transport planning and policy making. The popular response in addressing these issues has been demand management, through improvement of motorised public transport (MPT) modes (bus, train, tram) and non-motorized transport (NMT) modes (walk, bicycle); improved fuel technology. Relatively little attention has however been given to another readily available and highly sustainable component of the urban transport system, non-motorized public transport (NMPT) such as the pedicab that operates on a commercial basis and serves as an NMT taxi; and has long standing history in many Asian cities; relatively stable in existence in Latin America; and reemerging and expanding in Europe, North America and Australia. Consensus at policy level on the apparent benefits, costs and management approach for NMPT integration has often been a major transport planning problem. Within this context, this research attempts to provide a more complete analysis of the current existence rationale and possible future, or otherwise, of NMPT as a regular public transport system. The analytical process is divided into three major stages. Stage 1 reviews the status and role condition of NMPT as regular public transport on a global scale- in developing cities and developed cities. The review establishes the strong ongoing and future potential role of NMPT in major developing cities. Stage 2 narrows down the status review to a case study city of a developing country in order to facilitate deeper role review and status analysis of the mode. Dhaka, capital city of Bangladesh, has been chosen due to its magnitude of NMPT presence. The review and analysis reveals the multisectoral and dominant role of NMPT in catering for the travel need of Dhaka transport users. The review also indicates ad-hoc, disintegrated policy planning in management of NMPT and the need for a planning framework to facilitate balanced integration between NMPT and MT in future. Stage 3 develops an integrated, multimodal planning framework (IMPF), based on a four-step planning process. This includes defining the purpose and scope of the planning exercise, determining current deficiencies and preferred characteristics for the proposed IMPF, selection of suitable techniques to address the deficiencies and needs of the transport network while laying out the IMPF and finally, development of a delivery plan for the IMPF based on a selected layout technique and integration approach. The output of the exercise is a planning instrument (decision tool) that can be used to assign a road hierarchy in order to allocate appropriate traffic to appropriate network type, particularly to facilitate the operational balance between MT and NMT. The instrument is based on a partial restriction approach of motorised transport (MT) and NMT, structured on the notion of functional hierarchy approach, and distributes/prioritises MT and NMT such that functional needs of the network category is best complemented. The planning instrument based on these processes and principles offers a six-level road hierarchy with a different composition of network-governing attributes and modal priority, for the current Dhaka transport network, in order to facilitate efficient integration of NMT with MT. A case study application of the instrument on a small transport network of Dhaka also demonstrates the utility, flexibility and adoptability of the instrument in logically allocating corridors with particular positions in the road hierarchy paradigm. Although the tool is useful in enabling balanced distribution of NMPT with MT at different network levels, further investigation is required with reference to detailed modal variations, scales and locations of a network to further generalise the framework application.

Real-time image classification for adaptive mission planning using an Autonomous Underwater Vehicle

Real-time image analysis and classification onboard robotic marine vehicles, such as AUVs, is a key step in the realisation of adaptive mission planning for large-scale habitat mapping in previously unexplored environments. This paper describes a novel technique to train, process, and classify images collected onboard an AUV used in relatively shallow waters with poor visibility and non-uniform lighting. The approach utilises Förstner feature detectors and Laws texture energy masks for image characterisation, and a bag of words approach for feature recognition. To improve classification performance we propose a usefulness gain to learn the importance of each histogram component for each class. Experimental results illustrate the performance of the system in characterisation of a variety of marine habitats and its ability to operate onboard an AUV's main processor suitable for real-time mission planning.

Performance profiling for predictive train schedules

In this article an alternate sensitivity analysis is proposed for train schedules. It characterises the schedules robustness or lack thereof and provides unique profiles of performance for different sources of delay and for different values of delay. An approach like this is necessary because train schedules are only a prediction of what will actually happen. They can perform poorly with respect to a variety of performance metrics, when deviations and other delays occur, if for instance they can even be implemented, and as originally intended. The information provided by this analytical approach is beneficial because it can be used as part of a proactive scheduling approach to alter a schedule in advance or to identify suitable courses of action for specific “bad behaviour”. Furthermore this information may be used to quantify the cost of delay. The effect of sectional running time (SRT) deviations and additional dwell time in particular were quantified for three railway schedule performance measures. The key features of this approach were demonstrated in a case study.

Incorporating complex train paths to an analysis of absolute capacity

Railways are an important mode of transportation. They are however large and complex and their construction, management and operation is time consuming and costly. Evidently planning the current and future activities is vital. Part of that planning process is an analysis of capacity. To determine what volume of traffic can be achieved over time, a variety of railway capacity analysis techniques have been created. A generic analytical approach that incorporates more complex train paths however has yet to be provided. This article provides such an approach. This article extends a mathematical model for determining the theoretical capacity of a railway network. The main contribution of this paper is the modelling of more complex train paths whereby each section can be visited many times in the course of a train’s journey. Three variant models are formulated and then demonstrated in a case study. This article’s numerical investigations have successively shown the applicability of the proposed models and how they may be used to gain insights into system performance.

Scheduled service network design for integrated planning of rail freight transportation

Cette thèse étudie une approche intégrant la gestion de l’horaire et la conception de réseaux de services pour le transport ferroviaire de marchandises. Le transport par rail s’articule autour d’une structure à deux niveaux de consolidation où l’affectation des wagons aux blocs ainsi que des blocs aux services représentent des décisions qui complexifient grandement la gestion des opérations. Dans cette thèse, les deux processus de consolidation ainsi que l’horaire d’exploitation sont étudiés simultanément. La résolution de ce problème permet d’identifier un plan d’exploitation rentable comprenant les politiques de blocage, le routage et l’horaire des trains, de même que l’habillage ainsi que l’affectation du traffic. Afin de décrire les différentes activités ferroviaires au niveau tactique, nous étendons le réseau physique et construisons une structure de réseau espace-temps comprenant trois couches dans lequel la dimension liée au temps prend en considération les impacts temporels sur les opérations. De plus, les opérations relatives aux trains, blocs et wagons sont décrites par différentes couches. Sur la base de cette structure de réseau, nous modélisons ce problème de planification ferroviaire comme un problème de conception de réseaux de services. Le modèle proposé se formule comme un programme mathématique en variables mixtes. Ce dernie r s’avère très difficile à résoudre en raison de la grande taille des instances traitées et de sa complexité intrinsèque. Trois versions sont étudiées : le modèle simplifié (comprenant des services directs uniquement), le modèle complet (comprenant des services directs et multi-arrêts), ainsi qu’un modèle complet à très grande échelle. Plusieurs heuristiques sont développées afin d’obtenir de bonnes solutions en des temps de calcul raisonnables. Premièrement, un cas particulier avec services directs est analysé. En considérant une cara ctéristique spécifique du problème de conception de réseaux de services directs nous développons un nouvel algorithme de recherche avec tabous. Un voisinage par cycles est privilégié à cet effet. Celui-ci est basé sur la distribution du flot circulant sur les blocs selon les cycles issus du réseau résiduel. Un algorithme basé sur l’ajustement de pente est développé pour le modèle complet, et nous proposons une nouvelle méthode, appelée recherche ellipsoidale, permettant d’améliorer davantage la qualité de la solution. La recherche ellipsoidale combine les bonnes solutions admissibles générées par l’algorithme d’ajustement de pente, et regroupe les caractéristiques des bonnes solutions afin de créer un problème élite qui est résolu de facon exacte à l’aide d’un logiciel commercial. L’heuristique tire donc avantage de la vitesse de convergence de l’algorithme d’ajustement de pente et de la qualité de solution de la recherche ellipsoidale. Les tests numériques illustrent l’efficacité de l’heuristique proposée. En outre, l’algorithme représente une alternative intéressante afin de résoudre le problème simplifié. Enfin, nous étudions le modèle complet à très grande échelle. Une heuristique hybride est développée en intégrant les idées de l’algorithme précédemment décrit et la génération de colonnes. Nous proposons une nouvelle procédure d’ajustement de pente où, par rapport à l’ancienne, seule l’approximation des couts liés aux services est considérée. La nouvelle approche d’ajustement de pente sépare ainsi les décisions associées aux blocs et aux services afin de fournir une décomposition naturelle du problème. Les résultats numériques obtenus montrent que l’algorithme est en mesure d’identifier des solutions de qualité dans un contexte visant la résolution d’instances réelles.

Using ecological niche models to support tree species selection for forest restoration planning in largely deforested regions

Species selection for forest restoration is often supported by expert knowledge on local distribution patterns of native tree species. This approach is not applicable to largely deforested regions unless enough data on pre-human tree species distribution is available. In such regions, ecological niche models may provide essential information to support species selection in the framework of forest restoration planning. In this study we used ecological niche models to predict habitat suitability for native tree species in "Tierra de Campos" region, an almost totally deforested area of the Duero Basin (Spain). Previously available models provide habitat suitability predictions for dominant native tree species, but including non-dominant tree species in the forest restoration planning may be desirable to promote biodiversity, specially in largely deforested areas were near seed sources are not expected. We used the Forest Map of Spain as species occurrence data source to maximize the number of modeled tree species. Penalized logistic regression was used to train models using climate and lithological predictors. Using model predictions a set of tools were developed to support species selection in forest restoration planning. Model predictions were used to build ordered lists of suitable species for each cell of the study area. The suitable species lists were summarized drawing maps that showed the two most suitable species for each cell. Additionally, potential distribution maps of the suitable species for the study area were drawn. For a scenario with two dominant species, the models predicted a mixed forest (Quercus ilex and a coniferous tree species) for almost one half of the study area. According to the models, 22 non-dominant native tree species are suitable for the study area, with up to six suitable species per cell. The model predictions pointed to Crataegus monogyna, Juniperus communis, J.oxycedrus and J.phoenicea as the most suitable non-dominant native tree species in the study area. Our results encourage further use of ecological niche models for forest restoration planning in largely deforested regions.

Train scheduling in high speed railways: considering competitive effects

The railway planning problem is usually studied from two different points of view: macroscopic and microscopic. We propose a macroscopic approach for the high-speed rail scheduling problem where competitive effects are introduced. We study train frequency planning, timetable planning and rolling stock assignment problems and model the problem as a multi-commodity network flow problem considering competitive transport markets. The aim of the presented model is to maximize the total operator profit. We solve the optimization model using realistic probleminstances obtained from the network of the Spanish railwa operator RENFE, including other transport modes in Spain