An individual information system for visualizing the bus and subway network

The system described in this paper allows the user to visualize the Montreal transportation system. The user is provided with several different maps.

The complete subway network and all regular bus lines have been included. The subway network and the bus lines can be selectively displayed. The most attractive feature of this system is the possibility of obtaining all possible routes between two different places. The input is based on the menu technique.

The system can be easily adapted to other large urban transportation systems.     

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.     

Design and development of interactive trip planning for web-based transit information systems

This article presents a Web-based transit information system design that uses Internet Geographic Information Systems (GIS) technologies to integrate Web serving, GIS processing, network analysis and database management. A path finding algorithm for transit network is proposed to handle the special characteristics of transit networks, e.g., time-dependent services, common bus lines on the same street, and non-symmetric routing with respect to an origin/destination pair. The algorithm takes into account the overall level of services and service schedule on a route to determine the shortest path and transfer points. A framework is created to categorize the development of transit information systems on the basis of content and functionality, from simple static schedule display to more sophisticated real time transit information systems. A unique feature of the reported Web-based transit information system is the Internet-GIS based system with an interactive map interface. This enables the user to interact with information on transit routes, schedules, and trip itinerary planning. Some map rendering, querying, and network analysis functions are also provided.     

Methodology for kinematic cycle characterization of vehicles with fixed routes in urban areas

This paper analyses the driving cycles of a fleet of vehicles with predetermined urban itineraries. Most driving cycles developed for such type of vehicles do not properly address variability among itineraries. Here we develop a polygonal driving cycle that assesses each group of related routes, based on microscopic parameters. It measures the kinematic cycles of the routes traveled by the vehicle fleet, segments cycles into micro-cycles, and characterizes their properties, groups them into clusters with homogeneous kinematic characteristics within their specific micro-cycles, and constructs a standard cycle for each cluster. The process is used to study public bus operations in Madrid.     

Real-time control of buses for schedule coordination at a terminal

Recently, bus transit operators have begun to adopt technologies that enable bus locations to be tracked from a central location in real-time. Combined with other technologies, such as automated passenger counting and wireless communication, it is now feasible for these operators to execute a variety of real-time strategies for coordinating the movement of buses along their routes. This paper compares control strategies that depend on technologies for communication, tracking and passenger counting, to those that depend solely on local information (e.g., time that a bus arrived at a stop, and whether other connecting buses have also arrived). We also develop methods to forecast bus arrival times, which are most accurate for lines with long headways, as is usually the case in timed transfer systems. These methods are tested in simulations, which demonstrate that technology is most advantageous when the schedule slack is close to zero, when the headway is large, and when there are many connecting buses.     

Study on some bus transport networks in China with considering spatial characteristics

Many real-world networks are embedded in spaces. Recent studies have found that spatial characteristics are closely related to network features. Bus transport networks (BTNs) are typical spatially embedded networks, but their spatial characteristics are commonly disregarded in previous researches. In this paper, we propose a new spatial representation model for BTNs with information on the geographical location of bus stations and routes, for which we named as the ES model. The new model aids in the study of real-world BTNs. By performing a statistical study with the new representation model on three typical BTNs in China, namely the Beijing, Shanghai and Hangzhou BTNs, we identify some network features that are consistent with those revealed by previous studies, as well as some new features such as high clustering of short-distance station pairs (SSPs) and small average number of bus routes in a path. The result shows that the existence of SSPs can significantly influence the characteristics of BTNs. Besides, with the help of the ES model, we designed a new transfer algorithm for BTNs.     

The future for in‐vehicle information systems: The technology and its impacts

In‐vehicle information has an important social role to play in improving the efficiency and safety of travel by all modes. In this review, three generations of system are identified. The first generation consists of simple in‐vehicle units relying heavily on external data. The second generation has more sophisticated in‐vehicle units with colour TFT screens and DVD players for maps and entertainment. The third generation again makes use of external data, using the mobile phone network to download map sections and other data as and when required, thereby obviating the need for beacons and map CDs. For locationing, GPS (and/or Galileo, the European version of GPS) remains the favoured technology. Portable devices offering multi‐modal information could improve inter‐modal transport efficiency.     

