Optimization of grid bus transit systems with elastic demand

Current analytic models for optimizing urban bus transit systems tend to sacrifice geographic realism and detail in order to obtain their solutions. The models presented here shows how an optimization approach can be successful without oversimplifying spatial characteristics and demand patterns of urban areas and how a grid bus transit system in a heterogeneous urban environment with elastic demand is optimized. The demand distribution over the service region is discrete, which can realistically represent geographic variation. Optimal network characteristics (route and station spacings), operating headways and fare are found, which maximize the total operator profit and social welfare. Irregular service regions, many‐to‐many demand patterns, and vehicle capacity constraints are considered in a sequential optimization process. The numerical results show that at the optima the operator profit and social welfare functions are rather flat with respect to route spacing and headway, thus facilitating the tailoring of design variables to the actual street network and particular operating schedule without a substantial decrease in profit. The sensitivities of the design variables to some important exogenous factors are also presented.     

Joint optimization of a rail transit line and its feeder bus system

A model is developed for jointly optimizing the characteristics of a rail transit route and its associated feeder bus routes in an urban corridor. The corridor demand characteristics are specified with irregular discrete distributions which can realistically represent geographic variations. The total cost (supplier plus user cost) of the integrated bus and rail network is minimized with an efficient iterative method that successively substitutes variable values obtained through classical analytic optimization. The optimized variables include rail line length, rail station spacings, bus headways, bus stop spacings, and bus route spacing. Computer programs are designed for optimization and sensitivity analysis. The sensitivity of the transit service characteristics to various travel time and cost parameters is discussed. Numerical examples are presented for integrated transit systems in which the rail and bus schedules may be coordinated.     

User perspectives in public transport timetable optimisation

The present paper deals with timetable optimisation from the perspective of minimising the waiting time experienced by passengers when transferring either to or from a bus. Due to its inherent complexity, this bi-level minimisation problem is extremely difficult to solve mathematically, since timetable optimisation is a non-linear non-convex mixed integer problem, with passenger flows defined by the route choice model, whereas the route choice model is a non-linear non-continuous mapping of the timetable. Therefore, a heuristic solution approach is developed in this paper, based on the idea of varying and optimising the offset of the bus lines. Varying the offset for a bus line impacts the waiting time passengers experience at any transfer stop on the bus line.In the bi-level timetable optimisation problem, the lower level is a transit assignment calculation yielding passengers’ route choice. This is used as weight when minimising waiting time by applying a Tabu Search algorithm to adapt the offset values for bus lines. The updated timetable then serves as input in the following transit assignment calculation. The process continues until convergence.The heuristic solution approach was applied on the large-scale public transport network in Denmark. The timetable optimisation approach yielded a yearly reduction in weighted waiting time equivalent to approximately 45 million Danish kroner (9 million USD).     

A simulation‐based reliability assessment approach for congested transit network

This paper is an attempt to develop a generic simulation‐based approach to assess transit service reliability, taking into account interaction between network performance and passengers' route choice behaviour. Three types of reliability, say, system wide travel time reliability, schedule reliability and direct boarding waiting‐time reliability are defined from perspectives of the community or transit administration, the operator and passengers. A Monte Carlo simulation approach with a stochastic user equilibrium transit assignment model embedded is proposed to quantify these three reliability measures of transit service. A simple transit network with a bus rapid transit (BRT) corridor is analysed as a case study where the impacts of BRT components on transit service reliability are evaluated preliminarily.     

Reducing the cost of peak hour transit service through contracting out service

Transit service contracting has responded to fiscal and financial woes of public transit agencies as the most uniquely attractive cost‐saving strategy at present. Most transit service contracting, however, has been in the traditional provision of entire fixed route bus service or commuter express bus service, and exclusive demand responsive service for the general public or for special disadvantaged population groups such as the elderly and/or the handicapped. This paper presents a new module in transit service contracting whereby the public and private operators jointly provide the peak service on the same route and at the same time. While the public agency provides the base demand of the service, the private provider provides the excess demand, both following the same schedules and similar service arrangements. In this paper, proposed service arrangements, costing and contracting procedures are discussed. It is also reported that substantial cost savings ranging from 32 to 57% with an average savings of 48% can be achieved if the excess peak hour bus transit service on highly peaked routes in public transit agencies is contracted to competing private operator(s).     

Ridership estimation procedure for a transit corridor with new bus rapid transit service

