Assessing the Efficiency of Mass Transit Systems in the United States

Frustrated with increased parking problems, unstable gasoline prices, and stifling traffic congestion, a growing number of metropolitan city dwellers consider utilizing the mass transit system. Reflecting this sentiment, a ridership of the mass transit system across the United States has been on the rise for the past several years. A growing demand for the mass transit system, however, necessitates the expansion of service offerings, the improvement of basic infrastructure/routes, and the additional employment of mass transit workers, including drivers and maintenance crews. Such a need requires the optimal allocation of financial and human resources to the mass transit system in times of shrinking budgets and government downsizing. Thus, the public transit authority is faced with the dilemma of “doing more with less.” That is to say, the public transit authority needs to develop a “lean” strategy which can maximize transit services with the minimum expenses. To help the public transit authority develop such a lean strategy, this report identifies the best-in-class practices in the U.S. transit service sector and proposes transit policy guidelines that can best exploit lean principles built upon best-in-class practices

Multiple-Depot Integrated Vehicle and Crew Scheduling

This paper presents two different models and algorithms for integrated vehicle and crew scheduling in the multiple-depot case. The algorithms are both based on a combination of column generation and Lagrangian relaxation. Furthermore, we compare those integrated approaches with each other and with the traditional sequential one on random generated as well as real-world data instances for a suburban/extra-urban mass transit system. To simulate such a transit system, we propose a new way of generating randomly data instances such that their properties are the same as for our real-world instances

Vehicle and crew scheduling: solving large real-world instances with an integrated approach

In this paper we discuss several methods to solve large real-worldinstances of the vehicle and crew scheduling problem. Although,there has been an increased attention to integrated approaches forsolving such problems in the literature, currently only small ormedium-sized instances can be solved by such approaches.Therefore, large instances should be split into several smallerones, which can be solved by an integrated approach, or thesequential approach, i.e. first vehicle scheduling and afterwardscrew scheduling, is applied.In this paper we compare both approaches, where we considerdifferent ways of splitting an instance varying from very simplerules to more sophisticated ones. Those ways are extensivelytested by computational experiments on real-world data provided bythe largest Dutch bus company.

A solution approach for dynamic vehicle and crew scheduling

In this paper, we discuss the dynamic vehicle and crew schedulingproblem and we propose a solution approach consisting of solving asequence of optimization problems. Furthermore, we explain why itis useful to consider such a dynamic approach and compare it witha static one. Moreover, we perform a sensitivity analysis on ourmain assumption that the travel times of the trips are knownexactly a certain amount of time before actual operation.We provide extensive computational results on some real-world datainstances of a large public transport company in the Netherlands.Due to the complexity of the vehicle and crew scheduling problem,we solve only small and medium-sized instances with such a dynamicapproach. We show that the results are good in the case of asingle depot. However, in the multiple-depot case, the dynamicapproach does not perform so well. We investigate why this is thecase and conclude that the fact that the instance has to be splitin several smaller ones, has a negative effect on the performance.transportation;vehicle and crew scheduling;large-scale optimization;dynamic planning

Combining Column Generation and Lagrangian Relaxation

Although the possibility to combine column generation and Lagrangian relaxation has been known for quite some time, it has only recently been exploited in algorithms. In this paper, we discuss ways of combining these techniques. We focus on solving the LP relaxation of the Dantzig-Wolfe master problem. In a first approach we apply Lagrangian relaxation directly to this extended formulation, i.e. no simplex method is used. In a second one, we use Lagrangian relaxation to generate new columns, that is Lagrangian relaxation is applied to the compact for-mulation. We will illustrate the ideas behind these algorithms with an application in Lot-sizing. To show the wide applicability of these techniques, we also discuss applications in integrated vehicle and crew scheduling, plant location and cutting stock problems.column generation;Lagrangean relaxation;cutting stock problem;lotsizing;vehicle and crew scheduling

Optimizing the Synchronization of Multiple Bus Routes at Multiple Transfer Points Assuming Stochastic Bus Journey Times

In this thesis, we develop a discrete event simulation model of a generic bus transit system in which transfers of passengers between bus routes are considered at all bus stops in the network. The model considers several real-world aspects including stochastic passenger demand and stochastic bus travel times. Transfers of individual passengers between bus routes are explicitly modeled. The model shows how different values for the decision variables - the route assigned to each bus and the timetable for each bus - affect the time an average passenger spends in the system and other performance measures. In the experiments, we use simulation optimization to identify near-optimal bus routes, bus start times, and bus scheduled travel times that minimize average passenger time in the system. Results from the experiments show that well synchronized bus schedules - that allow passengers to transfer between different bus routes with little or no waiting time - can improve the overall performance of the system

Solving Public Transit Scheduling Problems

Operational planning within public transit companies has been extensively tackled but still remains a challenging area for operations research models and techniques. This phase of the planning process comprises vehicle scheduling, crew scheduling and rostering problems. In this paper, a new integer mathematical formulation to describe the integrated vehicle-crew-rostering problem is presented. The method proposed to solve this multi-objective problem is a sequential algorithm considered within a preemptive goal programming framework that starts from the solution of an integrated vehicle and crew scheduling problem and ends with the solution of a driver rostering problem. Feasible solutions for the vehicle and crew scheduling problem are obtained by combining a column generation scheme with a branch-and-bound method. These solutions are the input of the rostering problem, which is tackled through a mixed binary linear programming approach. An application to real data of a Portuguese bus company is reported and shows the importance of integrating the three scheduling problems