Editorial: Advanced methods for public transport system management

published_or_final_versionSpringer Open Choice, 01 Dec 201

A new approach to crew scheduling in rapid transit networks

We propose a new approach for the crew scheduling problem in rapid transit networks. With this approach we try to open a new branch for future research, providing a different way of facing the crew scheduling problem which makes integration with other planning problems easier than the traditional approach based on column generation for solving a set covering/partitioning problem. For solving this new model we develop a Lagrangian relaxation and we take advantage of an ad hoc decomposition based on time personnel clustering. We present some preliminary computational experiments for real case studies drawn from the main Spanish train operator, RENFE

Maintenance scheduling in rolling stock circulations in rapid transit networks

The railway routing problem determines specific paths for each individual train, given its type and composition and considering possible maintenance locations and durations. The objective is to minimize operating costs and penalties related to waiting times and maintenance all while considering train scheduling and maintenance constraints. The model is solved using Branch and Bound and Column Generation approaches. In the paper the different approaches are compared for different planning horizons and model parameter settings. The computational tests have been run in a real RENFE network

Improved rapid transit network design model: considering transfer effects

The rail rapid transit network design problem aims at locating train alignments and stations, maximizing demand coverage while competing with the current existing networks. We present a model formulation for computing tight bounds of the linear relaxation of the problem where transfers are also introduced. The number of transfers within a trip is a decisive attribute for attracting passengers: transferring is annoying and undesirable for passengers. We conduct computational experiments on different networks and show how we are able to solve more efficiently problems that have been already solved; sensitivity analysis on several model parameters are also performed so as to demonstrate the robustness of the new formulation

Improved rapid transit network design model: considering transfer effects

The rail rapid transit network design problem aims at locating train alignments and stations, maximizing demand coverage while competing with the current existing networks. We present a model formulation for computing tight bounds of the linear relaxation of the problem where transfers are also introduced. The number of transfers within a trip is a decisive attribute for attracting passengers: transferring is annoying and undesirable for passengers. We conduct computational experiments on different networks and show how we are able to solve more efficiently problems that have been already solved; sensitivity analysis on several model parameters are also performed so as to demonstrate the robustness of the new formulation

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 Spai

Robust rolling stock in rapid transit network

This paper focuses on the railway rolling stock circulation problem in rapid transit networks, in which frequencies are high and distances are relatively short. Although the distances are not very large, service times are high due to the large number of intermediate stops required to allow proper passenger flow. The main complicating issue is the fact that the available capacity at depot stations is very low, and both capacity and rolling stock are shared between different train lines. This forces the introduction of empty train movements and rotation maneuvers, to ensure sufficient station capacity and rolling stock availability. However, these shunting operations may sometimes be difficult to perform and can easily malfunction, causing localized incidents that could propagate throughout the entire network due to cascading effects. This type of operation will be penalized with the goal of selectively avoiding them and ameliorating their high malfunction probabilities. Critic trains, defined as train services that come through stations that have a large number of passengers arriving at the platform during rush hours, are also introduced. We illustrate our model using computational experiments drawn from RENFE (the main Spanish operator of suburban passenger trains) in Madrid, Spain. The results of the model, achieved in approximately 1 min, have been received positively by RENFE planner

A Branch and Bound Algorithm for the Exact Solution of the Problem of EMU Circulation Scheduling in Railway Network

This paper is concerned with the scheduling of Electrical Multiple Units (EMUs) under the condition of their utilization on one sector or within several interacting sectors. Based on the introduction of the train connection graph which describes the possible connection relationship between trains, the integer programming model of EMU circulation planning is constructed. In order to analyzing the resolution of the model, a heuristic which shares the characteristics with the existing methods is introduced first. This method consists of two stages: one is a greedy strategy to construct a feasible circulation plan fragment, and another is to apply a stochastic disturbance to it to generate a whole feasible solution or get a new feasible solution. Then, an exact branch and bound method which is based on graph designing is proposed. Due to the complexity, the lower bound is computed through a polynomial approximation algorithm which is a modification from the one solving the degree constraint minimum 1-tree problem. Then, a branching strategy is designed to cope with the maintenance constraints. Finally, we report extensive computational results on a railway corridor in which the sectors possess the basic feature of railway networks