Ridership estimation is a critical step in the planning of a new transit route or change in service. Very often, when a new transit route is introduced, the existing routes will be modified, vehicle capacities changed, or service headways adjusted. This has made ridership forecasts for the new, existing, and modified routes challenging. This paper proposes and demonstrates a procedure that forecasts the ridership of all transit routes along a corridor when a new bus rapid transit (BRT) service is introduced and existing regular bus services are adjusted. The procedure uses demographic data along the corridor, a recent origin–destination survey data, and new and existing transit service features as inputs. It consists of two stages of transit assignment. In the first stage, a transit assignment is performed with the existing transit demand on the proposed BRT and existing bus routes, so that adjustments to the existing bus services can be identified. This transit assignment is performed iteratively until there is no adjustment in transit services. In the second stage, the transit assignment is carried out with the new BRT and adjusted regular bus services, but incorporates a potential growth in ridership because of the new BRT service. The final outputs of the procedure are ridership for all routes and route segments, boarding and alighting volumes at all stops, and a stop‐by‐stop trip matrix. The proposed ridership estimation procedure is applicable to a new BRT route with and without competing regular bus routes and with BRT vehicles traveling in dedicated lanes or in mixed traffic. The application of the proposed procedure is demonstrated via a case study along the Alameda Corridor in El Paso, Texas. Copyright © 2015 John Wiley & Sons, Ltd.     

A structured flexible transit system for low demand areas

Public transit structure is traditionally designed to contain fixed bus routes and predetermined bus stations. This paper presents an alternative flexible-route transit system, in which each bus is allowed to travel across a predetermined area to serve passengers, while these bus service areas collectively form a hybrid “grand” structure that resembles hub-and-spoke and grid networks. We analyze the agency and user cost components of this proposed system in idealized square cities and seek the optimum network layout, service area of each bus, and bus headway, to minimize the total system cost. We compare the performance of the proposed transit system with those of comparable systems (e.g., fixed-route transit network and taxi service), and show how each system is advantageous under certain passenger demand levels. It is found out that under low-to-moderate demand levels, the proposed flexible-route system tends to have the lowest system cost.     

Estimation of urban bus transit marginal cost without cost data

We develop a method to study the industrial structure of urban bus transit without using cost data. To do so, we estimate the marginal cost function under the assumption that firms compete on frequency and adjust frequency to maximize profits. Our methodology is applied to Santiago, Chile. In this case, demand is modeled with a simplified model of transit network assignment. The goal is to consider how frequency, capacity, and on-board passengers affect the bus line’s demand. The marginal cost function is estimated by using the first-order conditions of the firm’s profit maximization problem, using the results of the demand model as data. We conclude that the urban bus transit industry in Santiago exhibits increasing returns to scale for low levels of demand and that these returns are exhausted rapidly at a moderate demand level. Additionally, firms exhibit economies of network expansion, on average.     

Optimization of a feeder-bus route design by using a multiobjective programming approach

This paper presents a feeder-bus route design model, capable of minimizing route length, minimizing maximum route travel time of planned routes, and maximizing service coverage for trip generation. The proposed model considers constraints of route connectivity, subtour prevention, travel time upper bound of a route, relationships between route layout and service coverage, and value ranges of decision variables. Parameter uncertainties are dealt with using fuzzy numbers, and the model is developed as a multiobjective programming problem. A case study of a metro station in Taichung City, Taiwan is then conducted. Next, the programming problem in the case study is solved, based on the technique for order preference by similarity to ideal solution approach to obtain the compromise route design. Results of the case study confirm that the routes of the proposed model perform better than existing routes in terms of network length and service coverage. Additionally, increasing the number of feeder-bus routes decreases maximum route travel time, increases service coverage, and increases network length. To our knowledge, the proposed model is the first bus route design model in the literature to consider simultaneously various stakeholder needs and support for bus route planners in developing alternatives for further evaluation efficiently and systematically.     

Network equilibrium for congested multi‐mode networks with elastic demand

This paper proposes an elastic demand network equilibrium model for networks with transit and walking modes. In Hong Kong, the multi‐mode transit system services over 90% of the total journeys and the demand on it is continuously increasing. Transit and walking modes are related to each other as transit passengers have to walk to and from transit stops. In this paper, the multi‐mode elastic‐demand network equilibrium problem is formulated as a variational inequality problem where the combined mode and route choices are modeled in a hierarchical logit structures and the total travel demand for each origin‐destination pair is explicitly given by an elastic demand function. In addition, the capacity constraint for transit vehicles and the effects of bi‐directional flows on walkways are considered in the proposed model. All these congestion effects are taken into account for modeling the travel choices. A solution algorithm is developed to solve the multi‐mode elastic‐demand network equilibrium model. It is based on a Block Gauss‐Seidel decomposition approach coupled with the method of successive averages. A numerical example is used to illustrate the application of the proposed model and solution algorithm.     

Analyzing urban bus service reliability at the stop, route, and network levels

