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.     

Optimal design of a short‐turning strategy considering seat availability

We develop a methodology to optimize the schedule coordination of a full‐stop service pattern and a short‐turning service pattern on a bus route. To capture the influence of bus crowding and seat availability on passengers' riding experience, we develop a Markov model to describe the seat‐searching process of a passenger and an approach to estimate the transition probabilities of the Markov model. An optimization model that incorporates the Markov model is proposed to design the short‐turning strategy. The proposed model minimizes the total cost, which includes operational cost, passengers' waiting time cost and passengers' in‐vehicle travel time cost. Algorithm is developed to produce optimal values of the decision variables. The proposed methodology is evaluated in a case study. Compared with methodologies that ignore the effect of bus crowding, the proposed methodology could better balance bus load along the route and between two service patterns, provide passengers with better riding experience and reduce the total cost. In addition, it is shown that the optimal design of the short‐turning strategy is sensitive to seat capacity. Copyright © 2016 John Wiley & Sons, Ltd.     

Analytical model for calibrating delay at congested bus stops

Abstract

A model is proposed to calculate the overall operating and delay times spent at bus stops due to passenger boarding and alighting and the time lost to queuing caused by bus stop saturation. A formula for line demand at each stop and the interaction between the buses themselves is proposed and applied to different bus stops depending on the number of available berths. The application of this model has quantified significant operational delays suffered by users and operator due to consecutive bus arrival at stops, even with flows below bus stop capacity.     

A column generation algorithm for the bus driver scheduling problem

Bus driver scheduling aims to find the minimum number of bus drivers to cover a published timetable of a bus company. When scheduling bus drivers, contractual working rules must be enforced, thus complicating the problem. In this research, we develop a column generation algorithm that decomposes this complicated problem into a master problem and a series of pricing subproblems. The master problem selects optimal duties from a set of known feasible duties, and the pricing subproblem augments the feasible duty set to improve the solution obtained in the master problem. The proposed algorithm is empirically applied to the realistic problems of several bus companies. The numerical results show that the proposed column generation algorithm can solve real‐world problems and obtain bus driver schedules that are better than those developed and used by the bus companies. Copyright © 2016 John Wiley & Sons, Ltd.     

Strategic evacuation planning with pedestrian guidance and bus routing: a mixed integer programming model and heuristic solution

This paper presents a mathematical model to plan emergencies in a densely populated urban zone where a certain numbers of pedestrians depend on transit for evacuation. The proposed model features an integrated operational framework, which simultaneously guides evacuees through urban streets and crosswalks (referred to as “the pedestrian network”) to designated pickup points (e.g., bus stops), and routes a fleet of buses at different depots to those pick‐up points and transports evacuees to their destinations or safe places. In this level, the buses are routed through the so‐called “vehicular network.” An integrated mixed integer linear program that can effectively take into account the interactions between the aforementioned two networks is formulated to find the maximal evacuation efficiency in two networks. Because the large instances of the proposed model are mathematically difficult to solve to optimality, a two‐stage heuristic is developed to solve larger instances of the model. Results from hundreds of numerical examples analysis indicate that proposed heuristic works well in providing (near) optimal or feasibly good solutions for medium‐scale to large‐scale instances that may arise in real transit‐based evacuation situations in a much shorter amount of computational time compared with cplex (can find optimal/feasible solutions for only five instances within 3 hours of running). Copyright © 2016 John Wiley & Sons, Ltd.     

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).     

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.     

Optimization of headways with stop‐skipping control: a case study of bus rapid transit system

Bus rapid transit system is designed to provide high‐quality and cost‐efficient passenger transportation services. In order to achieve this design objective, effective scheduling strategies are required. This research aims at improving the operation efficiency and service quality of a BRT system through integrated optimization of its service headways and stop‐skipping strategy. Based on cost analysis for both passengers and operation agencies, an optimization model is established. A genetic algorithms based algorithm and an application‐oriented solution method are developed. Beijing BRT Line 2 has been chosen as a case study, and the effectiveness of the optimal headways with stop‐skipping services under different demand levels has been analyzed. The results has shown that, at a certain demand level, the proposed operating strategy can be most advantageous for passengers with an accepted increase of operating costs, under which the optimum headway is between 3.5 and 5.5 min for stop‐skipping services during the morning peak hour depending on the demand with the provision of stop‐skipping services. The effectiveness of the optimal headways with stop‐skipping services is compared with those of existing headways and optimal headways without stop‐skipping services. The results show that operating strategies under the optimal headways with stop‐skipping services outperforms the other two operating strategies with respect to total costs and in‐vehicle time for passengers. Copyright © 2014 John Wiley & Sons, Ltd.     

Optimal feeder bus routes on irregular street networks

