Modeling and optimizing urban bus transit considering headway variation for cost and service reliability analysis

Due to the stochastic nature of traffic conditions and demand fluctuations, it is a challenging task for operators to maintain reliable services, and passengers often suffer from longer travel times. A failure to consider this issue while planning bus services may lead to undesirable results, such as higher costs and a deterioration in level of service. Considering headway variation at route stops, this paper develops a mathematical model to optimize bus stops and dispatching headways that minimize total cost, consisting of both user and operator costs. A Genetic Algorithm is applied to search for a cost-effective solution in a real-world case study of a bus transit system, which improves service reliability in terms of a reduced coefficient of variation of headway.     

Some estimation results of a simultaneous model of auto ownership and mode choice to work

This paper describes the theory, development and estimation of a simultaneous disaggregate model of automobile ownership and mode to work choices. The motivation for such a model and the general theory of the simultaneous probabilistic choice model are briefly discussed. The general model specification and the set of choices assumed to be available to each household is then considered. Finally, the variables used in the model are defined and the estimation results are presented.     

Coordination of last train transfers using automated fare collection (AFC) system data

This paper studies last train coordination problem for metro networks, aiming to maximize the total number of passengers who can reach their destinations by metro prior to the end of operation. The concept of last boarding time is defined as the latest time that passengers can board the last trains and reach final destinations. The corresponding method for calculating last boarding time is also put forward. With automatic fare collection system data, an optimization model for coordinating last trains is proposed. The objective function optimizes the number of passengers who can reach their final destinations during the train period using departure times and headways of last trains for each line as decision variables. Afterwards, an adaptive genetic algorithm is put forward to solve this model and is applied to a case study of the Shanghai metro system. Copyright © 2017 John Wiley & Sons, Ltd.     

Eliminating barriers to nighttime activity participation: the case of on-demand transit in Belleville,Canada

Transportation - Demand-responsive technologies are rapidly changing the transportation landscape. The City of Belleville, Ontario has recently replaced its evening and nighttime fixed route bus...     

Simulation‐based estimates of delays at freeway work zones

Work zone related traffic delay is an important cost component on freeways with maintenance activities. This study demonstrates that delays may be underestimated by using the deterministic queuing theory. Computer simulation is a valuable approach of estimating delay under a variety of existing and future conditions. However, a single simulation run, which can be quite costly in terms of both computer and analyst time, produces a delay estimate for only one traffic level under one set of conditions. A method is developed in this paper to approximate delays by integrating limited simulation data, obtained from CORSIM and the concept of deterministic queuing theory, while various geometric conditions and time‐varying traffic distribution are considered. A calibrated and validated simulation model that can reflect work zone traffic operations on a segment of Interstate 1–80 in New Jersey is used to generate data for developing the proposed model. The comparison of delays estimated by the deterministic queuing model and the proposed model is conducted, while factors affecting the accuracy of the delay estimates are discussed.     

Scheduling highway work zones with genetic algorithm considering the impact of traffic diversion

Highway work zones caused excessive delay to road users. To reduce user and maintenance costs, work zones shall be designed and scheduled accordingly. An analytical model is developed to jointly optimize work zone lengths and schedule as well as diverted traffic volume for highway maintenance projects, considering time‐varying demand, variable maintenance cost, and various production rates of maintenance crew. With a genetic algorithm, an iterative procedure is developed to search for the optimal solution. A numerical example is illustrated, in which various traffic mitigation plans for a highway maintenance project are evaluated. A sensitivity analysis is conducted, and results indicate the threshold volumes for various conditions (e.g., maintenance crews and capacity of the work zone) at which diverting traffic is desirable. This study demonstrates an effective approach to search for the optimal work zone schedule, which is also applicable to evaluate the effectiveness of traffic diversion plans for a pre‐planned work zone schedule. Copyright © 2012 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.     

A Reusability Study of Vehicle Lateral Control System

The architecture of the PATH vehicle lateral control system is presented in this paper. The two main modules are an intelligent reference/sensing system, and an Frequency-Shaped-Linear-Quadratic/preview control algorithm. The whole lateral control system was formerly evaluated on a two-door test vehicle. It was transplanted to a four-door vehicle which is considerably different from the older two-door test vehicle in dynamic characteristics. The objective of this study is to investigate the reusability of our control system.     

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.