Berth assignment planning for multi‐line bus stops

In this paper, we study an important problem that arises with the fast development of public transportation systems: when a large number of bus lines share the same bus stop, a long queue of buses often forms when they wait to get into the stop in rush hours. This causes a significant increase of bus delay and a notable drop of traffic capacity near the bus stop. Various measures had been proposed to relieve the congestions near bus stops. However, all of them require considerable financial budgets and construction time costs. In this paper, with the concept of berth assignment redesign, a simulation‐based heuristic algorithm is proposed to make full use of exiting bus berths. In this study, a trustable simulation platform is designed, and the major influencing factors for bus stop operations are considered. The concept of risk control is also introduced to better evaluate the performance of different berth arrangement plans and makes an appropriate trade‐off between the system's efficiency and stability. Finally, a heuristic algorithm is proposed to find a sub‐optimal berth assignment plan. Tests on a typical bus stop show that this algorithm is efficient and fast. The sub‐optimal berth assignment plan obtained by this algorithm could make remarkable improvements to an actual bus stop. Copyright © 2013 John Wiley & Sons, Ltd.     

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.     

Likelihood-based offline map matching of GPS recordings using global trace information

In batch map matching the objective is to derive from a time series of position data the sequence of road segments visited by the traveler for posterior analysis. Taking into account the limited accuracy of both the map and the measurement devices several different movements over network links may have generated the observed measurements. The set of candidate solutions can be reduced by adding assumptions about the traveller’s behavior (e.g. respecting speed limits, using shortest paths, etc.). The set of feasible assumptions however, is constrained by the intended posterior analysis of the link sequences produced by map matching. This paper proposes a method that only uses the spatio-temporal information contained in the input data (GPS recordings) not reduced by any additional assumption.The method partitions the trace of GPS recordings so that all recordings in a part are chronologically consecutive and match the same set of road segments. Each such trace part leads to a collection of partial routes that can be qualified by their likelihood to have generated the trace part. Since the trace parts are chronologically ordered, an acyclic directed graph can be used to find the best chain of partial routes. It is used to enumerate candidate solutions to the map matching problem.Qualification based on behavioral assumptions is added in a separate later stage. Separating the stages helps to make the underlying assumptions explicit and adaptable to the purpose of the map matched results. The proposed technique is a multi-hypothesis technique (MHT) that does not discard any hypothesized path until the second stage.A road network extracted from OpenStreetMap (OSM) is used. In order to validate the method, synthetic realistic GPS traces were generated from randomly generated routes for different combinations of device accuracy and recording period. Comparing the base truth to the map matched link sequences shows that the proposed technique achieves a state of the art accuracy level.     

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.     

Mapping spatial accessibility of public transportation network in an urban area – A case study of Shanghai Hongqiao Transportation Hub

Accessibility is a key metric when assessing the efficiency of an urban public transportation network. This research develops a methodology for evaluating spatial accessibility of a system with multiple transportation modes in an urban area, Shanghai Hongqiao Transportation Hub (SHTH) and its surrounding area. The method measured total traveling time as an accessibility indicator, which summed the time people spent on walking, waiting, transfer and transportation in a journey from the SHTH to destinations. Spatial accessibility was classified into five levels from very high to very low. The evaluation was conducted at a cell-by-cell basis under an overall scenario and three specific scenarios. Evaluation results were presented in a series of maps. The overall accessibility scenario shows a concentric-ring trend decreasing from the SHTH to the fringe of the study area. Areas along the metro lines generally have a much higher accessibility than those along the bus lines with some exceptions where bus routes play a more important role. Metro stations identified as either time-saving or time-consuming points are mainly distributed around the urban center. Some suggestions are proposed for improving accessibility of public transportation network in the study area. The results from this study provide a scientific basis and useful information for supporting decision-making on urban planning, and assisting dwellers to travel in a time-efficient manner. The methodology offers a simple, flexible way to the spatial evaluation, metro station identification and network modification of accessibility of public transportation systems with multiple transportation modes.     

