Research on Optimization of Intelligent Traffic Dispatching Algorithms Based on Big Data in Chinese Urban Internet of Things Platform

The economic development in China has brought about the urban traffic problems such as traffic congestion, long traffic waiting time, and inappropriate vehicle transfer. Therefore, under the technical background of China’s Internet of Things platform, the fusion technology based on big data is studied and an algorithm for Chinese urban intelligent traffic safety scheduling is designed. In this paper, first of all, the urban traffic safety big data is clustered. Secondly, the gray distribution model of the big data is established by extracting the association rule features. Thirdly, the elements in Chinese urban traffic safety big data are fused, including the text, location, picture, audio, and video. On the condition of meeting highly time-sensitive needs of urban traffic intelligence, the video information after data fusion is applied to detect traffic flow parameters, so that an evaluation strategy for urban traffic safety state under the urban traffic speed dispersion is established. According to the fuzzy value of urban traffic drivers’ satisfaction with the waiting time, the effect of traffic dispatching is measured, the convergence formula of urban traffic in the morning and evening peaks is constructed, and the optimal solution of the objective function of dispatching strategy is calculated by the particle swarm optimization algorithm. In this way, more efficient urban traffic safety scheduling in China is realized. As can be learned from the experimental results, the proposed algorithm can reasonably judge the urban traffic safety situation and reduce the time of waiting for urban vehicles with reasonable data fusion results, so it is proved to improve the urban traffic safety.


Introduction
e rapid economic and social progress has not only promoted the tra c demand but also made the tra c problem into a hot focus of all walks of life [1]. Due to the severe road congestion problem under this circumstance, urban intelligent transportation has developed into a sign for the future development trend of global road transportation as well as the progress of modern cities. Faced with the pressure of numerous transportation resources, intelligent transportation can further transform road tra c, improve the application e ciency of urban transportation network [2,3], and thereby alleviate urban tra c problems and reduce the economic loss caused accordingly through communication technology and Internet of ings platform. is is also the core of intelligent tra c. e urban tra c safety scheduling algorithm is the key technology to urban intelligent transportation, so designing the urban intelligent transportation algorithm for di erent urban areas according to the current situation and development trend of urban transportation is worth detailed study.
Lu [4] and others proposed a exible coordinated scheduling algorithm for urban multiline tra c during opeak hours. e algorithm explores the scheduling problem during o -peak hours. e algorithm takes the reduced walking time of passengers, the increased travel time of passengers, operating cost, and other factors as indicators, establishes a two-tier planning model of urban tra c coordination and scheduling, and uses the genetic algorithm to encode the number of passengers on-board when the vehicle responds to the reservation station and then completes the model solution. However, the computational cost of this algorithm is too large, and the real-time performance of the scheduling result is not high. Kong et al. [5] designed an urban traffic dispatching algorithm based on intelligent vision. e basic architecture of the algorithm is composed of ZigBee coordinator module, intelligent vision module, traffic control base station, and so on. e ZigBee coordinator module is used to process vehicle information, which collects road congestion information through the on-board sensor node module in the intelligent vision module and controls the volume of on-board sensor nodes, system energy, and capital consumption. e real-time feedback of traffic image information of congested vehicles is completed by using the road image information acquisition and processing module, and the scheduling algorithm under the hybrid fish school algorithm is used to solve the problem of vehicle congestion. However, the anti-jamming performance of this algorithm in data acquisition needs to be improved.
In view of the above problems, the author of this study designed an urban intelligent traffic safety dispatching algorithm based on big data fusion under the platform of the Internet of ings. e algorithm uses big data fusion to complete the integration of traffic safety information and the evaluation of traffic implementation and then uses the particle swarm optimization algorithm to achieve the goal of efficient traffic safety dispatch and improve urban traffic safety.

