Bus control strategies in corridors with signalized intersections

This paper proposes a new dynamic bus control strategy aimed at reducing the negative effects of time-headway variations on route performance, based on real-time bus tracking data at stops. In routes with high demand, any delay of a single vehicle ends up causing an unstable motion of buses and producing the bus bunching phenomena. This strategy controls the cruising speed of buses and considers the extension of the green phase of traffic lights at intersections, when a bus is significantly delayed. The performance of this strategy will be compared to the current static operation technique based on the provision of slack times at holding points. An operational model is presented in order to estimate the effects of each controlling strategy, taking into account the vehicle capacity constraint. Control strategies are assessed in terms of passenger total travel time, operating cost as well as on the coefficient of headway variation. The effects of controlling strategies are tested in an idealized bus route under different operational settings and in the bus route of highest demand in Barcelona by simulation. The results show that the proposed dynamic controlling strategy reduces total system cost (user and agency) by 15–40% as well as the coefficient of headway variation 53–78% regarding the uncontrolled case, providing a bus performance similar to the expected when time disturbance is not presented.     

The allocation of buses in heavily utilized networks with overlapping routes

Many transit systems outside North America are characterized by networks with extensively overlapping routes and buses frequently operating at, or close to, capacity. This paper addresses the problem of allocating a fleet of buses between routes in this type of system; a problem that must be solved recurrently by transit planners. A formulation of the problem is developed which recognizes passenger route choice behavior, and seeks to minimize a function of passenger wait time and bus crowding subject to constraints on the number of buses available and the provision of enough capacity on each route to carry all passengers who would select it. An algorithm is developed based on the decomposition of the problem into base allocation and surplus allocation components. The base allocation identifies a feasible solution using an (approx.) minimum number of buses. The surplus allocation is illustrated for the simple objective of minimizing the maximum crowding level on any route. The bus allocation procedure developed in this paper has been applied to part of the Cairo bus system in a completely manual procedure, and is proposed to be the central element of a short-range bus service planning process for that city.     

Optimizing bus-size and headway in transit networks

Optimization models for calculating the best size for passenger carrying vehicles in urban areas were popular during the 1980s. These studies were abandoned in the ‘90s concluding that it was more efficient to use smaller buses at higher frequencies. This article returns to this controversial question, starting from the point of view that any calculation of bus size can only be made after considering the demand for each of the routes on the system. Therefore, an optimization model for sizing the buses and setting frequencies on each route in the system is proposed in accordance with the premises detailed below. The proposed model is a bi-level optimization model with constraints on bus capacity. The model allows buses of different sizes to be assigned to public transport routes optimizing the headways on each route in accordance with observed levels of demand. At the upper level the model considers the optimization of the system’s social and operating costs, these are understood to be the sum of the user’s and operator’s costs. At the lower level there is an assignment model for public transport with constraints on vehicle capacity which balances the flows for bus sizes and headways at each iteration. By graphically representing the results of the model applied to a real case, a series of useful conclusions are reached for the management and planning of a fleet of public transport vehicles.     

Comparing static and dynamic threshold based control strategies

This research extends a static threshold based control strategy used to control headway variation to a dynamic threshold based control strategy. In the static strategy, buses are controlled by setting a threshold value that holds buses at a control point for a certain amount of time before allowing the bus to continue along the route. The threshold remains constant each time the bus stops at the control point. The dynamic strategy involves the same principle of holding buses at a bus stop; however, a different threshold value is chosen each time the bus holds at a control point. The results indicate that in cases where the static threshold is set equal to the scheduled headway, very low headway variation and passenger system times result; however, passengers on board the bus are penalized by extra delay on the bus while waiting at the control point. The dynamic strategy reduces the penalty to passengers delayed on-board the bus at a control point at the expense of a slight increase in overall passenger system time.The results indicate that in most cases, the tradeoff of the slight increase in waiting time for the significant decrease in on-board delay penalty makes the dynamic strategy an acceptable choice.     

Optimal control of headway variation on transit routes

Headway control strategies have been proposed as methods for correcting transit service irregularities and thereby reducing passenger wait times at stops. This paper addresses a particular strategy which can be implemented on high frequency routes (headways under 10–12 minutes), in which buses are held at a control stop to a threshold headway. An algorithm is developed which yields the optimal control stop location and optimal threshold headway with respect to a system wait function. The specification of the wait function is based on the development of several empirical models, including a headway variation model and an average delay time model at control stops. A conclusion is reached that the headway variation does not increase linearly along a route, a common assumption made in many previous studies. Furthermore, the location of the optimal control stop and threshold value are sensitive to the passenger boarding profile, as expected. The algorithm itself appears to have practical application to conventional transit operations.     

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.     