The impact of real-time information on bus ridership in New York City

In the past few years, numerous mobile applications have made it possible for public transit passengers to find routes and/or learn about the expected arrival time of their transit vehicles. Though these services are widely used, their impact on overall transit ridership remains unclear. The objective of this research is to assess the effect of real-time information provided via web-enabled and mobile devices on public transit ridership. An empirical evaluation is conducted for New York City, which is the setting of a natural experiment in which a real-time bus tracking system was gradually launched on a borough-by-borough basis beginning in 2011. Panel regression techniques are used to evaluate bus ridership over a three year period, while controlling for changes in transit service, fares, local socioeconomic conditions, weather, and other factors. A fixed effects model of average weekday unlinked bus trips per month reveals an increase of approximately 118 trips per route per weekday (median increase of 1.7% of weekday route-level ridership) attributable to providing real-time information. Further refinement of the fixed effects model suggests that this ridership increase may only be occurring on larger routes; specifically, the largest quartile of routes defined by revenue miles of service realized approximately 340 additional trips per route per weekday (median increase of 2.3% per route). Although the increase in weekday route-level ridership may appear modest, on aggregate these increases exert a substantial positive effect on farebox revenue. The implications of this research are critical to decision-makers at the country’s transit operators who face pressure to increase ridership under limited budgets, particularly as they seek to prioritize investments in infrastructure, service offerings, and new technologies.     

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.     

Dynamic user equilibrium in public transport networks with passenger congestion and hyperpaths

This paper presents a dynamic user equilibrium for bus networks where recurrent overcrowding results in queues at stops. The route-choice model embedded in the dynamic assignment explicitly considers common lines and strategies with alternative routes. As such, the shortest hyperpath problem is extended to a dynamic scenario with capacity constraints where the diversion probabilities depend on the time at which the stop is reached and on the expected congestion level at that time. In order to reproduce congestion for all the lines sharing a stop, the Bottleneck Queue Model with time-varying exit capacity, introduced in Meschini et al. (2007), is extended. The above is applied to separate queues for each line in order to satisfy the First-In-First-Out principle within every attractive set, while allowing overtaking among passengers with different attractive sets but queuing single file. The application of the proposed model to a small example network clearly reproduces the formation and dispersion of passenger queues due to capacity constraints and thus motivates the implementation of the methodology on a real-size network case as the next step for future research.     

Multimodal,multiclass stochastic dynamic traffic assignment for evaluating information provision strategies

A multimodal, multiclass stochastic dynamic traffic assignment model was developed to evaluate pre‐trip and enroute travel information provision strategies. Three different information strategies were examined: user optimum [UO], system optimum [SO] and mixed optimum [MO]. These information provision strategies were analyzed based on the levels of traffic congestion and market penetration rate for the information equipment. Only two modes, bus and car, were used for evaluating and calculating the modal split ratio. Several scenarios were analyzed using day‐to‐day and within day dynamic models. From the results analyzed, it was found that when a traffic manager provides information for drivers using the UO strategy and drivers follow the provided information absolutely, the total travel time may increases over the case with no information. Such worsening occurs when drivers switch their routes and face traffic congestion on the alternative route. This phenomenon is the 'Braess Paradox'.     

Attitudes of bus operators towards real-time transit information tools

