Microscopic decision model for pedestrian route choice at signalized crosswalks

In this paper, two‐tier mathematical models were developed to simulate the microscopic pedestrian decision‐making process of route choice at signalized crosswalks. In the first tier, a discrete choice model was proposed to predict the choices of walking direction. In the second tier, an exponential model was calibrated to determine the step size in the chosen direction. First, a utility function was defined in the first‐tier model to describe the change of utility in response to deviation from a pedestrian's target direction and the conflicting effects of neighboring pedestrians. A mixed logit model was adopted to estimate the effects of the explanatory variables on the pedestrians' decisions. Compared with the standard multinomial logit model, it was shown that the mixed logit model could accommodate the heterogeneity. The repeated observations for each pedestrian were grouped as panel data to ensure that the parameters remained constant for individual pedestrians but varied among the pedestrians. The mixed logit model with panel data was found to effectively address inter‐pedestrian heterogeneity and resulted in a better fit than the standard multinomial logit model. Second, an exponential model in the second tier was proposed to further determine the step size of individual pedestrians in the chosen direction; it indicates the change in walking speed in response to the presence of other pedestrians. Finally, validation was conducted on an independent set of observation data in Hong Kong. The pedestrians' routes and destinations were predicted with the two‐tier models. Compared with the tracked trajectories, the average error between the predicted destinations and the observed destinations was within an acceptable margin. Copyright © 2016 John Wiley & Sons, Ltd.     

Nonlinear pricing of taxi services

This paper examines the effects of nonlinear fare structures in taxi markets using an extended taxi model with an explicit consideration of perceived profitability. The expected profit, defined as the profit per unit time (inclusive of both occupied and vacant taxi times), that a taxi driver expects to receive from picking up a customer in a particular zone or location, has great impact on the taxi driver’s choice of location in the search for customers. The fare structure directly governs the profitability of taxi rides of different distances originating from different locations. With these explicit considerations, the extended model is intended to look into the market effects of adopting a nonlinear fare structure with declining incremental charges. The proposed nonlinear fare structure could help restore a level-playing field for taxi operators whose businesses have been affected by some taxi drivers who resort to practices such as offering fare discounts or accepting requests for discounted fares from passengers for long-haul trips. Analysis of sensitivity of social welfare and profit gain as well as taxi/customer wait/search times is conducted with respect to the parameters in the nonlinear fare structure for the Hong Kong taxi market, and Pareto-improving nonlinear fare amendments are identified that neither disadvantage any customer nor reduce the taxi operators’ profits.     

The optimal dispatching of taxis under congestion: A rolling horizon approach

Taxis make an important contribution to transport in many parts of the world, offering demand‐responsive, door‐to‐door transport. In larger cities, taxis may be hailed on‐street or taken from taxi ranks. Elsewhere, taxis are usually ordered by phone. The objective of a taxi dispatcher is to maximize the efficiency of fleet utilization. While the spatial and temporal distribution of taxi requests has in general a high degree of predictability, real time traffic congestion information can be collected and disseminated to taxis by communication technologies. The efficiency of taxi dispatching may be significantly improved through the anticipation of future requests and traffic conditions. A rolling horizon approach to the optimisation of taxi dispatching is formulated, which takes the stochastic and dynamic nature of the problem into account. Numerical experiments are presented to illustrate the performances of the heuristics, taking the time dependency of travel times and passenger arrivals into account.     

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.     

A schedule‐based dynamic transit network model — Recent advances and prospective future research

Using the schedule‐based approach, in which scheduled timetables are used to describe the movement of vehicles, a dynamic transit assignment model is formulated. Passengers are assumed to travel on a path with minimum generalized cost that consists of four components: in‐vehicle time; waiting time; walking time; and a time penalty for each line change. A specially developed branch and bound algorithm is used to generate the time‐dependent minimum path. The assignment procedure is conducted over a period in which both passenger demand and train headway are varying. This paper presents an overview of the research that has been carried out by the authors to develop the schedule‐based transit assignment model, and offers perspectives for future research.     

Adaptive traffic signal control using approximate dynamic programming

This paper presents a study on an adaptive traffic signal controller for real-time operation. The controller aims for three operational objectives: dynamic allocation of green time, automatic adjustment to control parameters, and fast revision of signal plans. The control algorithm is built on approximate dynamic programming (ADP). This approach substantially reduces computational burden by using an approximation to the value function of the dynamic programming and reinforcement learning to update the approximation. We investigate temporal-difference learning and perturbation learning as specific learning techniques for the ADP approach. We find in computer simulation that the ADP controllers achieve substantial reduction in vehicle delays in comparison with optimised fixed-time plans. Our results show that substantial benefits can be gained by increasing the frequency at which the signal plans are revised, which can be achieved conveniently using the ADP approach.     

An iterative group-based signal optimization scheme for traffic equilibrium networks

This paper presents an iterative scheme for a combined signal optimization and assignment problem, using a traffic model from the well-known procedure TRANSYT. The signal settings are optimized by means of a group-based technique, in which the signal timings are specified by the common cycle time, the start time and duration of the period of right of way for each signal group in the network. The optimization problem was formulated as an integer program and solved by a set of heuristics. Given the optimized signal settings determined from the group-based technique, a path-based assignment algorithm is employed to obtain the equilibrium traffic pattern using the sensitivity information for TRANSYT model and a Frank-Wolf method. Based on the equilibrium flow pattern, the group-based optimization algorithm is then used to determine a better set of signal timings. The procedure is repeated until certain convergence criteria are satisfied. A numerical example is employed to demonstrate the benefits obtained from this iterative scheme. Encouraging results are obtained.     

Traffic performance of shared lanes at signalized intersections based on cellular automata modeling

Shared lanes at signalized intersections are designed for use by vehicles of different movement directions. Shared lane usage increases the flexibility of assigning lane grouping to accommodate variable traffic volume by direction. However, a shared lane is not always beneficial as it can at time result in blockage that leads to both capacity and safety constraints. This paper establishes a cellular automata model to simulate traffic movements at signalized intersections with shared lanes. Several simulation experiments are carried out both for a single shared lane and for an approach with a shared lane. Simulation of a single shared lane used by straight‐through and right‐turn (as similar to left‐turn in the USA) vehicles suggests that the largest travel delay occurs when traffic volumes (vehicles/lane) of the two movement streams along the shared lane are at about the same level. For a trial lane‐group with a shared lane, when traffic volumes of the two movement streams are quite different, the shared lane usage is not efficient in terms of reduction in traffic delay. The simulation results are able to produce the threshold traffic volume to arrange a shared lane along an approach. Copyright © 2013 John Wiley & Sons, Ltd.