Implementation and application of a stochastic aircraft boarding model

The aircraft turnaround processes is mainly controlled by the ground handling, airport or airline staff, except the aircraft boarding, which is driven by the passengers’ experience and willingness or ability to follow the proposed boarding procedures. The paper uses a prior developed, calibrated, stochastic aircraft boarding model, which is applied to different boarding strategies (chronological order of passenger arrival, hand luggage handling), group constellations and innovative infrastructural changes (Flying Carpet, Side-Slip Seat, Foldable Passenger Seat). In this context, passenger boarding is assumed to be a stochastic, agent-based, forward-directed, one-dimensional and discrete process. The stochastic model covers individual passenger behavior as well as operational constraints and deviations. A comprehensive assessment using one model allows for efficient comparison of current research approaches and innovative operational solutions for efficient passenger boarding.     

Predicting the adoption of connected autonomous vehicles: A new approach based on the theory of diffusion of innovations

On the grounds that individuals heavily rely on the information that they receive from their peers when evaluating adoption of a radical innovation, this paper proposes a new approach to forecast long-term adoption of connected autonomous vehicles (CAVs). The concept of resistance is employed to explain why individuals typically tend to defer the adoption of an innovation. We assume that there exists a social network among individuals through which they communicate based on certain frequencies. In addition, individuals can be subject to media advertisement based on certain frequencies. An individual’s perceptions are dynamic and change over time as the individual is exposed to advertisement and communicates with satisfied and dissatisfied adopters. We also explicitly allow willingness-to-pay (WTP) to change as a result of peer-to-peer communication. An individual decides to adopt when (i) there is a need for a new vehicles; (ii) his/her WTP is greater than CAV price; and (iii) his/her overall impression about CAVs reaches a cutoff value. Applicability of the proposed approach is shown using a survey of employees of the University of Memphis. Our results show that the automobile fleet will be near homogenous in about 2050 only if CAV prices decrease at an annual rate of 15% or 20%. We find that a 6-month pre-introduction marketing campaign may have no significant impact on adoption trend. Marketing is shown to ignite CAV diffusion but its effect is capped. CAV market share will be close to 100% only if all adopters are satisfied with their purchases; therefore, the probability that an individual becomes a satisfied adopter plays an important role in the trend of adoption. The effect of the latter probability is more pronounced as time goes by and is also more prominent when CAV price reduces at greater rates. Some caveats may be inserted when considering the study results as the findings are subject to sample bias and data limitations.     

A two-dimensional simulation model for modelling turning vehicles at mixed-flow intersections

The turning behavior is one of the most challenging driving maneuvers under non-protected phase at mixed-flow intersections. Currently, one-dimensional simulation models focus on car-following and gap-acceptance behaviors in pre-defined lanes with few lane-changing behaviors, and they cannot model the lateral and longitudinal behaviors simultaneously, which has limitation in representing the realistic turning behavior. This paper proposes a three-layered “plan-decision-action” (PDA) framework to obtain acceleration and angular velocity in the turning process. The plan layer firstly calculates the two-dimensional optimal path and dynamically adjusts the trajectories according to interacting objects. The decision layer then uses the decision tree method to select a suitable behavior in three alternatives: car-following, turning and yielding. Finally, in the action layer, a set of corresponding operational models specify the decided behavior into control parameters. The proposed model is tested by reproducing 210 trajectories of left-turn vehicles at a two-phase mixed-flow intersection in Shanghai. As a result, the simulation reproduces the variation of trajectories, while the coverage rate of the trajectories is 88.8%. Meanwhile, both the travel time and post-encroachment time of simulation and empirical turning vehicles are similar and do not show statistically significant difference.     

Conflict-free arrival and departure trajectory planning for parallel runway with advanced point-merge system

In this paper, an efficient trajectory planning system is proposed to solve the integration of arrivals and departures on parallel runways with a novel route network system. Our first effort is made in designing an advanced Point Merge (PM) route network named Multi-Level Point Merge (ML-PM) to meet the requirements of parallel runway operations. Then, more efforts are paid on finding a complete and efficient framework capable of dynamically modelling the integration of arrival and departure trajectories on parallel runways, modelling the conflict detection and resolution in presence of curved trajectory and radius-to-fix merging process. After that, a suitable mathematical optimization formulation is built up. Receding Horizon Control (RHC) and Simulated Annealing (SA) algorithms are proposed to search the near-optimal solution for the large scale trajectories in routine dense operations. Taking Beijing Capital International Airport (BCIA) as a study case, the experimental results show that our system shows good performances on the management of arrivals and departures. It can automatically solve all the potential conflicts in presence of dense traffic flows. With its unique ML-PM route network, it can realize a shorter flying time and a near-Continuous Descent Approach (CDA) descent for arrival aircraft, an economical climbing for departure aircraft, an easier runway allocation together with trajectory control solutions. It shows a good and dynamic sequencing efficiency in Terminal Manoeuvring Area (TMA). In mixed ML-PM mode, under tested conditions, our proposed system can increase throughput at BCIA around 26%, compared with baseline. The methodology defined here could be easily applied to airports worldwide.     

Multi-criteria optimization of traffic signals: Mobility,safety, and environment