Improving the reliability of bus service has the potential to increase the attractiveness of public transit to current and prospective riders. An understanding of service reliability is necessary to develop strategies that help transit agencies provide better services. However, few studies have been conducted analyzing bus reliability in the metropolis of China. This paper presents an in-depth analysis of service reliability based on bus operational characteristics in Beijing. Three performance parameters, punctuality index based on routes (PIR), deviation index based on stops (DIS), and evenness index based on stops (EIS), are proposed for the evaluation of bus service reliability. Reliability involves routes, stops, punctuality, deviation, and evenness. The relationship among the three parameters is discussed using a numerical example. Subsequently, through a sampling survey of bus lines in Beijing, service reliability at the stop, route, and network levels are estimated. The effects of route length, headway, the distance from the stop to the origin terminal, and the use of exclusive bus lanes are also analyzed. The results indicate low service reliability for buses in Beijing and a high correlation between service reliability and route length, headway, distance from the stop to the origin terminal, and the provision of exclusive bus lanes.     

Optimizing sustainable feeder bus operation considering realistic networks and heterogeneous demand

A mathematical model is developed to optimize social and fiscal sustainable operation of a feeder bus system considering realistic network and heterogeneous demand. The objective total profit is a nonlinear, mixed integer function, which is maximized by optimizing the number of stops, headway, and fare. The stops are located which maximize the ridership. The demand elasticity for the bus service is dependent on passengers' access distance, wait time, in‐vehicle time, and fare. An optimization algorithm is developed to search for the optimal solution that maximizes the profit. The modeling approach is applied to planning a bus transit system within Woodbridge, New Jersey. Copyright © 2011 John Wiley & Sons, Ltd.     

Development of a transit network from a street map database with spatial analysis and dynamic segmentation

This paper presents an integrated transit-oriented travel demand modeling procedure within the framework of geographic information systems (GIS). Focusing on transit network development, this paper presents both the procedure and algorithm for automatically generating both link and line data for transit demand modeling from the conventional street network data using spatial analysis and dynamic segmentation. For this purpose, transit stop digitizing, topology and route system building, and the conversion of route and stop data into link and line data sets are performed. Using spatial analysis, such as the functionality to search arcs nearest from a given node, the nearest stops are identified along the associated links of the transit line, while the topological relation between links and line data sets can also be computed using dynamic segmentation. The advantage of this approach is that street map databases represented by a centerline can be directly used along with the existing legacy urban transportation planning systems (UTPS) type travel modeling packages and existing GIS without incurring the additional cost of purchasing a full-blown transportation GIS package. A small test network is adopted to demonstrate the process and the results. The authors anticipate that the procedure set forth in this paper will be useful to many cities and regional transit agencies in their transit demand modeling process within the integrated GIS-based computing environment.     

Designing large-scale bus network with seasonal variations of demand

Creating a bus network that covers passenger demand conveniently is an important ingredient of the transit operations planning process. Certainly determination of optimal bus network is highly sensitive to any change of demand, thus it is desirable not to consider average or estimated figures, but to take into account prudently the variations of the demand. Many cities worldwide experience seasonal demand variations which naturally have impact on the convenience and optimality of the transit service. That is, the bus network should provide convenient service across all seasons. This issue, addressed in this work, has not been thoroughly dealt with neither in practice nor in the literature. Analyzing seasonal transit demand variations increases further the computational complexity of the bus-network design problem which is known as a NP-hard problem. A solution procedure using genetic algorithm efficiently, with a defined objective-function to attain the optimization, is proposed to solve this cumbersome problem. The method developed is applied to two benchmarked networks and to a case study, to the city of Mashhad in Iran with over 3.2 million residents and 20 million visitors annually. The case study, characterized by a significant seasonal demand variation, demonstrates how to find the best single network of bus routes to suit the fluctuations of the annual passenger demand. The results of comparing the proposed algorithm to previously developed algorithms show that the new development outperforms the other methods between 1% and 9% in terms of the objective function values.     

Flexible feeder transit route design to enhance service accessibility in urban area

To improve the accessibility of transit system in urban areas, this paper presents a flexible feeder transit routing model that can serve irregular‐shaped networks. By integrating the cost efficiency of fixed‐route transit system and the flexibility of demand responsive transit system, the proposed model is capable of letting operating feeder busses temporarily deviate from their current route so as to serve the reported demand locations. With an objective of minimizing total bus travel time, a new operational mode is then proposed to allow busses to serve passengers on both street sides. In addition, when multiple feeder busses are operating in the target service area, the proposed model can provide an optimal plan to locate the nearest one to response to the demands. A three‐stage solution algorithm is also developed to yield meta‐optimal solutions to the problem in a reasonable amount of time by transforming the problem into a traveling salesman problem. Numerical studies have demonstrated the effectiveness of the proposed model as well as the heuristic solution approach. Copyright © 2015 John Wiley & Sons, Ltd.     

Intermodal Transit System Coordination