The methodology presented here seeks to optimize bus routes feeding a major intermodal transit transfer station while considering intersection delays and realistic street networks. A model is developed for finding the optimal bus route location and its operating headway in a heterogeneous service area. The criterion for optimality is the minimum total cost, including supplier and user costs. Irregular and discrete demand distributions, which realistically represent geographic variations in demand, are considered in the proposed model. The optimal headway is derived analytically for an irregularly shaped service area without demand elasticity, with non‐uniformly distributed demand density, and with a many‐to‐one travel pattern. Computer programs are designed to analyze numerical examples, which show that the combinatory type routing problem can be globally optimized. The improved computational efficiency of the near‐optimal algorithm is demonstrated through numerical comparisons to an optimal solution obtained by the exhaustive search (ES) algorithm. The CPU time spent by each algorithm is also compared to demonstrate that the near‐optimal algorithm converges to an acceptable solution significantly faster than the ES algorithm.     

Evaluation of exclusive bus lanes in a bi-modal degradable road network

In this paper, we proposed an evaluation method of exclusive bus lanes (EBLs) in a bi-modal degradable road network with car and bus transit modes. Link travel time with and without EBLs for two modes is analyzed with link stochastic degradation. Furthermore, route general travel costs are formulated with the uncertainty of link travel time for both modes and the uncertainty of waiting time at a bus stop and in-vehicle congestion costs for the bus mode. The uncertainty of bus waiting time is considered to be relevant to the degradation of the front links of the bus line. A bi-modal user equilibrium model incorporating travelers’ risk adverse behavior is proposed for evaluating EBLs. Finally, two numerical examples are used to illustrate how the road degradation level, travelers’ risk aversion level and the front link’s correlation level with the uncertainty of the bus waiting time affect the results of the user equilibrium model with and without EBLs and how the road degradation level affects the optimal EBLs setting scheme. A paradox of EBLs setting is also illustrated where adding one exclusive bus lane may decrease share of bus.     

An improved headway-based holding strategy for bus transit

Abstract

This paper presents an improved headway-based holding strategy integrating bus transit travel and dwelling time prediction. A support vector machine-based (SVM) model is developed to predict the baseline travel and dwell times of buses based on recent data. In order to reduce prediction errors, an adaptive algorithm is used together with real-time bus operational information and estimated baseline times from SVM models. The objective of the improved holding strategy is to minimize the total waiting times of passengers at the current stop and at successive stops. Considering the time-varying features of bus running, a ‘forgetting factor’ is introduced to weight the most recent data and reduce the disturbance from unexpected incidents. Finally, the improved holding strategy proposed in this study is illustrated using the microscopic simulation model Paramics and some conclusions are drawn.     

Designing a home-to-work bus service in a metropolitan area

This paper presents a model and an algorithm for the design of a home-to-work bus service in a metropolitan area. This type of service must display an equilibrium between conflicting criteria such as efficiency, effectiveness, and equity. To this end, we introduce a multi-objective model in which, among other aspects, equity is considered by time windows on the arrival time of a bus at a stop. Time windows can have other uses such as, for example, guaranteeing synchronization of the service with other transportation modes. This is one of the guiding principles of the proposed model which is based on concepts that simultaneously tackle several issues at once. Along this line, we propose a cluster routing approach to model both bus stop location and routing in urban road networks where turn restrictions exist. The resulting multi-objective location-routing model is solved by a tabu search algorithm. As an application, we analyze a home-to-work bus service for a large research center located in Rome, Italy. This case study provides a benchmark for the algorithmic results, and shows the practical relevance of the proposed methodology.     

Bus arrival time prediction at bus stop with multiple routes

Provision of accurate bus arrival information is vital to passengers for reducing their anxieties and waiting times at bus stop. This paper proposes models to predict bus arrival times at the same bus stop but with different routes. In the proposed models, bus running times of multiple routes are used for predicting the bus arrival time of each of these bus routes. Several methods, which include support vector machine (SVM), artificial neural network (ANN), k nearest neighbours algorithm (k-NN) and linear regression (LR), are adopted for the bus arrival time prediction. Observation surveys are conducted to collect bus running and arrival time data for validation of the proposed models. The results show that the proposed models are more accurate than the models based on the bus running times of single route. Moreover, it is found that the SVM model performs the best among the four proposed models for predicting the bus arrival times at bus stop with multiple routes.     

Integrated optimization of bus priority operations in connected vehicle environment

Most previous works associated with transit signal priority merely focus on the optimization of signal timings, ignoring both bus speed and dwell time at bus stops. This paper presents a novel approach to optimize the holding time at bus stops, signal timings, and bus speed to provide priority to buses at isolated intersections. The objective of the proposed model is to minimize the weighted average vehicle delays of the intersection, which includes both bus delay and impact on nearby intersection traffic, ensuring that buses clear these intersections without being stopped by a red light. A set of formulations are developed to explicitly capture the interaction between bus speed, bus holding time, and transit priority signal timings. Experimental analysis is used to show that the proposed model has minimal negative impacts on general traffic and outperforms the no priority, signal priority only, and signal priority with holding control strategies (no bus speed adjustment) in terms of reducing average bus delays and stops. A sensitivity analysis further demonstrates the potential of the proposed approach to be applied to bus priority control systems in real‐time under different traffic demands, bus stop locations, and maximum speed limits. Copyright © 2016 John Wiley & Sons, Ltd.     