Time of day intervals partition for bus schedule using GPS data

Time of day partition of bus operating hours is a prerequisite of bus schedule design. Reasonable partition plan is essential to improve the punctuality and level of service. In most mega cities, bus vehicles have been equipped with global positioning system (GPS) devices, which is convenient for transit agency to monitor bus operations. In this paper, a new algorithm is developed based on GPS data to partition bus operating hours into time of day intervals. Firstly, the impacts of passenger demand and network traffic state on bus operational performance are analyzed. Then bus dwell time at stops and inter-stop travel time, which can be attained based on GPS data, are selected as partition indexes. For buses clustered in the same time-of-day interval, threshold values of differences in dwell time at stops and inter-stop travel time are determined. The buses in the same time-of-day interval should have adjacent dispatching numbers, which is set as a constraint. Consequently, a partition algorithm with three steps is developed. Finally, a bus route in Suzhou China is taken as an example to validate the algorithm. Three partition schemes are given by setting different threshold values for the two partition indexes. The present scheme in practice is compared with the three proposed schemes. To balance the number of ToD intervals and partition precision, a Benefit Evaluation Index is proposed, for a better time-of-day interval plan.     

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.     

Passenger travel characteristics and bus operational states: a study based on IC card and GPS data in Yinchuan,China

ABSTRACT

In recent years, public transport has been developing rapidly and producing large amounts of traffic data. Emerging big data-mining techniques enable the application of these data in a variety of ways. This study uses bus intelligent card (IC card) data and global positioning system (GPS) data to estimate passenger boarding and alighting stations. First, an estimation model for boarding stations is introduced to determine passenger boarding stations. Then, the authors propose an innovative uplink and downlink information identification model (UDI) to generate information for estimating alighting stations. Subsequently, the estimation model for the alighting stations is introduced. In addition, a transfer station identification model is also developed to determine transfer stations. These models are applied to Yinchuan, China to analyze passenger flow characteristics and bus operations. The authors obtain passenger flows based on stations (stops), bus lines, and traffic analysis zones (TAZ) during weekdays and weekends. Moreover, average bus operational speeds are obtained. These findings can be used in bus network planning and optimization as well as bus operation scheduling.     

Mitigation of disruptions in public transit by Bee Colony Optimization

Dispatchers in many public transit companies face the daily problem of assigning available buses to bus routes under conditions of bus shortages. In addition to this, weather conditions, crew absenteeism, traffic accidents, traffic congestion and other factors lead to disturbances of the planned schedule. We propose the Bee Colony Optimization (BCO) algorithm for mitigation of bus schedule disturbances. The developed model takes care of interests of the transit operator and passengers. The model reassigns available buses to bus routes and, if it is allowed, the model simultaneously changes the transportation network topology (it shortens some of the planned bus routes) and reassigns available buses to a new set of bus routes. The model is tested on the network of Rivera (Uruguay). Results obtained show that the proposed algorithm can significantly mitigate disruptions.     

Optimization of bus routing strategies for evacuation

Efficient transportation of evacuees during an emergency has long been recognized as a challenging issue. This paper investigates emergency evacuation strategies that rely on public transit, where buses run continuously, rather than fixed route, based upon the spatial and temporal information of evacuee needs. We formulated an optimal bus operating strategy that minimizes the exposed casualty time rather than operational cost, as a deterministic mixed‐integer program, and investigated the solution algorithm. A Lagrangian‐relaxation‐based solution algorithm was developed for the proposed model. Numerical experiments with different problem sizes were conducted to evaluate the method. Copyright © 2013 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.     

Disruption management in public transit: the bee colony optimization approach

Disruptions in carrying out planned bus schedules occur daily in many public transit companies. Disturbances are often so large that it is necessary to perform re-planning of planned bus and crew activities. Dispatchers in charge of traffic operations must frequently find an answer to the following question in a very short period of time: How should available buses be distributed among bus routes in order to minimize total passengers' waiting time on the network? We propose a model for assigning buses to scheduled routes when there is a shortage of buses. The proposed model is based on the bee colony optimization (BCO) technique. It is a biologically inspired method that explores collective intelligence applied by honey bees during the nectar collecting process. It has been shown that this developed BCO approach can generate high-quality solutions within negligible processing times.     

小件快运中的最短运输时间问题

小件快运经过多年的发展,已经成为公路客运一个新的经济增长点,越来越多的公路客运企业和汽车客运站加入到经营小件快运的行列,小件快运也逐渐由单个企业的独立运营发展到多个企业联合的网络化运营。对中转运输中多条运输线路进行分析,得到最短运输时间线路,从而提高运输效率。     

A connected-vehicle-based dynamic control model for managing the bus bunching problem with capacity constraints

