Critical gap is the threshold by which drivers in the minor stream judge whether to accept a gap. If the gap is larger than critical gap, drivers accept it and enter the intersection; otherwise, drivers reject the gap and wait for the next gap. At a priority-controlled intersection, critical gap is usually considered as a fixed value or to follow a certain distribution. The major stream and minor stream are both one-way traffic flows at the priority-controlled intersection. Vehicles in the major stream have priority to run into conflict sections, and vehicles in the minor stream can enter conflict sections during the larger gap of two successive vehicles in the major stream. The capacity of minor roads is the maximum number of vehicles that can pass the intersection during a special period under prevailing roadway, traffic, and control conditions. Under a few assumptions, the survey method of rejected gaps and accepted gaps was designed. Four new calculation models of the critical gap are proposed. The pr...
Network reliability reflects a system’s ability to perform specified functions under specified topological and traffic conditions. Network reliability is the weighted sum of connection reliability and travel time reliability. Based on complex network theory, a new method was proposed to calculate the travel time reliability of road networks. The topology model of a regional highway network in China was built using the dual method. After a random attack or deliberate attack, node sizes in the sub-network can be used to reflect the node importance for network connection reliability. Some conclusions were drawn after the change in travel time coefficient and delay coefficient. The increases in the two coefficients will accelerate the decrease of travel time reliability of the highway network. After a comparison among three methods of travel time reliability, including variation coefficient, the misery indexes, and the new equation, the new method was further verified. The influence factors of highway network reliability were analyzed under the condition of different highway blockage and congestion.
1 December 2024 in Journal of Highway and Transportation Research and Development (English Edition)
In addressing the challenge of spatio-temporal correlation in traffic flow at signalized intersections, this study introduces an innovative methodology that integrates a SG-LSTM neural network with a particle swarm optimization algorithm. The proposed methodology involves the pre-processing of original traffic data to enhance its predictability, followed by the development of a short-term traffic flow prediction model utilizing the LSTM neural network. Utilizing the outcomes of the traffic flow predictions, a dynamic timing model for signalized intersections is formulated through the application of the particle swarm optimization algorithm. Furthermore, a multi-objective optimization model is established to refine the timing scheme of the signalized intersections, incorporating constraints that consider the maximization of overall intersection capacity, minimization of average delay, and reduction of average queuing times. The Pareto compromise programming method is employed to perform dimensionless processing of the three performance indicators, while the fuzzy preference method is utilized to ascertain the weight relationships among the objective functions. The optimized signal timing scheme is derived through the implementation of the particle swarm optimization algorithm in Matlab. Experimental results indicate that the proposed methodology surpasses the traditional Webster model in terms of performance indicators, thereby affirming the effectiveness and reliability of the approach.
1 June 2025 in Journal of Highway and Transportation Research and Development (English Edition)
To address the issue of inefficient parking space utilization resulting from temporal and spatial disparities in parking demand, shared parking emerges as an innovative traffic management paradigm. The core concept of shared parking lies in the strategic allocation of parking spaces. By analyzing the usage patterns of parking areas, the relationship between supply and demand over time can be represented in a binomial form. An integer programming model for parking allocation is formulated, where the objective at each allocation stage is to minimize walking distance and parking costs while maximizing the degree of temporal alignment with overall parking demand in the region. The weights of these three indices are calculated using the entropy weight method, and subsequently, the parking cost matrix is derived through linear weighting. It is proposed to utilize the Hungarian Algorithm as a method for solving the assignment problem to obtain the allocation scheme that minimizes total parking costs. A Python program is developed to execute the phased optimal allocation of parking spaces. At the conclusion of the operation, the results for overall parking demand satisfaction, parking space utilization, and parking costs are generated. The model is applied to parking space management in both real-world instances and simulation experiments. The results demonstrate that the model not only ensures a higher utilization rate of parking spaces but also effectively reduces overall parking costs and the idle rate of parking time compared to the current parking methods. This model is well-suited for the parking allocation processes of smart parking platforms.