Investigating the impact of stochastic vehicle arrivals to optimal stop spacing and headway for a feeder bus route

Stop spacing and service frequency (i.e., the inverse of headway) are key elements in transit service planning. The trade‐offs between increasing accessibility and reducing travel time, which affect transit system performance, need to be carefully evaluated. The objective of this study is to optimize stop spacing and headway for a feeder bus route, considering the relationship between the variance of inter‐arrival time (VIAT), which yields the minimum total cost (including user and operator costs). A solution algorithm, called successive substitution, is adapted to efficiently search for the optimal solutions. In a numerical example, the developed model is applied to planning a feeder bus route in Newark, New Jersey. The results indicate that the optimal stop spacing should be longer that those suggested by previous studies where the impact of VIAT was ignored. Reducing VIAT via certain operational control strategies (i.e., holding/stop‐skipping, transit signal priority) may shorten stop spacing and improve accessibility. Copyright © 2014 John Wiley & Sons, Ltd.     

A discrete-convex programming approach to the simultaneous optimization of land use and transportation

Three design problems are discussed in this article. First, it is shown that the network design problem with congestion reduces to an all-or nothing traffic assignment problem under some assumptions on the congestion function and the investment cost function. Second, the land use design problem is formulated as an extension of the Koopmans-Beckmann problem and a heuristic is proposed to solve this problem. Third, it is shown that the seemingly more complex problem of designing jointly a land-use plan and a transportation network reduces to a pure land-use design problem. All that is needed to solve the joint optimization problem is a shortest path algorithm and a heuristic to solve the land use design problem. Computational experience is reported for each algorithm.     

Genetic algorithms in bus network optimization

This paper focuses on a new method to compute fitness function (ff) values in genetic algorithms for bus network optimization. In the proposed methodology, a genetic algorithm is used to generate iteratively new populations (sets of bus networks). Each member of the population is evaluated by computing a number of performance indicators obtained by the analysis of the assignment of the O/D demand associated to the considered networks. Thus, ff values are computed by means of a multicriteria analysis executed on the performance indicators so found. The goal is to design a heuristic that allows to achieve the best bus network satisfying both the demand and the offer of transport.     

Optimal planning of liquefied natural gas deliveries

We investigate the problem of designing an optimal annual delivery plan for Liquefied Natural Gas (LNG). This problem requires determining the long-term cargo delivery dates and the assignment of vessels to the cargoes while accommodating several constraints, including berth availability, liquefaction terminal inventory, planned maintenance, and bunkering requirements. We describe a novel mixed-integer programming formulation that captures important industry requirements and constraints with the objective of minimizing the vessel fleet size. A peculiar property of the proposed formulation is that it includes a polynomial number of variables and constraints and is, in our experience, computationally tractable for large problem instances using a commercial solver. Extensive computational runs demonstrate the efficacy of the proposed model for real instances provided by a major energy company that involve up to 118 cargoes and a 373-day planning horizon.     

A heuristic model for frequency planning and aircraft routing in small size airlines

The flight schedule of an airline is the primary factor in finding the most effective and efficient deployment of the airline's resources. The flight schedule process aims at finding a set of routes with associated aircraft type, frequency of service and times of departures and arrivals in order to satisfy a specific objective such as profit maximization. In this paper, we develop a two‐phase heuristic model for airline frequency planning and aircraft routing for small size airlines. The first phase develops a frequency plan using an economic equilibrium model between passenger demand for flying a particular route and aircraft operating characteristics. The second phase uses a time‐of‐day model to develop an assignment algorithm for aircraft routing.     

Integrated optimization of transit priority operation at isolated intersections: A person-capacity-based approach

In this paper, a person-capacity-based optimization method for the integrated design of lane markings, exclusive bus lanes, and passive bus priority signal settings for isolated intersections is developed. Two traffic modes, passenger cars and buses, have been considered in a unified framework. Person capacity maximization has been used as an objective for the integrated optimization method. This problem has been formulated as a Binary Mixed Integer Linear Program (BMILP) that can be solved by a standard branch-and-bound routine. Variables including, allocation of lanes for different passenger car movements (e.g., left turn lanes or right turn lanes), exclusive bus lanes, and passive bus priority signal timings can be optimized simultaneously by the proposed model. A set of constraints have been set up to ensure feasibility and safety of the resulting optimal lane markings and signal settings. Numerical examples and simulation results have been provided to demonstrate the effectiveness of the proposed person-capacity-based optimization method. The results of extensive sensitivity analyses of the bus ratio, bus occupancy, and maximum degree of saturation of exclusive bus lanes have been presented to show the performance and applicable domain of the proposed model under different composition of inputs.