This paper describes a connected-vehicle-based system architecture which can provide more precise and comprehensive information on bus movements and passenger status. Then a dynamic control method is proposed using connected vehicle data. Traditionally, the bus bunching problem has been formulated into one of two types of optimization problem. The first uses total passenger time cost as the objective function and capacity, safe headway, and other factors as constraints. Due to the large number of scenarios considered, this type of framework is inefficient for real-time implementation. The other type uses headway adherence as the objective and applies a feedback control framework to minimize headway variations. Due to the simplicity in the formulation and solution algorithms, the headway-based models are more suitable for real-time transit operations. However, the headway-based feedback control framework proposed in the literature still assumes homogeneous conditions at all bus stations, and does not consider restricting passenger loads within the capacity constraints. In this paper, a dynamic control framework is proposed to improve not only headway adherence but also maintain the stability of passenger load within bus capacity in both homogenous and heterogeneous situations at bus stations. The study provides the stability conditions for optimal control with heterogeneous bus conditions and derives optimal control strategies to minimize passenger transit cost while maintaining vehicle loading within capacity constraints. The proposed model is validated with a numerical analysis and case study based on field data collected in Chengdu, China. The results show that the proposed model performs well on high-demand bus routes.     

Driving cycle prediction model based on bus route features

Bus fuel economy is deeply influenced by the driving cycles, which vary for different route conditions. Buses optimized for a standard driving cycle are not necessarily suitable for actual driving conditions, and, therefore, it is critical to predict the driving cycles based on the route conditions. To conveniently predict representative driving cycles of special bus routes, this paper proposed a prediction model based on bus route features, which supports bus optimization. The relations between 27 inter-station characteristics and bus fuel economy were analyzed. According to the analysis, five inter-station route characteristics were abstracted to represent the bus route features, and four inter-station driving characteristics were abstracted to represent the driving cycle features between bus stations. Inter-station driving characteristic equations were established based on the multiple linear regression, reflecting the linear relationships between the five inter-station route characteristics and the four inter-station driving characteristics. Using kinematic segment classification, a basic driving cycle database was established, including 4704 different transmission matrices. Based on the inter-station driving characteristic equations and the basic driving cycle database, the driving cycle prediction model was developed, generating drive cycles by the iterative Markov chain for the assigned bus lines. The model was finally validated by more than 2 years of acquired data. The experimental results show that the predicted driving cycle is consistent with the historical average velocity profile, and the prediction similarity is 78.69%. The proposed model can be an effective way for the driving cycle prediction of bus routes.     

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.     

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.     

Development of a probabilistic model to optimize disseminated real‐time bus arrival information for pre‐trip passengers

In the advent of Advanced Traveler Information Systems (ATIS), the total wait time of passengers for buses may be reduced by disseminating real‐time bus arrival times for the next or series of buses to pre‐trip passengers through various media (e.g., internet, mobile phones, and personal digital assistants). A probabilistic model is desirable and developed in this study, while realistic distributions of bus and passenger arrivals are considered. The disseminated bus arrival time is optimized by minimizing the total wait time incurred by pre‐trip passengers, and its impact to the total wait time under both late and early bus arrival conditions is studied. Relations between the optimal disseminated bus arrival time and major model parameters, such as the mean and standard deviation of arrival times for buses and pre‐trip passengers, are investigated. Analytical results are presented based on Normal and Lognormal distributions of bus arrivals and Gumbel distribution of pre‐trip passenger arrivals at a designated stop. The developed methodology can be practically applied to any arrival distributions of buses and passengers.     

Analysis of real-time control strategies in a corridor with multiple bus services

Control strategies have been widely used in the literature to counteract the effects of bus bunching in passenger‘s waiting times and its variability. These strategies have only been studied for the case of a single bus line in a corridor. However, in many real cases this assumption does not hold. Indeed, there are many transit corridors with multiple bus lines interacting, and this interaction affects the efficiency of the implemented control mechanism.This work develops an optimization model capable of executing a control scheme based on holding strategy for a corridor with multiple bus lines.We analyzed the benefits in the level of service of the public transport system when considering a central operator who wants to maximize the level of service for users of all the bus lines, versus scenarios where each bus line operates independently. A simulation was carried out considering two medium frequency bus lines that serve a set of stops and where these two bus lines coexist in a given subset of stops. In the simulation we compared the existence of a central operator, using the optimization model we developed, against the independent operation of each line.In the simulations the central operator showed a greater reduction in the overall waiting time of the passengers of 55% compared to a no control scenario. It also provided a balanced load of the buses along the corridor, and a lower variability of the bus headways in the subset of stops where the lines coexist, thus obtaining better reliability for all types of passengers present in the public transport system.