Information Processing and Evaluation of Urban Intelligent Traffic Safety Based on Big Data Fusion
Under the platform of the Internet of ings, in order to complete the goal of traffic safety big data fusion, the first step is to build a distributed structure model of traffic big data. To this end, this research uses G to define a fuzzy distributed storage center for traffic safety big data. If the phase space embedding dimension of the traffic safety big data interaction is represented, several nonlinear joint statistical i methods can be used to realize the reconstruction of the big data high-dimensional feature space [6], and the fusion fuzzy clustering algorithm is used to complete the extraction of big data fusion features. e global architecture model of big data fusion is shown in Figure 1.
Big data fusion will be affected by multiple factors such as traffic information, and the interference intensity of data fusion is too high, with variability and randomness. A knowledge base, model library, and algorithm are built to complete big data fusion, and a complete and effective knowledge base is created to represent the information flow of traffic safety big data, which is denoted as follows: In the formula, h(·) represents the distributed time series of traffic safety big data, which is also a function with a multidimensional data architecture model, and ω n represents the characteristic quantity of big data association rules. e analytic expression of the distribution function of the big data distribution architecture model is written as follows: In the formula, p represents the order of the distributed big data storage structure and α represents the time window width of statistical data sampling.
On this basis, a differential equation describing the information flow model of big data is constructed. In the state space, the evolution from X n to X n + 1 (x n ⟶ x n+1 ) presents an information fusion change model of unknown traffic safety big data time series [7,8]. e evolution process plays a key role in subsequent traffic safety dispatch. Regarding the big data time series of the previous statistical measurement, the phase space reconstruction trajectory is recorded as follows: S � s 1 , s 2 , . . . , s K n � x n , x n− τ , . . . , x n− (m− 1)τ , In the formula, K represents the orthogonal feature vector of the big data time series and T represents the delay of the big data sampling time. e Fourier transformation is then performed on the big data information flow, to obtain the frequency domain feature components of big data fusion under the gray model training: In the formula, a represents the variance index between big data domains and B H represents the correlation function of big data fusion.
Association rule feature extraction methods are used to ensure the reliability of big data fusion. Autocorrelation feature matching is used to obtain big data feature mapping Φ: M ⟶ R 2 d+1 . e use of vectors for big data sequences in the form of phase space constitutes a new array manifold vector as follows: e big data information flow model and phase space reconstruction are used to obtain the mapping relationship between the big data information flow model and nonlinear feature extraction. In order to eliminate the initial data dimension, the analytical formula of the big data gray distribution model is obtained by using the association rule feature matching: According to the gray model difference formula, it can be seen that when the phase space reconstruction is performed on the big data sequence, if the embedding dimension is 3 times higher than the attractor dimension, that is, m ≥ 3 d + 1, the extraction of the feature amount of big data can accurately show the feature information of the d-dimensional manifold vector of the time series. If the historical data are x i N i�1 and they are in the m-dimensional space, the big data is adaptively fused to obtain the output traffic safety big data feature sequence analytical formula. e association rule function of big data fusion is described as follows: In the formula, T ′ represents the time delay when the big data is in the reconstruction space, and represents the degree of correlation between the changes in traffic safety big data during t and t + T. Integrate the concept of information fusion, implement information fusion for text information, location information, pictures, audio, video, and other data in big data, and improve the independent dispatching ability of big data.
After the big data fusion is completed, the video big data information is used to accurately assess the traffic safety situation in order to adopt a reasonable vehicle scheduling strategy. Set a rectangular detection area to ensure that the two parallel detection lines in the set video image detection area are in a vertical relationship with the road. Treat the vehicle as a moving target for clumping.
Discrete speed of the road segment can show the overall smooth running of the road [9]. Taking a single vehicle as an example, the speed fluctuations of the single vehicle are used to show the driving stability of the single vehicle to evaluate the global stability of the road segment. Vehicle speed and speed change rate are key elements that directly affect vehicle safety. Assuming that the vehicle speed dispersion based on the road segment is φ L , the following mathematical expressions can be obtained: In the formula, V 80,i represents that 80% of all vehicles traveling on this road segment have the same speed, and only 20% of the vehicle speeds are not lower than the cumulative frequency curve of vehicle speed, and the curve value represents the speed of this road segment; SL represents the standard deviation of 80 vehicle speeds on the highway section, and V is the average speed of vehicles passing through the entire road. In formulae (9) and (10), the total number of sections is the exact value that needs to be calculated, and the more the sections are divided, the more accurate the calculation results will be. However, too close cross-sections bring great difficulty to the evaluation [10]. On the basis of facilitating observation and calculation, the number of cross-sections should be increased to the greatest extent, and the distance between the cross-sections should be maintained at about 60 m. is not only facilitates the detection but also ensures the reasonableness of the calculation results.
According to the speed dispersion, the road section is divided into four grades. After carrying out statistical analysis on the historical big data fusion information of multiple sections and the severity level of accidents, the traffic safety assessment criteria as shown in Table 1 are obtained. In Table 1, φ L represents the average value of vehicle speed dispersion under safe highway driving. e detailed process of traffic safety assessment is shown in Figure 2. rough the calculation process in Figure 2, the accurate overall situation of traffic vehicles can be obtained, and we can know whether there are hidden safety hazards on the road. If there are emergencies such as congestion or traffic accidents, the urban intelligent traffic safety scheduling algorithm based on particle swarm optimization can be used to properly handle traffic safety issues.