Although it is apparent that providing useful information has a positive effect on transit riders, no studies to date have investigated bus operators’ reactions to real-time arrival information and other potential rider information tools. In this study, the project team surveyed 253 bus operators to determine their views and values concerning the existing use of real-time information and to ask about future transit rider information applications. Almost all operators (93 and 91 % on two separate questions) were positive or neutral to the provision of real-time information. In addition, operators were receptive to building other new information applications, with all applications in the survey being supported by at least 60 % of the bus operators. The two most widely supported potential applications in the survey were additional tools to help blind and deaf-blind riders (89 % of bus operators favored) and an application that would aid riders in identifying physical stop, shelter and bus issues such as graffiti, broken parts or a need for lights (88 % of bus operators). Applications displaying data about past performance or current bus capacity received the least support (66 and 61 % respectively). This research gives a better understanding of the impact of rider information tools on bus operators, including the views and values of the operators, and the harms and benefits of such tools.     

Customized bus service design for jointly optimizing passenger-to-vehicle assignment and vehicle routing

Emerging transportation network services, such as customized buses, hold the promise of expanding overall traveler accessibility in congested metropolitan areas. A number of internet-based customized bus services have been planned and deployed for major origin-destination (OD) pairs to/from inner cities with limited physical road infrastructure. In this research, we aim to develop a joint optimization model for addressing a number of practical challenges for providing flexible public transportation services. First, how to maintain minimum loading rate requirements and increase the number of customers per bus for the bus operators to reach long-term profitability. Second, how to optimize detailed bus routing and timetabling plans to satisfy a wide range of specific user constraints, such as passengers’ pickup and delivery locations with preferred time windows, through flexible decision for matching passengers to bus routes. From a space-time network modeling perspective, this paper develops a multi-commodity network flow-based optimization model to formulate a customized bus service network design problem so as to optimize the utilization of the vehicle capacity while satisfying individual demand requests defined through space-time windows. We further develop a solution algorithm based on the Lagrangian decomposition for the primal problem and a space-time prism based method to reduce the solution search space. Case studies using both the illustrative and real-world large-scale transportation networks are conducted to demonstrate the effectiveness of the proposed algorithm and its sensitivity under different practical operating conditions.     

Optimal transit routing with partial online information

This paper studies the routing strategy in a transit network with partial online information at stops. By partial online information, we mean that the arrival time of the incoming transit vehicles is available for a subset of the lines serving a stop. To cope with the partial information assumption, a new routing strategy is proposed and closed form formulae for computing expected waiting times and line boarding probabilities are derived. The proposed strategy unifies existing hyperpath-based transit route choice models that assume either no information or full information. Like many existing models, it ensures optimality when all information is available or the headway is exponentially distributed. The problem of determining the attractive set is discussed for each of the three information cases. In particular, a new heuristic algorithm is developed to generate the attractive set in the partial information case, which will always yield a solution no worse than that obtained without any information. The paper also reveals that, when information is available, an optimal hyperpath may contain cycles. Accordingly, the cause of such cycles is analyzed, and a sufficient condition that excludes cycles from optimal hyperpaths is proposed. Finally, numerical experiments are conducted to illustrate the impact of information availability on expected travel times and transit line load distributions. Among other findings, the results suggest that it is more useful to have information on faster lines than on slower lines.     

Transfer demand prediction for timed transfer coordination in public transport operational control

Timed transfer coordination in public transit reduces passenger transfer time by providing seamless interconnected transfers. The problem arises when a Receiving Vehicle (RV) arrives to the transfer stop before a Feeding Vehicle (FV) carrying transferring passengers. Timed transfer coordination in operational control dynamically decides whether a RV is held at the transfer stop to allow transfers, or departs as scheduled. While transfer demand is essential for implementing timed transfer coordination, this variable is generally not available in public transit because of the lack of passenger transfer plans. The problem of acquiring this variable in real‐time has also received limited attention in the related literature. This paper proposes a new method to dynamically predict the transfer demand. We anticipate the transferring probability from each individual passenger by examining historical travel itineraries. Three different types of models (simple analytical, statistical, and computation intelligence model) are developed to forecast the number of transferring passengers. Numerical experiments using observed Automatic Vehicle Location and Automatic Fare Collection data from South East Queensland, Australia show the accuracy and applicability of the proposed models in timed transfer coordination. Copyright © 2017 John Wiley & Sons, Ltd.