In urban areas where transit demand is widely spread, passengers may be served by an intermodal transit system, consisting of a rail transit line (or a bus rapid transit route) and a number of feeder routes connecting at different transfer stations. In such a system, passengers may need one or more transfers to complete their journey. Therefore, scheduling vehicles operating in the system with special attention to reduce transfer time can contribute significantly to service quality improvements. Schedule synchronization may significantly reduce transfer delays at transfer stations where various routes interconnect. Since vehicle arrivals are stochastic, slack time allowances in vehicle schedules may be desirable to reduce the probability of missed connections. An objective total cost function, including supplier and user costs, is formulated for optimizing the coordination of a general intermodal transit network. A four-stage procedure is developed for determining the optimal coordination status among routes at every transfer station. Considering stochastic feeder vehicle arrivals at transfer stations, the slack times of coordinated routes are optimized, by balancing the savings from transfer delays and additional cost from slack delays and operating costs. The model thus developed is used to optimize the coordination of an intermodal transit network, while the impact of a range of factors on coordination (e.g., demand, standard deviation of vehicle arrival times, etc) is examined.     

Integrating bus services with mixed fleets

Conventional bus service (with fixed routes and schedules) has lower average cost than flexible bus service (with demand-responsive routes) at high demand densities. At low demand densities flexible bus service has lower average costs and provides convenient door-to-door service. Bus size and operation type are related since larger buses have lower average cost per passenger at higher demand densities. The operation type and other decisions are jointly optimized here for a bus transit system connecting a major terminal to local regions. Conventional and flexible bus sizes, conventional bus route spacings, areas of service zones for flexible buses, headways, and fleet sizes are jointly optimized in multi-dimensional nonlinear mixed integer optimization problems. To solve them, we propose a hybrid approach, which combines analytic optimization with a Genetic Algorithm. Numerical analysis confirms that the proposed method provides near-optimal solutions and shows how the proposed Mixed Fleet Variable Type Bus Operation (MFV) can reduce total cost compared to alternative operations such as Single Fleet Conventional Bus (SFC), Single Fleet Flexible Bus (SFF), Mixed Fleet Conventional Bus (MFC) and Mixed Fleet Flexible Bus (MFF). With consistent system-wide bus sizes, capital costs are reduced by sharing fleets over times and over regions. The sensitivity of results to several important parameters is also explored.     

An AI-based approach for transit route system planning and design

We present an AI-based solution approach to the transit network design problem (TNDP). Past approaches fall into three categories: optimization formulations of idealized situations, heuristic approaches, or practical guidelines and ad hoc procedures reflecting the professional judgement and practical experience of transit planners. We discuss the sources of complexity of the TNDP as well as the shortcomings of the previous approaches. This discussion motivates the need for AI search techniques that implement the existing designer's knowledge and expertise to achieve better solutions efficiently. Then we propose a hybrid solution approach that incorporates the knowledge and expertise of transit network planners and implements efficient search techniques using AI tools, algorithmic procedures developed by others, and modules for tools implemented in conventional languages. The three major components of the solution approach are presented, namely, the lisp-implemented route generation design algorithm (RGA), the analysis procedure TRUST (Transit Route Analyst), and the route improvement algorithm (RIA). An example illustration is included.     

Modeling the interaction between buses,passengers and cars on a bus route using a multi-agent system

This paper models part of a public transport network (PTN), specifically, a bus route, as a small-size multi-agent system (MAS). The proposed approach is applied to a case study considering a ‘real world’ bus line within the PTN in Auckland, New Zealand. The MAS-based analysis uses modeling and simulation to examine the characteristics of the observed system – autonomous agents interacting with one another – under different scenarios, considering bus capacity and frequency of service for existing and projected public transport (PT) demand. A simulation model of a bus route is developed, calibrated and validated. Several results are attained, such as when the PT passenger load is not close to bus capacity, this load has no effect on average passenger waiting time at bus stops. The model proposed can be useful to practitioners as a tool to model the interaction between buses and other agents.     

Bus maintenance systems and maintenance scheduling: model formulations and solutions

This paper deals with the problem of scheduling bus maintenance activities. The scheduling of maintenance activities is an important component in bus transit operations planning process. The other components include network route design, setting timetables, scheduling vehicles, and assignment of drivers. This paper presents a mathematical programming approach to the problem. This approach takes as input a given daily operating schedule for all buses assigned to a depot along with available maintenance resources. It, then, attempts to design daily inspection and maintenance schedules for the buses that are due for inspection so as to minimize the interruptions in the daily bus operating schedule, and maximize the utilization of the maintenance facilities. Three integer programming formulations are presented and different properties of the problem are discussed. Several heuristic methods are presented and tested. Some of these procedures produce very close to optimal solutions very efficiently. In some cases, the computational times required to obtain these solutions are less than 1% of the computational time required for the conventional branch and bound algorithm. Several small examples are offered and the computational results of solving the problem for an actual, 181-bus transit property are reported.