Two-dimensional multi-objective optimizations have been used for decades for the problems in traffic engineering although only few times so far in the optimization of signal timings. While the other engineering and science disciplines have utilized visualization of 3-dimensional Pareto fronts in the optimization studies, we have not seen many of those concepts applied to traffic signal optimization problems. To bridge the gap in the existing knowledge this study presents a methodology where 3-dimensional Pareto Fronts of signal timings, which are expressed through mobility, (surrogate) safety, and environmental factors, are optimized by use of an evolutionary algorithm. The study uses a segment of 5 signalized intersections in West Valley City, Utah, to test signal timings which provide a balance between mobility, safety and environment. In addition, a set of previous developed signal timing scenarios, including some of the Connected Vehicle technologies such as GLOSA, were conducted to evaluate the quality of the 3-dimensional Pareto front solutions. The results show success of 3-dimensinal Pareto fronts moving towards optimality. The resulting signal timing plans do not show large differences between themselves but all improve on the signal timings from the field, significantly. The commonly used optimization of standard single-objective functions shows robust solutions. The new set of Connected Vehicle technologies also shows promising benefits, especially in the area of reducing inter-vehicular friction. The resulting timing plans from two optimization sets (constrained and unconstrained) show that environmental and safe signal timings coincide but somewhat contradict mobility. Further research is needed to apply similar concepts on a variety of networks and traffic conditions before generalizing findings.     

联锁设备双系通信中断故障解决方案

针对联锁设备运用过程中出现的双系通信中断问题,分析故障原因,提出预防维修方案.减少故障延时和运行维护成本,降低安全风险。     

Balancing energy consumption and risk of delay in high speed trains: A three-objective real-time eco-driving algorithm with fuzzy parameters

Eco-driving is an energy efficient traffic operation measure that may lead to important energy savings in high speed railway lines. When a delay arises in real time, it is necessary to recalculate an optimal driving that must be energy efficient and computationally efficient.In addition, it is important that the algorithm includes the existing uncertainty associated with the manual execution of the driving parameters and with the possible future traffic disturbances that could lead to new delays.This paper proposes a new algorithm to be executed in real time, which models the uncertainty in manual driving by means of fuzzy numbers. It is a multi-objective optimization algorithm that includes the classical objectives in literature, running time and energy consumption, and as well a newly defined objective, the risk of delay in arrival. The risk of delay in arrival measure is based on the evolution of the time margin of the train up to destination.The proposed approach is a dynamic algorithm designed to improve the computational time. The optimal Pareto front is continuously tracked during the train travel, and a new set of driving commands is selected and presented to the driver when a delay is detected.The algorithm evaluates the 3 objectives of each solution using a detailed simulator of high speed trains to ensure that solutions are realistic, accurate and applicable by the driver. The use of this algorithm provides energy savings and, in addition, it permits railway operators to balance energy consumption and risk of delays in arrival. This way, the energy performance of the system is improved without degrading the quality of the service.     

Studying the benefits of carpooling in an urban area using automatic vehicle identification data

Carpooling has been considered a solution for alleviating traffic congestion and reducing air pollution in cities. However, the quantification of the benefits of large-scale carpooling in urban areas remains a challenge due to insufficient travel trajectory data. In this study, a trajectory reconstruction method is proposed to capture vehicle trajectories based on citywide license plate recognition (LPR) data. Then, the prospects of large-scale carpooling in an urban area under two scenarios, namely, all vehicle travel demands under real-time carpooling condition and commuter vehicle travel demands under long-term carpooling condition, are evaluated by solving an integer programming model based on an updated longest common subsequence (LCS) algorithm. A maximum weight non-bipartite matching algorithm is introduced to find the optimal solution for the proposed model. Finally, road network trip volume reduction and travel speed improvement are estimated to measure the traffic benefits attributed to carpooling. This study is applied to a dataset that contains millions of LPR data recorded in Langfang, China for 1 week. Results demonstrate that under the real-time carpooling condition, the total trip volumes for different carpooling comfort levels decrease by 32–49%, and the peak-hour travel speeds on most road segments increase by 5–40%. The long-term carpooling relationship among commuter vehicles can reduce commuter trips by an average of 30% and 24% in the morning and evening peak hours, respectively, during workdays. This study shows the application potential and promotes the development of this vehicle travel mode.     

Commuter ride-sharing using topology-based vehicle trajectory clustering: Methodology,application and impact evaluation

This paper illustrates a ride matching method for commuting trips based on clustering trajectories, and a modeling and simulation framework with ride-sharing behaviors to illustrate its potential impact. It proposes data mining solutions to reduce traffic demand and encourage more environment-friendly behaviors. The main contribution is a new data-driven ride-matching method, which tracks personal preferences of road choices and travel patterns to identify potential ride-sharing routes for carpool commuters. Compared with prevalent carpooling algorithms, which allow users to enter departure and destination information for on-demand trips, the proposed method focuses more on regular commuting trips. The potential effectiveness of the approach is evaluated using a traffic simulation-assignment framework with ride-sharing participation using the routes suggested by our algorithm. Two types of ride-sharing participation scenarios, with and without carpooling information, are considered. A case study with the Chicago tested is conducted to demonstrate the proposed framework’s ability to support better decision-making for carpool commuters. The results indicate that with ride-matching recommendations using shared vehicle trajectory data, carpool programs for commuters contribute to a less congested traffic state and environment-friendly travel patterns.