Urban Intelligent Traffic Safety Scheduling
Algorithm Based on Particle Swarm Optimization ere are many sudden factors in the driving of modern traffic vehicles, and the accumulation of time with congestion makes it difficult to effectively implement the traffic dispatching plan. If in the vehicle scheduling the delay parameter of arrival at the destination follows any parameter variable of the normal distribution, the general derivation model cannot directly calculate the uncertain value. Under the platform of the Internet of ings, the particle swarm optimization algorithm is used to find the optimal solution for the traffic safety scheduling strategy. e particle swarm optimization algorithm is a swarm intelligence algorithm created on the basis of exploring the behavior of fish and bird groups. e central idea comes from the theory of artificial life and evolutionary computing. It simulates the flight and foraging behavior of birds and uses the collective cooperation of birds to optimize the group [11]. Figure 3 shows the calculation process of the particle swarm optimization algorithm.
In this study, it is assumed that the vehicles start to travel from the corresponding place on time, and there is no detention phenomenon when the vehicles are driving. e satisfaction fuzzy value of the waiting time of the driver is used to weigh the effectiveness of the traffic safety dispatching when the vehicle is driving.
Set e, z T , and z t in turn as driver satisfaction, traffic jam time, and departure time. If z t 0 is the time of the first departure of a certain vehicle, the following formula can be obtained through big data fusion: Formulae (11) to (13) represent the morning and evening peak convergence formulae. When it is not during the driving peak period, the convergence conditions of the driver satisfaction evaluation function are as follows: If R(z t , j, z T ) represents the satisfactory consumption of waiting in the j area during the z t period, the following formula can be obtained: Formula (15) represents the satisfaction loss value after a certain vehicle arrives at the predetermined location from the initial location, and this value is the objective function of the particle swarm optimization algorithm when calculated. e particle updates its own position and speed according to the actual situation, and then the position of the i-th particle is as follows: e flight speed of the particle's space optimization is as follows: e optimal position of the particle swarm in space optimization and the optimal position of the entire particle swarm space group are as follows: e group will implement all-round updates according to the following formula: Formula (19) expresses the update process of the particle itself, and formula (20) expresses the coordination ability of the particle in the scheduling algorithm, which is also the highlight of the particle's sociality. e solution space of the particles is the traffic safety dispatching criterion within a certain range, which can be specifically expanded to the number of driving times and the length of travel time of each vehicle. Traffic vehicles have high nonlinear characteristics. e algorithm does not need to implement too many parameter adjustments to complete multiple operations. e continuous update of a certain particle in the optimization iteration will form an operator that maintains a better position. e auxiliary performance of the operator can be used to improve the accuracy and rate of individual constraints. e particle distribution calculation is to put the unequal traffic safety scheduling strategy particles into different containers in turn and use the equal division [12] method to divide a particle group into multiple subgroups. e individual optimal particle gbest exchanges synchronization information with the individual optimal particle ppes in a fixed period. In the subgroup, the individual optimal particle ppes can all be received by the global optimal particle g best. e subgroup selects a g best from the best position in the adjacent container to replace its own g best. e replaced cycle time decreases layer by layer according to the exponential decreasing sequence. During the search period, the diversity of the group is very high, and the local search ability of this period is more critical than the whole search ability, and ppes will produce g best values of different processors after a long independent working time, which is a critical period for turning into a global constraint. e particles in multiple containers are updated cooperatively with each other to ensure that the obtained scheduling plan is the optimal solution, thereby achieving accurate and efficient vehicle safety scheduling.

