装载机与运输车辆的最佳匹配（1）

运用排队论及优化方法，建立装载机一汽车相互配合系统的优化数学模型，并以此模型对该系统进行优化计算，确定出最佳的汽车与装载机斗容量之比、最合理的车辆数及组织形式，同时分析了斗容比和车辆数对系统经济性的影响，总结出与各种装载机相配合的汽车载重量和车辆数。     

Walking-distance introduced queueing model for pedestrian queueing system: Theoretical analysis and experimental verification

We have introduced the effect of delay in walking from the head of a queue to the service windows in the queueing model and obtain a suitable type of queueing system under various conditions by both computational simulation and theoretical analysis. When there are multiple service windows, the queueing theory indicates that mean waiting time in a fork-type queueing system (Fork), which collects pedestrians into a single queue, is smaller than that in a parallel-type queueing system (Parallel), i.e., queues for each service window. However, in our walking-distance introduced queueing model, we have examined that mean waiting time in Parallel becomes smaller when both the arrival probability of pedestrians and the effect of walking distance are large. Moreover, enhanced Forks, which shorten waiting time by reducing the effect of walking distance, are considered, and parts of our results are also verified by real queueing experiments.     

Performance analysis of the phase swap sorting strategy for an isolated intersection

A separate left-turn phase wastes the capacity of intersection, because all the lanes on the approach are not fully utilized during either the left-turn or through green phase. Under the phase swap sorting strategy (Xuan, 2011), different types of movements can be reorganized by a pre-signal so that all the lanes in the sorting area can be used to discharge vehicles during their green phases. Thus the capacity is improved significantly. In fact, when a pre-signal is installed upstream of the intersection signal (also named main signal), the two signals will have a great impact on not only the capacity, but other traffic performances, such as delays, queue formations, maximum queue length, residual queue, and spillback, etc., which are very important performance factors for the design and application of the phase swap sorting strategy. In order to more fully quantify and characterize the performance of the phase swap sorting strategy, a three-dimensional Markov queueing model is presented. Two levels of performance evaluation indices are formulated using the matrix analytic techniques. All these indices can be used to establish a more comprehensive analytical framework to evaluate the use of the phase swap sorting strategy. Model validation shows that the proposed model can provide a reliable performance analysis for the phase swap sorting strategy under various different conditions. In addition, in order to intuitively illustrate the effects of various factors on the performance of the phase swap sorting strategy, a series of numerical experiments is conducted.     

Dynamic network loading: A stochastic differentiable model that derives link state distributions

We present a dynamic network loading model that yields queue length distributions, accounts for spillbacks, and maintains a differentiable mapping from the dynamic demand on the dynamic queue lengths. The model also captures the spatial correlation of all queues adjacent to a node, and derives their joint distribution. The approach builds upon an existing stationary queueing network model that is based on finite capacity queueing theory. The original model is specified in terms of a set of differentiable equations, which in the new model are carried over to a set of equally smooth difference equations. The physical correctness of the new model is experimentally confirmed in several congestion regimes. A comparison with results predicted by the kinematic wave model (KWM) shows that the new model correctly represents the dynamic build-up, spillback and dissipation of queues. It goes beyond the KWM in that it captures queue lengths and spillbacks probabilistically, which allows for a richer analysis than the deterministic predictions of the KWM. The new model also generates a plausible fundamental diagram, which demonstrates that it captures well the stationary flow/density relationships in both congested and uncongested conditions.     

A data-driven approach to manpower planning at U.S.–Canada border crossings

We investigate the staffing problem at Peace Arch, one of the major U.S.–Canada border crossings, with the goal of reducing time delay without compromising the effectiveness of security screening. Our data analytics show how the arrival rates of vehicles vary by time of day and day of week, and that the service rate per booth varies considerably by the time of day and the number of active booths. We propose a time-varying queueing model to capture these dynamics and use empirical data to estimate the model parameters using a multiple linear regression. We then formulate the staffing task as an integer programming problem and derive a near-optimal workforce schedule. Simulations reveal that our proposed workforce policy improves on the existing schedule by about 18% in terms of average delay without increasing the total work hours of the border staff.     

Vehicle sorting for platoon formation: Impacts on highway entry and throughput

Automated highway systems (AHS) are intended to increase the throughput and safety of roadways through computer control, communication and sensing. In the “platoon” concept for AHS, vehicles travel on highways in closely spaced groups. To maximize benefits, it is desirable to form platoons that are reasonably large (five or more vehicles), and it is also desirable to ensure that platoons remain intact for considerable distances. This paper develops and evaluates strategies for organizing vehicles into platoons at highway entrances, with the objective of maximizing the distance that platoons stay intact, so that they do not need to be regrouped into new platoons on the highway itself. Fundamentally, this entails grouping vehicles according to their destination. We evaluate various strategies in which vehicles are sorted on entrance ramps, with respect to platoon sizes, throughput and platoon formation time.