Simulation Experiment and Result Analysis
In order to evaluate the performance of the urban intelligent traffic safety dispatching algorithm based on big data fusion under the Internet of ings platform, this algorithm is Mathematical Problems in Engineering compared and analyzed with the two algorithms in literatures [4,5] for traffic safety dispatching simulation. e simulation parameters are shown in Table 2. Figure 4 shows the simulation results of the packet loss rate of the vehicle traffic safety video information data fusion under the three algorithms. It can be seen from Figure 4 that with the continuous increase in the number of vehicles in the video, the load of the big data information flow is getting heavier and the packet loss rate is also increasing. However, under the algorithm of this paper, the rising trend of packet loss rate is relatively flat, and the packet loss rate is also lower than the algorithms in literatures [4,5]. e reason is that the algorithm in this paper can integrate text information, location information, video, and other data in urban intelligent transportation, which greatly enhances the transmission performance of big data information flow, and convey effective traffic safety dispatch information to deal with safety accidents caused by congestion and other phenomena.
It is assumed that each road segment in the simulated road network has 1 left-turning lane, 3 through-going lanes, and 1 right-turning lane in turn. en, test the variation of vehicle waiting time under different algorithms. Each simulation time is 30 minutes, and the simulation result is the average value of 50 simulations. e result is shown in Figure 5. In Figure 5, the ordinate represents the waiting time of all vehicles, and its unit is second (s). e abscissa is the traffic flow, which represents the number of vehicles arriving in each lane in a minute.
It can be seen from Figure 5 that when the traffic volume is relatively small, the performance difference of the three algorithms is also small. However, as traffic flow increases gradually, the performance of each algorithm changes significantly. From a global perspective, the performance of the algorithm in this paper is much better than that in the above two literatures. is is because the algorithm in this paper uses the particle swarm optimization algorithm to deduce the time for vehicles to pass through the intersection to complete the green light time setting and complete the optimal traffic safety scheduling; that is to say, the time of each dispatch is to make the waiting time of the vehicle as short as possible.   Figure 3: Schematic diagram of the calculation process of the particle swarm optimization algorithm.

Conclusion
With the development of China's economy and urban road construction, the urban intelligent traffic safety system plays important role in both urban traffic scheduling and traffic safety. In consideration of the increasingly severe traffic safety situation, an urban intelligent traffic safety dispatching algorithm based on big data fusion is proposed in this research by making the most of the Internet of ings platform. With strong adaptive ability and simple calculation process, the proposed algorithm can not only effectively integrate various types of traffic safety big data and improve the utilization of traffic big data resources but also obtain high-precision traffic safety scheduling strategy via the particle swarm optimization algorithm, thus playing decisive role during the fast and safe driving of vehicles.

Data Availability
e data used to support the findings of this study are available from the corresponding author upon request.