# Research on Optimization Model of Multisource Traffic Information Collection Combination Based on Genetic Algorithm

Authors: Jianwei Guo; Yongbo Lv
Journal: Computational Intelligence and Neuroscience
 (2022)

---

## Abstract

In order to reduce the excessive use of multisource traffic information collection system, a multisource traffic information collection combination optimization mode is proposed based on genetic algorithm in this paper. This model is mainly used to analyze the traffic management data in the city. According to the collected data information, the characteristics of the traffic equipment can be effectively analyzed. Basing on the market demand and supply relationship, the multisource traffic information collection combination optimization model is used to complete the reorganization and optimization of the traffic information in this paper, to acquire the main convolution feature variables of the model. The data information combination processing is performed according to the acquired feature variables, and the genetic algorithm is used to adjust the multisource traffic information. During the process of information fusion data analysis, the multisource traffic information clustering and fuzzy constraint control can be performed effectively to realize the optimization of the team’s traffic information collection combination. Finally, the simulation results show that the method proposed in this paper is more accurate in realizing the optimization process of multisource traffic information collection and combination and has a better degree of information fusion.


---

## Body

## 1. Introduction

At present, many large-scale cities in China have gradually increased their investment in urban transportation systems, especially in the collection of multisource traffic information [1, 2], wasting a lot of manpower and financial resources. as the foundation of urban traffic infrastructure, multisource traffic information can be used to effectively improve the During accuracy and efficiency of traffic information collection, laying the foundation for improving the urban intelligent traffic system [3, 4]. However, currently, due to the single structure of the existing acquisition system hardware in the use process, the collected data information is inaccurate, and the cost of investment is huge. The limitation of the single-structured traffic data acquisition equipment lies in the small acquisition range. Fixed information collection period and fixed types of acquired data information, resulting in large-scale investment and serious waste of resources. Meanwhile, all kinds of information collection equipment are damaged seriously leading to huge maintenance costs. The use of different types of information collection equipment will cause repeated collection of traffic information and increase the workload.Based on genetic algorithm, a combined model of multisource traffic information collection is proposed in this paper. The model can be used to effectively analyze the results of the obtained multisource traffic information, genetic algorithms are combined to collect and combine the initial traffic information, complete the reconstruction of the multisource traffic information spatial structure, and obtain the convolutional characteristics of the traffic information. According to the characteristic variables, the fusion processing and combination of data information can be carried out. Complete distributed clustering of multisource information in the fusion space. Finally, the analysis of experimental simulation results shows that the method in this paper has superior performance and information collection ability in the process of extracting multisource traffic information collection combination.


## 2. Information Collection and Feature Preprocessing

### 2.1. Collection Combination Optimization System

The flow of mobile positioning and real-time monitoring system of road vehicle is shown in Figure1, which mainly includes three parts: extraction and tracking of vehicle targets, road condition detection and real-time monitoring of traffic flow [5, 6]. The extraction and location of vehicle targets are mainly realized by the construction of the detection background to extract the characteristics of the moving vehicle, while monitoring the vehicle parameters in the implementation. The road background is based on for modeling the road condition monitoring, and the road surface can be divided by the acquired data information, and the vehicle detection area is extracted to obtain the conversion between the road plane coordinates and the left side of the multimedia spectrum plane. The data of the road and traffic flow obtained in previous times is integrated by the road traffic to complete the data analysis and statistics of the traffic flow on different lanes [7–11]. This system uses the traffic flow pictures collected by the cameras placed on the platform.Figure 1
System flow chart.The main control software design is mainly composed of two main programs, which are the main control programs that can complete different business logics and the programs that can realize the user-side GUI process control. The main control program is mainly to receive external commands, and meanwhile send the obtained traffic flow information to the corresponding business module for processing, effectively realizing the business logic between systems.The main process uses a message transfer mode including a communication module, a message transfer module, and a business module. The communication module mainly establishes a network link [12–14], and sends the received data information from the control information obtained to an arbitration level information commands are sent to the control center through the service interface. The control command center module executes in accordance with the message queue mechanism acquired by the GUI process system and the method of sending and receiving information between the corresponding processes. When the service module mainly processes specific services and all service modules are initialized, the service function module sends the command information that needs to be processed to the message control module. At the same time, when data information is received, the data control center will send the command information to the business module for sorting. The GUI process is developed based on the embedded graphics library mimugui, which is mainly a graphical user interface that realizes the needs of business logic. The GUI process communicates with the main process in the same way as the message queue [15].The vehicle positioning detection module mainly communicates with the weight measurement platform and adopts the modbus protocol. This module is the master, and the vehicle volume measurement platform is mainly used as a slave device. The input of the vehicle positioning detection module is received using the RS485 interface, and the vehicle volume detection module is used to extract vehicle volume-related data information, and at the same time, it is sent to the message arbitration module to obtain the quantity statistics operation command from the outside. The output of the detection module includes the transmission of the detection result data to the center via the network. The results of the quantity statistics are stored in the database. The detection of instructions are sent to the detection platform through the RS485 interface. the RS485 interface and the quantity statistics platform are used for the processing of the quantity statistics module to construct information and data associations. Meanwhile, the automatic fixed time is set at the RS485 interface to automatically and regularly read the vehicle information from the quantity statistics platform, and the analysis results are sent to the module for processing through data analysis. The interface to network is used by vehicle positioning detection module to send statistical results to the control center and stores them in the database. The processing steps of the detection module are shown in Figure2.Figure 2
Block diagram of quantity statistics module.The GPS module is used to obtain the geographic information parameters of the vehicle in this paper. When the vehicle image is acquired, and it is used in the systeml, the processing of the above data can be displayed digitally, and the obtained results will be stored. The input GPS device of the GPS module is GPS information data sent via the network in this paper. The output of the GPS module’s data information is encrypted and protected in the network center, and then the message arbitration module is used to store the vehicle-related data information in the GUI module. The warning information about GPS is stored in the database, and the data sent is mainly the warning information of GPS. The paper. GPS module is usually processed with a dedicated network to obtain the GPS device data information and use the GPS data analysis function module to realize the transmission of relevant information data and relevant alarm information by the network center GPS. As shown in Figure 3.Figure 3
GPS module block diagram.The data transmission task mainly includes the vehicle-mounted terminal transmitting data to the monitoring platform. In addition to the real-time data of the vehicle, it also includes sending the identification information and data mentioned in the link management task to the mainly includes branch of monitoring platform as supplement. The vehicle-mounted terminal can transmit information to multiple monitoring centers, so multiple data transmission tasks coexist. The data management is performed for coordinating multiple data transmission tasks to prevent conflicts and resource competition.


### 2.2. Collection of Multisource Traffic Information

In order to realize the optimal collection and fusion dispatching of traffic in a complex traffic network environment, first the design of a distributed data structure of multisource and multisource traffic information shall be carried out in the complex traffic network environment, and a multisource traffic information database structure is built in a complex network environment,..0 + the fuzzy decentralized preservation center of multisource traffic information needs to be represented by 4 groups G. Supposei is the feature space of the interaction of multiple sources of traffic information in a complex traffic network environment. The multisource traffic information is reconstructed in a high-dimensional feature space in a complex traffic network environment using the coupled statistical method of multiple non-linear components, combined with pattern recognition and adaptive clustering methods, to carry out the information fusion and feature extraction of source traffic information in multiple traffic network environments. Based on the above analysis, Figure 4 shows the overall structure model of building a combination of multisource traffic information collection and fusion collection in a complex traffic network environment.Figure 4
The overall structure model combined by multisource traffic information collection and fusion collection.According to Figure4, the multisource traffic information collection process contains a large amount of interference information and road condition information. This multisource traffic information indicates the data by spectral characteristics. The multisource and multisource traffic information contains n variables. y1,y2,…,yn can be used to represent the variable threshold corresponding to aj. The simplified mathematical model of multisource traffic information can be explained by the following formula.(1)G1=b11a1+b12a2+,…,b1nanG2=b21a1+b22a2+,…,b2nan⋯Gn=bn1a1+bn2a2+,…,+bnnan.Among them,aj and Gk both have a strong correlation, which represents a distributed array of sensors that collect multisource traffic information in a complex traffic network environment, and use multisensor fusion recognition methods for effective information mining in multisource traffic in the Internet of Vehicles. The fuzzy adaptive clustering method is used to construct multisource in multi traffic information statistical feature quantity, combined with normalized feature extraction method, the multisource traffic information autoregressive analysis result is uxjξj, and the detection problem of multisource traffic information is transformed into a linear problem of measuring the dynamic distribution of multisources in a complex traffic network environment. According to the above design, the statistical result model of multisource traffic information is analyzed, and the statistical feature sampling method is used to carry out the acquisition of the information of the original multisource traffic [8].


### 2.3. Big Data Fusion of Traffic Information

Based on the time-frequency coupling distribution of the multisource traffic bit sequence, the genetic algorithm method is used to remove the interference component and the feature set of the multisource traffic information [9] and realize the fuzzy clustering processing of the multisource traffic information of the automobile network: kxi,xj(2)minw,b,ξ12w2+C∑j=1luxjξjs.t.yjw⋅xj+b+ξj≥1ξj≥0,j=1,2,…,l.Regarding the nonlinear collection and combination problem, based on the temporal variability and random change characteristics of traffic information, the fuzzy dynamic change kernel functionkxi,xj is introduced for dynamic feature separation. The following quadratic planning shows the information fusion of multisource and multisource traffic information problem.(3)minα12∑i=1l∑j=1lyiyjαiαjKxi,xj−∑j=1lαjs.t.∑j=1lyjαj=00≤αj≤uxjC,j=1,2,…,l.Based on the results of feature extraction, statistical regression analysis is used to analyze the nonlinear structure group of multisource traffic information in a complex traffic network environment [10], and a linear coupling model is derived:(4)xk=∑n=0N/2−12ancos2πknN−bnsin2πknN,k=0,1,…,N−1.Among them,an represents the feature distribution of multisource traffic information linear programming in a complex transportation network environment. There are m multisource traffic information nodes A1,A2,…,Am in a complex transportation network environment to construct multisource traffic information fusion scheduling in a complex transportation network environment. Its mathematical expression is as follows:(5)minf=∑i=1m∑j=1nCijXij,s.t.∑j=1mXij=ai,i=1,2,…,m∑i=1mXij=bi,j=1,2,…,nXij≥0,i=1,2,…,m;j=1,2,…,n.Assuming that the number of multisource and multisource traffic information distribution nodes in the current complex traffic network environment isn, N1,…,Nn the learning method of fuzzy convolutional neural network is adopted to realize the big data fusion of traffic information.


## 2.1. Collection Combination Optimization System

The flow of mobile positioning and real-time monitoring system of road vehicle is shown in Figure1, which mainly includes three parts: extraction and tracking of vehicle targets, road condition detection and real-time monitoring of traffic flow [5, 6]. The extraction and location of vehicle targets are mainly realized by the construction of the detection background to extract the characteristics of the moving vehicle, while monitoring the vehicle parameters in the implementation. The road background is based on for modeling the road condition monitoring, and the road surface can be divided by the acquired data information, and the vehicle detection area is extracted to obtain the conversion between the road plane coordinates and the left side of the multimedia spectrum plane. The data of the road and traffic flow obtained in previous times is integrated by the road traffic to complete the data analysis and statistics of the traffic flow on different lanes [7–11]. This system uses the traffic flow pictures collected by the cameras placed on the platform.Figure 1
System flow chart.The main control software design is mainly composed of two main programs, which are the main control programs that can complete different business logics and the programs that can realize the user-side GUI process control. The main control program is mainly to receive external commands, and meanwhile send the obtained traffic flow information to the corresponding business module for processing, effectively realizing the business logic between systems.The main process uses a message transfer mode including a communication module, a message transfer module, and a business module. The communication module mainly establishes a network link [12–14], and sends the received data information from the control information obtained to an arbitration level information commands are sent to the control center through the service interface. The control command center module executes in accordance with the message queue mechanism acquired by the GUI process system and the method of sending and receiving information between the corresponding processes. When the service module mainly processes specific services and all service modules are initialized, the service function module sends the command information that needs to be processed to the message control module. At the same time, when data information is received, the data control center will send the command information to the business module for sorting. The GUI process is developed based on the embedded graphics library mimugui, which is mainly a graphical user interface that realizes the needs of business logic. The GUI process communicates with the main process in the same way as the message queue [15].The vehicle positioning detection module mainly communicates with the weight measurement platform and adopts the modbus protocol. This module is the master, and the vehicle volume measurement platform is mainly used as a slave device. The input of the vehicle positioning detection module is received using the RS485 interface, and the vehicle volume detection module is used to extract vehicle volume-related data information, and at the same time, it is sent to the message arbitration module to obtain the quantity statistics operation command from the outside. The output of the detection module includes the transmission of the detection result data to the center via the network. The results of the quantity statistics are stored in the database. The detection of instructions are sent to the detection platform through the RS485 interface. the RS485 interface and the quantity statistics platform are used for the processing of the quantity statistics module to construct information and data associations. Meanwhile, the automatic fixed time is set at the RS485 interface to automatically and regularly read the vehicle information from the quantity statistics platform, and the analysis results are sent to the module for processing through data analysis. The interface to network is used by vehicle positioning detection module to send statistical results to the control center and stores them in the database. The processing steps of the detection module are shown in Figure2.Figure 2
Block diagram of quantity statistics module.The GPS module is used to obtain the geographic information parameters of the vehicle in this paper. When the vehicle image is acquired, and it is used in the systeml, the processing of the above data can be displayed digitally, and the obtained results will be stored. The input GPS device of the GPS module is GPS information data sent via the network in this paper. The output of the GPS module’s data information is encrypted and protected in the network center, and then the message arbitration module is used to store the vehicle-related data information in the GUI module. The warning information about GPS is stored in the database, and the data sent is mainly the warning information of GPS. The paper. GPS module is usually processed with a dedicated network to obtain the GPS device data information and use the GPS data analysis function module to realize the transmission of relevant information data and relevant alarm information by the network center GPS. As shown in Figure 3.Figure 3
GPS module block diagram.The data transmission task mainly includes the vehicle-mounted terminal transmitting data to the monitoring platform. In addition to the real-time data of the vehicle, it also includes sending the identification information and data mentioned in the link management task to the mainly includes branch of monitoring platform as supplement. The vehicle-mounted terminal can transmit information to multiple monitoring centers, so multiple data transmission tasks coexist. The data management is performed for coordinating multiple data transmission tasks to prevent conflicts and resource competition.


## 2.2. Collection of Multisource Traffic Information

In order to realize the optimal collection and fusion dispatching of traffic in a complex traffic network environment, first the design of a distributed data structure of multisource and multisource traffic information shall be carried out in the complex traffic network environment, and a multisource traffic information database structure is built in a complex network environment,..0 + the fuzzy decentralized preservation center of multisource traffic information needs to be represented by 4 groups G. Supposei is the feature space of the interaction of multiple sources of traffic information in a complex traffic network environment. The multisource traffic information is reconstructed in a high-dimensional feature space in a complex traffic network environment using the coupled statistical method of multiple non-linear components, combined with pattern recognition and adaptive clustering methods, to carry out the information fusion and feature extraction of source traffic information in multiple traffic network environments. Based on the above analysis, Figure 4 shows the overall structure model of building a combination of multisource traffic information collection and fusion collection in a complex traffic network environment.Figure 4
The overall structure model combined by multisource traffic information collection and fusion collection.According to Figure4, the multisource traffic information collection process contains a large amount of interference information and road condition information. This multisource traffic information indicates the data by spectral characteristics. The multisource and multisource traffic information contains n variables. y1,y2,…,yn can be used to represent the variable threshold corresponding to aj. The simplified mathematical model of multisource traffic information can be explained by the following formula.(1)G1=b11a1+b12a2+,…,b1nanG2=b21a1+b22a2+,…,b2nan⋯Gn=bn1a1+bn2a2+,…,+bnnan.Among them,aj and Gk both have a strong correlation, which represents a distributed array of sensors that collect multisource traffic information in a complex traffic network environment, and use multisensor fusion recognition methods for effective information mining in multisource traffic in the Internet of Vehicles. The fuzzy adaptive clustering method is used to construct multisource in multi traffic information statistical feature quantity, combined with normalized feature extraction method, the multisource traffic information autoregressive analysis result is uxjξj, and the detection problem of multisource traffic information is transformed into a linear problem of measuring the dynamic distribution of multisources in a complex traffic network environment. According to the above design, the statistical result model of multisource traffic information is analyzed, and the statistical feature sampling method is used to carry out the acquisition of the information of the original multisource traffic [8].


## 2.3. Big Data Fusion of Traffic Information

Based on the time-frequency coupling distribution of the multisource traffic bit sequence, the genetic algorithm method is used to remove the interference component and the feature set of the multisource traffic information [9] and realize the fuzzy clustering processing of the multisource traffic information of the automobile network: kxi,xj(2)minw,b,ξ12w2+C∑j=1luxjξjs.t.yjw⋅xj+b+ξj≥1ξj≥0,j=1,2,…,l.Regarding the nonlinear collection and combination problem, based on the temporal variability and random change characteristics of traffic information, the fuzzy dynamic change kernel functionkxi,xj is introduced for dynamic feature separation. The following quadratic planning shows the information fusion of multisource and multisource traffic information problem.(3)minα12∑i=1l∑j=1lyiyjαiαjKxi,xj−∑j=1lαjs.t.∑j=1lyjαj=00≤αj≤uxjC,j=1,2,…,l.Based on the results of feature extraction, statistical regression analysis is used to analyze the nonlinear structure group of multisource traffic information in a complex traffic network environment [10], and a linear coupling model is derived:(4)xk=∑n=0N/2−12ancos2πknN−bnsin2πknN,k=0,1,…,N−1.Among them,an represents the feature distribution of multisource traffic information linear programming in a complex transportation network environment. There are m multisource traffic information nodes A1,A2,…,Am in a complex transportation network environment to construct multisource traffic information fusion scheduling in a complex transportation network environment. Its mathematical expression is as follows:(5)minf=∑i=1m∑j=1nCijXij,s.t.∑j=1mXij=ai,i=1,2,…,m∑i=1mXij=bi,j=1,2,…,nXij≥0,i=1,2,…,m;j=1,2,…,n.Assuming that the number of multisource and multisource traffic information distribution nodes in the current complex traffic network environment isn, N1,…,Nn the learning method of fuzzy convolutional neural network is adopted to realize the big data fusion of traffic information.


## 3. Collection Combination Configuration Model

When analyzing traffic conditions, a sufficient amount of multisource traffic information must be used as a database, but excessive traffic data will cause data duplication and redundancy [5]. Meanwhile, too many information collection devices have limited improvement in real-time monitoring of traffic conditions, which also causes a waste of social resources. Therefore, the basic idea of modeling in this paper is to comprehensively utilize the advantages of multiple multisource traffic information collection devices, make up for the shortcomings of different types of equipment, and form a multi-source traffic information collection system that constitutes an efficient and low-cost combination structure for correct collection and analysis of the data of the communication status.A single multisource traffic information collection device is the basis of a composite configuration system. In order to make full use of the applicability of a single device, the principle of single configuration is first discussed.


### 3.1. Layout Based on a Single Multisource Traffic Information Collection Device

General information collection devices are considered mainly in this article, which divides the types of devices into fixed and mobile types, and discusses their configuration methods.


#### 3.1.1. Layout Method of Fixed Collection Equipment

Set the road network as G (T, A), whereT is the node in the road network and A is the road section in the road network. αji is defined as whether i multisource traffic information collection equipment is installed on the j section. If it is set, then αji=1, if not set, then αji=0. Based on the maximization of utility, the utility maximization model of collection equipment is established [6]:(6)maxU=∑αi∈Aαjifirj,αji=0or1,where U is the utility of the collection equipment; fj is the traffic fluctuation coefficient of road section j; and rj is the objectively important coefficient of road section j.(1) Determination of Traffic Fluctuation Coefficientfj. The traffic variation coefficients in different sections are different. The traffic variation coefficient is mainly affected by the traffic flow [7].The traffic fluctuation coefficient is determined by the traffic volume. Take the observation samplehk, k=1,2,…,l, calculate the sample mean μhk variance μhk, let(7)fk=δhkμhk.The maximum is taken through computation, then(8)fmax=maxhk,k=1,2,3,…,m,fmin=minhk,k=1,2,3,…,m.Based on equation (3) (9)(9)∑k=1lμ2hk=∑k=1lδ2hk/fk2.Then,(10)∑k=1lδ2hk/fmin2≥∑k=1lμ2hk≥∑k=1lδ2hk/fmax2.Due to change in equal change, the following is obtained(11)fmax≥∑k=1lδ2hk/∑k=1lμ2hk1/2≥fmin.Then the fluctuation coefficient of the road section is(12)fj=∑k=1lδ2hk/∑k=1lμ2hk1/2.(2) Determination of the Objective Importancerjof Road Sections. The importance of different roads is almost inconsistent. The location of the bottleneck in the road network has a great impact on the road network. For example, sections with heavy traffic during peak hours and sections in busy streets are compared with the section with small traffic volume has relatively little impact on the road network. For example, unimportant sections near the suburbs.The importance of the road network can be calculated according to the traffic volume [8]. The total traffic flow Q=∑j=1rqj is defined, where r is the total number of intervals, qj is the flow of interval j, Q≤LL is the network capacity, and Q is the historical data. Therefore, the objective importance Tj of segment j is(13)rj=qjQ.


#### 3.1.2. How to Determine the Sample Size of GPS Floating Car

Different from fixed information collection equipment, mobile equipment mainly adjusts the input amount to ensure sufficient data collection [9]. This article chooses the floating lane network coverage. γ as an index to evaluate the adequacy of the input amount, there are(14)γ=rR×100%.In the formula:r is the number of road sections that can be covered by the floating car and R is the total road section number in the road network.The condition for judging whether a road is covered is that GPS floating car information can be obtained during the research cycle. With reference to previous research experience, there is the following relationship between the number of GPS floating vehicles in the road network and the capture rate.(15)γ=exp−a0+a1x2+a2x2+a3x3+a4x4+a5x5+a6x6+a7lnx72,γ≥C1x7≤C2drdx7≥C3,where γ is the coverage of the road network; x1 is the area of road network, 100 km2; x2 is the ratio of the expressway in the road network to the total road length; x3 is the ratio of the main arterial road to the total road length; x4 is the secondary arterial road to the total road length. X5 is the proportion of the length of secondary access road to the total road; x6 is the density of road network, km/km2; x7 is the number of floating vehicles, (in hundreds); C1 is the minimum threshold of road network coverage, (in hundreds); C2 is maximum number threshold of GPS floating vehicles, (in hundreds); C3 is the minimum threshold of the marginal contribution of the number of floating cars to the coverage of the road network. In the model, a0, a1, a2, a3, a4, a5, a6, and a7 can be obtained by regression analysis.


### 3.2. Combination Configuration Principle for Multisource Traffic Information Collection

The combination configuration of multisource traffic information collection shall satisfy the following principles:(1)
Ability to collect more effective multi-source traffic information;(2)
While minimizing the cost of the arrangement of the collection equipment, more effective multisource traffic information can be collected, and multifunction can be used to limit the overlap of data.(3)
The reduction of equipment input discussed in this paper is mainly based on the viewpoint of reducing the redundancy of data collection and subject to the optimization goals of other functions of the equipment.


### 3.3. Establishment of Model

The set N is defined as the number of different types of multisource traffic information collection devices, and different collection devices can be put on the same road.The defined variableaji indicates whether the ith multisource traffic information collection device is installed on the jth road. If is set, then aji=1; if it is not set, then aji=0, aji form matrix A.


#### 3.3.1. Construction of Objective Function considering Economic Benefits

Targeting at the lowest total configuration cost of collection equipment, with collecting the best multisource traffic information as the premise, there are various configuration methods for collection equipment. The cost of different equipment is different. In order to minimize the total cost of configuration, the most suitable layout plan can be obtained by optimizing the combination configuration.In this article, we only considered general fixed and mobile collection equipment. In the construction of the function for the purpose of economic effect, the key variable of the device needs to be considered for the fixed information collection device, and only the number of equipment needs to be considered for the mobile type.The definitionφji represents the factor variable of i kinds of multisource traffic information collection equipment on the j section, and the decisive factor is the characteristics of the collection equipment and the characteristics of the road section.Assuming that there arer sections in the road network, the numbers of fixed and mobile equipment are l and e, respectively. In order to minimize the overall cost of the equipment, the objective function is(16)min=∑i=1l∑j=1raji×φji×ci+∑i=1enici.In the formula: the value ofaji is taken as 1; ci is the cost of the ith type of equipment; and ni is the number of the ith type of equipment.


#### 3.3.2. Construction of Objective Function considering Comprehensive Benefits

In order to meet the basic requirements for collecting data, a multifunctional comprehensive income function is also established to reduce the overall cost of the equipment.The variablesxik is defined as (xik 0–1 variables), xik indicating whether the kth data can be obtained by the ith multisource traffic information collection device, if it can be obtained, then xik=1∇f,f′, if it cannot be obtained, then xik=0.From the above analysis, the following matrix can be obtained:(17)Pijk=Ax11x12⋯x1g⋮⋮⋮xe+l1xe+l2⋯xe+lg=b11b12⋯b1g⋮⋮⋮br1br2⋯brg,where Pijk is a collection of the kth multisource traffic information obtained by various collection devices on the j section; A is the matrix formed by aji; bjk is the kth multi-source traffic information obtained on the j section; g for multisource traffic information collection = the number of equipment categories, then(18)Pijk=b11′b12′⋯b1g′⋮⋮⋮br1′br2′⋯brg′.The effect maximization function of multisource traffic information collection equipment is(19)maxU=∑j=1r∑k=1gbjk′fjrj,where bjk′ is the k multisource traffic information jointly acquired by all collection equipment on the j section, when bjk′≥1, bjk′=1, otherwise bjk′=0,. The coverage rate of mobile multisource traffic information collection equipment y is(20)γy=∑j=1rayjr,where ayj as the coverage rate of the Y multisource traffic information collection equipment in section j.Finally, the sample supply ofy is clarified. In addition, on the basis of benefit maximization and economic benefit optimization, the planning function of multiple objectives is(21)minZ=∑i=1l∑j=1raji×φji×ci+∑i=1enicimaxU=∑i=1l∑j=1rbjkfjrjs.t.aji≥0,aji=0or1bjk=∑i=1l+eaji×xikbjk′,ifbjk≥1,bjk′=1,otherwise,bjk′=0ny=ϕ∑j=1rayj.


#### 3.3.3. Solving Algorithm

In order to solve the multiobjective planning function problem, the first step is to maximize the function(22)minZ=−∑i=1l∑j=1raji×φji×ci−∑i=1enicimaxU=∑i=1l∑j=1rbjk′fjrjs.t.aji≥0,aji=0or1bjk=∑i=1l+eaji×xijbjk′,ifbjk≥1,bjk′=1,otherwise,bjk′=0ny=ϕ∑j=1rayj.During the process of solving, due to existence of certain conflicts between multiple targets, it is difficult to obtain the ideal optimal solution, so intelligent algorithms can be used to obtain the optimal solution.In this paper, we use a multisfunctional planning solution based on genetic algorithm to calculate [11]. First, the priority solution f(x∗) is determined, and the solution is 337519; 39 can be found around the solution. (X∗) is the satisfaction solution of the model.By checking the correlation between the two, two gray correlations can be expressed, that is, a single objective function converted into a solution(23)max∇f,f′s.t.aji≥0,aji=0or1bjk=∑i=1l+eaji×xikbjk′,ifbjk≥1,bjk′=1,otherwise,bjk′=0ny=ϕ∑j=1rayj,where the gray correlation ∇f,f′ is(24)∇f,f′=minf′x∗−fx∗+ξmaxf′x∗−fx∗f′x∗−fx∗+ξmaxf′x∗−fx∗.Assuming there arep objective functions in total, the solution model based on the gray relational degree algorithm is(25)max∑p=1kωpminf′x∗−fx∗+ξmaxf′x∗−fx∗f′x∗−fx∗+ξmaxf′x∗−fx∗s.t.aji≥0,aji=0or1ny=ϕ∑j=1rayj.The approximate optimal solution is obtained through genetic algorithm, and the final optimal solution is obtained through repetition.


### 3.4. Parking Lot Location Guidance Algorithm Based on Dijkstra Algorithm

Generally speaking, Dijkstra’s algorithm uses an adjacency matrix for storage. The adjacency matrix stores the relationship between each node. However, considering the actual situation of urban roads, although there are many nodes in the road graph, there are few directly connected points. Therefore, the actual road graph is a sparse graph, and the corresponding adjacency matrix is also a sparse matrix. Therefore, if the adjacency matrix is used to store the nodes, a lot of space will be wasted.In this paper, the adjacency list is used to replace the adjacency matrix, which can reduce the space complexity of the algorithm. The comparison of the two storage methods is as follows:If it is assumed that there areb nodes in the graph G=V,E, then its adjacency matrix A is a symmetric matrix.IfG is an unweighted graph, its adjacency matrix can be expressed as(26)Ai,j=1,Vi,Vj∈EG,0,Vi,Vj∉EG.We believe that the actual city road map is an undirected weighted map. In the adjacency matrix ofG=V,E, the elements are(27)Ai,j=ωij,Vi,Vj∈EG,0,Vi,Vj∉EG&i=j,∞,Vi,Vj∉EG&i≠j.That is, the element on the symmetry line of the adjacency matrix is 0, whereωij is the weight between two points, and ∞ represents that i and j are not connected. A typical undirected weighted graph is shown in Figure 5:Figure 5
A typical undirected weighted graph.The adjacency matrix is(28)A=012310∞42∞053450.On the one hand, the storage space of the adjacency matrix is only related to the number of nodes and containsn2 elements in total. However, since the adjacency matrix is mostly a sparse graph, a lot of space is wasted. On the other hand, the time complexity of the Dijkstra algorithm using the adjacency matrix storage method is On2, and the time cost is too large.The adjacency list is a very useful storage structure for sparse graphs. All the nodes in the graph are stored in a one-dimensional array, and then the edge with it as the end point is linked after each node to form a linked list. The linked list node is composed of three parts: the start point, the end point, and the weight of the edge. As shown in Figure6, v0 is a three-way intersection, and there are 3 sides with it as the endpoint. Then, we can build a singly linked list connecting these 3 edges and then connect it to v0.Figure 6
vo example diagram.Figure7 is stored as an adjacency list as follows:Figure 7
Adjacency list of undirected weighted graph.The adjacency table storage requires onlyn + m storage units, far less than n2.From the perspective of space complexity, the adjacency table only needsn+2m storage units, while the adjacency matrix requires n2, and the storage efficiency advantage of the adjacency table is significant. In terms of time complexity, the complexity of the adjacency list Om+n is also much lower than the complexity of the adjacency matrix On2.In the research process, the graph is regarded as a plane graph, and the shortest path value from the temporarily marked node to the starting node and the Euclidean distance to the target node are added, and this value is regarded as the characteristic value of the marked node. In the selection process of permanent marked nodes, it is necessary to use this value as a theoretical basis to select among the set of temporary marked nodes, and permanent marked nodes can select the smallest temporary node of this value. This method can ensure that the target node can be found more accurately and quickly through the Dijkstra algorithm, and the search efficiency can be improved.Through the above algorithm, the premise of determining the permanent mark point is that the above two values add to the minimum value. The concept of an ellipse here is a trajectory corresponding to a point in the surface where the distance betweens and t is added to a constant 2c. Among them, the point p is located on the trajectory, and the distances to the two points s and v are dsp and dtp, respectively, then dsp+dtp=2c can be obtained. Through this traversal method to find the shortest path method, the end point and the meta point can be regarded as two focal points, which can be regarded as a concentric ellipse. Before Dijkstra algorithm is optimized, the corresponding search process is shown in Figure 8:Figure 8
Classic Dijkstra algorithm.After Dijkstra algorithm is optimized, the corresponding search process is shown in Figure9:Figure 9
The optimized Dijkstra algorithm.If nodesv1 and vk are both temporarily marked nodes, s is the starting node, and t is the target node. It can be seen from Figure 10 that d1 and dk are the shortest path lengths between v1 and vk and s, respectively, and D1 and Dk are the Euclidean distances between v1 and vk and t, respectively. The Euclidean distance between v1 and vk is C.Figure 10
Schematic diagram of optimized Dijkstra algorithm.In the Dijkstra algorithm before optimization, in terms of selecting marked nodes, ifd1>dk, the marked node selects vk, otherwise it is v1. After the algorithm is optimized, if d1+D1>dk+Dk, then mark the node selects vk, otherwise it is v1.In summary, the search range of the latest algorithm is an ellipse. After optimization, the search efficiency is improved and the number of traversed nodes is reduced.The ellipse limits the range of the search area, see Figure11 for details. s is the starting node, v1 is the boundary node, t is the target node, and 2a is the maximum limit distance. The Euclidean distance between s and v1 is denoted by sv1, and the Euclidean distance between v1 and t is denoted by v1t, and the specific search range is sv1+v1t<2a. If sv1+v1t>2a, then these nodes can be ignored in the algorithm. The reason is that the distance traveled by s from v1 to t is greater than 2a. In this way, an ellipse is formed, the ellipse is composed of all nodes that meet the condition of sv1+v1t=2a, the focus is s and t, and the major axis is 2a.Figure 11
Search range restricted by ellipse.In summary, the parameters are set as follows:s and t are selected for the ellipse focus, and λ|st| is selected for the length of the major axis. The Euclidean distance between s and t is represented by st, and the confidence coefficient is λ.In the process of setting parameters, the main purpose is to find a more reasonable long axis, that is, to calculate the most reasonableλ, and get the desired ellipse search interval.The principle of findingλ: among the passing road network nodes, a group of nodes with strong representativeness is selected, and the starting node set and the target node are formed by multiplying A and B, which is the C composed of A and B of the required shortest path. C is also a set, that is,(29)C=A×B=a,b|aEAαbeB.Among them, the starting node is represented byal, the target node is represented by bl, the Euclidean distance between the two is represented by Ealbl, and Palbl is the specific value of the shortest path. Through λi=Palbl/Ealbl, λi can be obtained. Regarding what kind of data is selected, the coefficient size of the specific ratio is obtained, and it is expressed in the form of a set, which is Γ. By studying the elements in it, λ0 is obtained. Then, at λi≤λ0, the confidence level is 95%. Then, λ0 is the specific coefficient size, so the size of the major axis can be obtained: 2a=λ0st.It can be seen from Figure12 that s belongs to any element in A, t belongs to any element in B, λ=Pst/Est, and the shortest path between s and t is represented by Pst, which is s⟶v1⟶v2⟶v3⟶⋯⟶t. The Euclidean distance between s and t is denoted by Est. In the process of calculating λ, Est is divided into segments, the number is n, and any segment is denoted as Est1=Est2=⋯=Est=Estni=1,2,3,…,n. According to the situation of segmentation, Pst is also segmented, the number is also n, and any segment is Pst1=Pst2=⋯=Psti=Pstni=1,2,3,…,n, and there is Psti=Esti/cosθi.Figure 12
Schematic diagram of the research on the rule ofλ value.The calculation process ofλ is(30)λ=PstEst=Pst1+Pst2+⋯+Psti+⋯+PstnEst=1n1cosθ1+1cosθ2+⋯+1cosθn=1n∑i=1n1cosθi.In urban roads,θi generally takes a value on 0,π/4. The following three cases discuss the value of λ:(1)
Ifs and t have a relatively close distance, n has a smaller value. In order to prevent the shortest path from being found in the search range and to ensure that all valid nodes are included in the ellipse range, the maximum value of λ can be selected at this time.(31)λmax=1n∑i=1n1cosθi=1n⋅n2=2.(2)
Ifs and t have a very long distance, n is infinite. On 0,π/4, θi conforms to a uniform distribution, then λ is(32)λ∞=∫0π41cosθ4πdθ=4πlnsecθ+tanθ|0π4=4πln2+1≈1.122.(3)
Ifs and t have a longer distance, n has a larger value, and λ basically conforms to the normal distribution, then Nμ,σ2/n, and the specific formula is(33)μ=E1cosθ=∫0π41cosθ4πdθ≈1.122,σ2=D1cosθ=E1cos2θ−E1cosθ2=∫0π4sec2θ4πdθ−∫0π41cosθ4πdθ2=4π−4πln2+12≈0.01412.It can be seen that the larger the value ofn, the more normal distribution is obeyed. Therefore, in order to obtain more accurate data results, this paper chooses the ellipse with the largest area, then λ = 1.414. Moreover, when there is a long distance between s and t, when the study is conducted from the perspective of normal distribution, according to the confidence level query, the confidence level reaches 95%.The performance analysis of the ellipse search algorithm is as follows:(1)
Algorithm validity analysisIn this regard: the main focus of attention is running time. The search range of the Dijkstra algorithm before optimization is(34)SDiksrva=πr2=πλ+12st2.The search range of the ellipse restricted area algorithm is(35)Sllipse=πab=πst2x2−1st2.(2)
Reliability analysis of the algorithmThe so-called reliability is to ensure that the path found belongs to the shortest path.In a specific road network, nodes do not exist alone and have strong connectivity. There are basically paths connected between two points. If there is a small straight-line distance between the starting node and the target node, it will have a relatively small distance. The traversal range is small, and the path to China Unicom may not be found. In order to avoid this problem, in the research process of this paper, the eccentricity selected by the ellipse algorithm is the largest, that is, the ellipse area is the largest.In summary, in the case ofλ = 1.414, the confidence level is 95%, that is, only 5% may not be able to find the required shortest path.(3)
Algorithm applicability analysisIn the application process of the ellipse search algorithm, the search range is limited, the work efficiency is improved, and the traversal time is reduced. However, in order to make it clear that all newly appearing nodes are within this range through this method, it is necessary to perform many operations of product and square root extraction, so it takes a lot of time.The algorithm flow isThe first step is to initialize the data. The algorithm clarifiess and t and calculates the straight-line distance st between them based on their latitude and longitude calculations.The second step is to define the ellipse area. The focus iss and t, λ=1.414, from which the eccentricity can be known, and the elliptical area can be obtained.The third step is to select the breadth-first search method to find the node and compare the value of the sum of the Euclidean distance between the node tob and t with the length of the long axis of the ellipse. If sv1+v1t<2a, then this node is included in the area.The fourth step is to find the shortest path st in the ellipse interval using Dijkstra’s algorithm and then terminate the algorithm.Through the understanding of the algorithm of the ellipse restricted search area, it is found that the calculation process has a slower speed, takes more time, and has lower work efficiency. Therefore, the algorithm is analyzed and researched. In the calculation process of the rectangular restricted search area algorithm, the required result can be obtained without a lot of calculation, and it has a good effect. The algorithm mainly calculates the circumscribed rectangle of the ellipse area and treats it as a restricted search area, so it achieves the effect of reducing the calculation amount of the algorithm.The specific content is shown in Figure13. s is the starting node, t is the target node, and the ellipse equation can be described by s,t,λ. In this process, in order to make the calculation easier, the center of the ellipse is assumed to be the origin of the coordinates, and the two focal points of the ellipse are above the g axis, then the coordinates −xs,0 of s and the coordinates xt,0 of m are obtained, and xe=xt=c.Figure 13
Schematic diagram of ellipse algorithm coordinates.The elliptic equation is(36)x2a+y2b=1.The parametric equation is(37)x=acosθy=bsinθθ∈0,2π.In the above formula,c2+b2=a2,a=λc.The elliptic equation is used to derive the derivative of x:(38)y′=−b2a2xy.As shown in Figure13, when a point x0,y0 is taken, the tangent equation is(39)y=−b2a2xyx−x0+y0.Whenm=−b2/a2x0/y0, the tangent equation is(40)y=mx±a2m2+b2.Then the distance between the two tangents is(41)d1=2a2m2+b2m2+1.As shown in Figure14, we take a point x1,y1 and its tangent is(42)y=−1mx±a2m2+b2.Figure 14
Comparison of ellipse and rectangular restricted areas.Then the distance between the two tangents is(43)d2=2a2+b2m2m2+1.If the ellipse has a circumscribed rectangle with the smallest area, then the formulas (38) and (40) can be used to obtain Srectangle:(44)Srectangle=d1⋅d2=4a2m2+b2⋅a2+b2m2m2+1.It can be seen from the above formula that ifm2 is equal to 0, that is, in the case of m=0, the ellipse has a circumscribed rectangle with the smallest area. If the tangent line passes through x0,y0, it is parallel to the axis, and if the tangent line passes through x1,y1, it is parallel to the axis.Ifm=0, that is, in the case of θ=kπ/2k=0,1,2,3,…, the area of the rectangle is the minimum:(45)Srectargle=4ab=4λλ2−1st2.Ifm=1, that is, in the case of θ=π+2kπ/2k=0,1,2,3,…, the area of the rectangle is the maximum:(46)Srectargle=2a2+b2=22λ2−1st2.It can be seen from Figure14 that the figure can be obtained as a standard ellipse rotation. The rotation angle is θ, and it translates xc and yc in the x and y directions, respectively. The elliptic equation can be obtained by the coordinate values of s and t:(47)x−xccosθ+y−ycsinθ2a2+−x−xcsinθ+y−yccosθ2b2=1.In the above formula,c2+b2=a2,xc=xs+xt/2,yc=ys+yt/2,θ=arctanyt−ys/xt−xs. x and y:(48)xm=xc±a2cos2θ+b2sin2θ,ym=yc±b2cos2θ+a2sin2θ.By reduction, the boundary of the rectangular area is obtained:(49)xm=xc±stλ2−sin2θ,ym=yc±stλ2−cos2θ.Then, the area of the rectangular area isSrectargle∈4ab,2a2+b2Performance analysis of rectangle search algorithm:


#### 3.4.1. Algorithm Validity Analysis

If the area of the rectangle is the smallest, the ratio of the search area of the rectangle and the ellipse is(50)SrectargleSellipse=4abπab≈1.27.If the area of the rectangle is the largest, the ratio of the search area of the rectangle and the ellipse is(51)SrectangleSellipse=2a2+b2πab=4λ2−2πλλ2−1.


### 3.5. Parking Space Reservation Module

After the user finds the target parking lot, he may need to make a parking space reservation. Generally speaking, there are two ways to make a reservation: reserve a parking lot or reserve a parking space. The following is an analysis of possible reservation methods: (1) reserve a parking lot with precise reservation: if the reservation method provided to the parking lot of the parking lot means that it cannot fully guarantee that the user will leave a space for reserved vehicles after driving to the parking lot. Therefore, scientific traffic forecasting is required to ensure that a certain number of reserved vehicles arrive at the time of arrival. It can also guarantee a certain parking space. The calculation process of this method is too complicated, and for the peak parking period, the supply is often in short supply. Therefore, it is difficult to realize the reservation behavior of reserved parking. Fuzzy reservation: the parker makes a reservation for a fixed parking time. The parking lot guarantees that the parking space is free at the scheduled time and will not be illegally occupied. In order to ensure the above effects, it is necessary to ensure that there is a certain amount of vacant parking spaces that can be turned over. The berth cannot be used at the highest efficiency. (2) Precise reservation of the reserved parking space: the parking space and the start and end time are accurately reserved by the parker. The system needs to have parking space status detection equipment and parking space occupancy equipment. But for CBD commercial buildings, hospitals, and other areas, parking behavior is of high frequency and changeable. A parking person may delay parking and affect the next scheduled parking person to park the vehicle. Therefore, this kind of contradiction is difficult to solve, so stop. Accurate prediction of the position is not feasible. Fuzzy reservation + precise reservation: fuzzy means that you do not book an accurate parking start time, and precision means that the object of pleasure is the parking space. When a parker chooses a predetermined behavior, the general understanding is that the parker is worried that it is difficult to find a parking space within the arrival time or that the parking space best meets the user’s expectations and wants to book in advance. Therefore, the system adopts this method. Specifically, the user has reserved a parking space in a parking lot, and since the reservation, the user’s billing starts. In order to balance the user’s affordability and the parking revenue, the reservation fee is set as 50% parking fee, the strategy can be optimized in the future, such as different charging standards in different time periods. In summary, only the fuzzy reservation + precise reservation mode for parking spaces is suitable for this system. Parkers can decide whether to reserve a parking space based on the predicted number of empty parking spaces mentioned in the previous chapter and their own needs. If there is a reservation in this mode, the reservation function can be designed with reference to the reservation business process, as shown in Figure15:Figure 15
Business process of parking space reservation.When the user clicks on a parking lot in the reservation module, he enters the parking space reservation details page. The module has a parking space map of the parking lot, and the parking space map indicates the best parking space recommended by the system. The most important factor in the problem of the best parking space in the parking lot is the parking distance, which can be regarded as the shortest path problem (other factors have a weak influence and are not considered for the time being). That is to find the minimum value of stopping distance + driving distance away, so the shortest path algorithm is used to calculate the parking space and guidance path of the shortest path. This module can greatly improve the decision-making efficiency of parking seekers.Suppose the entrance of the parking lot isE and the exit is S. If a certain free parking space is Pii=1,2,…,n, the shortest path corresponding to the entrance process is pathE,P, and the shortest path corresponding to the exit process is pathpi,s.Then the entire shortest path length corresponding to the parking space isdpathE,pi+pathpi,sThe shortest path length corresponding to the best parking space can be described asmindpathE,p1+pathpi,s,dpathE,p2+pathp2,s,…,dpathE,pn+pathpn,s.In other words, the core of this algorithm is to find the point and path of the minimum value ofdpathE,pi+pathpi,s.


## 3.1. Layout Based on a Single Multisource Traffic Information Collection Device

General information collection devices are considered mainly in this article, which divides the types of devices into fixed and mobile types, and discusses their configuration methods.


### 3.1.1. Layout Method of Fixed Collection Equipment

Set the road network as G (T, A), whereT is the node in the road network and A is the road section in the road network. αji is defined as whether i multisource traffic information collection equipment is installed on the j section. If it is set, then αji=1, if not set, then αji=0. Based on the maximization of utility, the utility maximization model of collection equipment is established [6]:(6)maxU=∑αi∈Aαjifirj,αji=0or1,where U is the utility of the collection equipment; fj is the traffic fluctuation coefficient of road section j; and rj is the objectively important coefficient of road section j.(1) Determination of Traffic Fluctuation Coefficientfj. The traffic variation coefficients in different sections are different. The traffic variation coefficient is mainly affected by the traffic flow [7].The traffic fluctuation coefficient is determined by the traffic volume. Take the observation samplehk, k=1,2,…,l, calculate the sample mean μhk variance μhk, let(7)fk=δhkμhk.The maximum is taken through computation, then(8)fmax=maxhk,k=1,2,3,…,m,fmin=minhk,k=1,2,3,…,m.Based on equation (3) (9)(9)∑k=1lμ2hk=∑k=1lδ2hk/fk2.Then,(10)∑k=1lδ2hk/fmin2≥∑k=1lμ2hk≥∑k=1lδ2hk/fmax2.Due to change in equal change, the following is obtained(11)fmax≥∑k=1lδ2hk/∑k=1lμ2hk1/2≥fmin.Then the fluctuation coefficient of the road section is(12)fj=∑k=1lδ2hk/∑k=1lμ2hk1/2.(2) Determination of the Objective Importancerjof Road Sections. The importance of different roads is almost inconsistent. The location of the bottleneck in the road network has a great impact on the road network. For example, sections with heavy traffic during peak hours and sections in busy streets are compared with the section with small traffic volume has relatively little impact on the road network. For example, unimportant sections near the suburbs.The importance of the road network can be calculated according to the traffic volume [8]. The total traffic flow Q=∑j=1rqj is defined, where r is the total number of intervals, qj is the flow of interval j, Q≤LL is the network capacity, and Q is the historical data. Therefore, the objective importance Tj of segment j is(13)rj=qjQ.


### 3.1.2. How to Determine the Sample Size of GPS Floating Car

Different from fixed information collection equipment, mobile equipment mainly adjusts the input amount to ensure sufficient data collection [9]. This article chooses the floating lane network coverage. γ as an index to evaluate the adequacy of the input amount, there are(14)γ=rR×100%.In the formula:r is the number of road sections that can be covered by the floating car and R is the total road section number in the road network.The condition for judging whether a road is covered is that GPS floating car information can be obtained during the research cycle. With reference to previous research experience, there is the following relationship between the number of GPS floating vehicles in the road network and the capture rate.(15)γ=exp−a0+a1x2+a2x2+a3x3+a4x4+a5x5+a6x6+a7lnx72,γ≥C1x7≤C2drdx7≥C3,where γ is the coverage of the road network; x1 is the area of road network, 100 km2; x2 is the ratio of the expressway in the road network to the total road length; x3 is the ratio of the main arterial road to the total road length; x4 is the secondary arterial road to the total road length. X5 is the proportion of the length of secondary access road to the total road; x6 is the density of road network, km/km2; x7 is the number of floating vehicles, (in hundreds); C1 is the minimum threshold of road network coverage, (in hundreds); C2 is maximum number threshold of GPS floating vehicles, (in hundreds); C3 is the minimum threshold of the marginal contribution of the number of floating cars to the coverage of the road network. In the model, a0, a1, a2, a3, a4, a5, a6, and a7 can be obtained by regression analysis.


## 3.1.1. Layout Method of Fixed Collection Equipment

Set the road network as G (T, A), whereT is the node in the road network and A is the road section in the road network. αji is defined as whether i multisource traffic information collection equipment is installed on the j section. If it is set, then αji=1, if not set, then αji=0. Based on the maximization of utility, the utility maximization model of collection equipment is established [6]:(6)maxU=∑αi∈Aαjifirj,αji=0or1,where U is the utility of the collection equipment; fj is the traffic fluctuation coefficient of road section j; and rj is the objectively important coefficient of road section j.(1) Determination of Traffic Fluctuation Coefficientfj. The traffic variation coefficients in different sections are different. The traffic variation coefficient is mainly affected by the traffic flow [7].The traffic fluctuation coefficient is determined by the traffic volume. Take the observation samplehk, k=1,2,…,l, calculate the sample mean μhk variance μhk, let(7)fk=δhkμhk.The maximum is taken through computation, then(8)fmax=maxhk,k=1,2,3,…,m,fmin=minhk,k=1,2,3,…,m.Based on equation (3) (9)(9)∑k=1lμ2hk=∑k=1lδ2hk/fk2.Then,(10)∑k=1lδ2hk/fmin2≥∑k=1lμ2hk≥∑k=1lδ2hk/fmax2.Due to change in equal change, the following is obtained(11)fmax≥∑k=1lδ2hk/∑k=1lμ2hk1/2≥fmin.Then the fluctuation coefficient of the road section is(12)fj=∑k=1lδ2hk/∑k=1lμ2hk1/2.(2) Determination of the Objective Importancerjof Road Sections. The importance of different roads is almost inconsistent. The location of the bottleneck in the road network has a great impact on the road network. For example, sections with heavy traffic during peak hours and sections in busy streets are compared with the section with small traffic volume has relatively little impact on the road network. For example, unimportant sections near the suburbs.The importance of the road network can be calculated according to the traffic volume [8]. The total traffic flow Q=∑j=1rqj is defined, where r is the total number of intervals, qj is the flow of interval j, Q≤LL is the network capacity, and Q is the historical data. Therefore, the objective importance Tj of segment j is(13)rj=qjQ.


## 3.1.2. How to Determine the Sample Size of GPS Floating Car

Different from fixed information collection equipment, mobile equipment mainly adjusts the input amount to ensure sufficient data collection [9]. This article chooses the floating lane network coverage. γ as an index to evaluate the adequacy of the input amount, there are(14)γ=rR×100%.In the formula:r is the number of road sections that can be covered by the floating car and R is the total road section number in the road network.The condition for judging whether a road is covered is that GPS floating car information can be obtained during the research cycle. With reference to previous research experience, there is the following relationship between the number of GPS floating vehicles in the road network and the capture rate.(15)γ=exp−a0+a1x2+a2x2+a3x3+a4x4+a5x5+a6x6+a7lnx72,γ≥C1x7≤C2drdx7≥C3,where γ is the coverage of the road network; x1 is the area of road network, 100 km2; x2 is the ratio of the expressway in the road network to the total road length; x3 is the ratio of the main arterial road to the total road length; x4 is the secondary arterial road to the total road length. X5 is the proportion of the length of secondary access road to the total road; x6 is the density of road network, km/km2; x7 is the number of floating vehicles, (in hundreds); C1 is the minimum threshold of road network coverage, (in hundreds); C2 is maximum number threshold of GPS floating vehicles, (in hundreds); C3 is the minimum threshold of the marginal contribution of the number of floating cars to the coverage of the road network. In the model, a0, a1, a2, a3, a4, a5, a6, and a7 can be obtained by regression analysis.


## 3.2. Combination Configuration Principle for Multisource Traffic Information Collection

The combination configuration of multisource traffic information collection shall satisfy the following principles:(1)
Ability to collect more effective multi-source traffic information;(2)
While minimizing the cost of the arrangement of the collection equipment, more effective multisource traffic information can be collected, and multifunction can be used to limit the overlap of data.(3)
The reduction of equipment input discussed in this paper is mainly based on the viewpoint of reducing the redundancy of data collection and subject to the optimization goals of other functions of the equipment.


## 3.3. Establishment of Model

The set N is defined as the number of different types of multisource traffic information collection devices, and different collection devices can be put on the same road.The defined variableaji indicates whether the ith multisource traffic information collection device is installed on the jth road. If is set, then aji=1; if it is not set, then aji=0, aji form matrix A.


### 3.3.1. Construction of Objective Function considering Economic Benefits

Targeting at the lowest total configuration cost of collection equipment, with collecting the best multisource traffic information as the premise, there are various configuration methods for collection equipment. The cost of different equipment is different. In order to minimize the total cost of configuration, the most suitable layout plan can be obtained by optimizing the combination configuration.In this article, we only considered general fixed and mobile collection equipment. In the construction of the function for the purpose of economic effect, the key variable of the device needs to be considered for the fixed information collection device, and only the number of equipment needs to be considered for the mobile type.The definitionφji represents the factor variable of i kinds of multisource traffic information collection equipment on the j section, and the decisive factor is the characteristics of the collection equipment and the characteristics of the road section.Assuming that there arer sections in the road network, the numbers of fixed and mobile equipment are l and e, respectively. In order to minimize the overall cost of the equipment, the objective function is(16)min=∑i=1l∑j=1raji×φji×ci+∑i=1enici.In the formula: the value ofaji is taken as 1; ci is the cost of the ith type of equipment; and ni is the number of the ith type of equipment.


### 3.3.2. Construction of Objective Function considering Comprehensive Benefits

In order to meet the basic requirements for collecting data, a multifunctional comprehensive income function is also established to reduce the overall cost of the equipment.The variablesxik is defined as (xik 0–1 variables), xik indicating whether the kth data can be obtained by the ith multisource traffic information collection device, if it can be obtained, then xik=1∇f,f′, if it cannot be obtained, then xik=0.From the above analysis, the following matrix can be obtained:(17)Pijk=Ax11x12⋯x1g⋮⋮⋮xe+l1xe+l2⋯xe+lg=b11b12⋯b1g⋮⋮⋮br1br2⋯brg,where Pijk is a collection of the kth multisource traffic information obtained by various collection devices on the j section; A is the matrix formed by aji; bjk is the kth multi-source traffic information obtained on the j section; g for multisource traffic information collection = the number of equipment categories, then(18)Pijk=b11′b12′⋯b1g′⋮⋮⋮br1′br2′⋯brg′.The effect maximization function of multisource traffic information collection equipment is(19)maxU=∑j=1r∑k=1gbjk′fjrj,where bjk′ is the k multisource traffic information jointly acquired by all collection equipment on the j section, when bjk′≥1, bjk′=1, otherwise bjk′=0,. The coverage rate of mobile multisource traffic information collection equipment y is(20)γy=∑j=1rayjr,where ayj as the coverage rate of the Y multisource traffic information collection equipment in section j.Finally, the sample supply ofy is clarified. In addition, on the basis of benefit maximization and economic benefit optimization, the planning function of multiple objectives is(21)minZ=∑i=1l∑j=1raji×φji×ci+∑i=1enicimaxU=∑i=1l∑j=1rbjkfjrjs.t.aji≥0,aji=0or1bjk=∑i=1l+eaji×xikbjk′,ifbjk≥1,bjk′=1,otherwise,bjk′=0ny=ϕ∑j=1rayj.


### 3.3.3. Solving Algorithm

In order to solve the multiobjective planning function problem, the first step is to maximize the function(22)minZ=−∑i=1l∑j=1raji×φji×ci−∑i=1enicimaxU=∑i=1l∑j=1rbjk′fjrjs.t.aji≥0,aji=0or1bjk=∑i=1l+eaji×xijbjk′,ifbjk≥1,bjk′=1,otherwise,bjk′=0ny=ϕ∑j=1rayj.During the process of solving, due to existence of certain conflicts between multiple targets, it is difficult to obtain the ideal optimal solution, so intelligent algorithms can be used to obtain the optimal solution.In this paper, we use a multisfunctional planning solution based on genetic algorithm to calculate [11]. First, the priority solution f(x∗) is determined, and the solution is 337519; 39 can be found around the solution. (X∗) is the satisfaction solution of the model.By checking the correlation between the two, two gray correlations can be expressed, that is, a single objective function converted into a solution(23)max∇f,f′s.t.aji≥0,aji=0or1bjk=∑i=1l+eaji×xikbjk′,ifbjk≥1,bjk′=1,otherwise,bjk′=0ny=ϕ∑j=1rayj,where the gray correlation ∇f,f′ is(24)∇f,f′=minf′x∗−fx∗+ξmaxf′x∗−fx∗f′x∗−fx∗+ξmaxf′x∗−fx∗.Assuming there arep objective functions in total, the solution model based on the gray relational degree algorithm is(25)max∑p=1kωpminf′x∗−fx∗+ξmaxf′x∗−fx∗f′x∗−fx∗+ξmaxf′x∗−fx∗s.t.aji≥0,aji=0or1ny=ϕ∑j=1rayj.The approximate optimal solution is obtained through genetic algorithm, and the final optimal solution is obtained through repetition.


## 3.3.1. Construction of Objective Function considering Economic Benefits

Targeting at the lowest total configuration cost of collection equipment, with collecting the best multisource traffic information as the premise, there are various configuration methods for collection equipment. The cost of different equipment is different. In order to minimize the total cost of configuration, the most suitable layout plan can be obtained by optimizing the combination configuration.In this article, we only considered general fixed and mobile collection equipment. In the construction of the function for the purpose of economic effect, the key variable of the device needs to be considered for the fixed information collection device, and only the number of equipment needs to be considered for the mobile type.The definitionφji represents the factor variable of i kinds of multisource traffic information collection equipment on the j section, and the decisive factor is the characteristics of the collection equipment and the characteristics of the road section.Assuming that there arer sections in the road network, the numbers of fixed and mobile equipment are l and e, respectively. In order to minimize the overall cost of the equipment, the objective function is(16)min=∑i=1l∑j=1raji×φji×ci+∑i=1enici.In the formula: the value ofaji is taken as 1; ci is the cost of the ith type of equipment; and ni is the number of the ith type of equipment.


## 3.3.2. Construction of Objective Function considering Comprehensive Benefits

In order to meet the basic requirements for collecting data, a multifunctional comprehensive income function is also established to reduce the overall cost of the equipment.The variablesxik is defined as (xik 0–1 variables), xik indicating whether the kth data can be obtained by the ith multisource traffic information collection device, if it can be obtained, then xik=1∇f,f′, if it cannot be obtained, then xik=0.From the above analysis, the following matrix can be obtained:(17)Pijk=Ax11x12⋯x1g⋮⋮⋮xe+l1xe+l2⋯xe+lg=b11b12⋯b1g⋮⋮⋮br1br2⋯brg,where Pijk is a collection of the kth multisource traffic information obtained by various collection devices on the j section; A is the matrix formed by aji; bjk is the kth multi-source traffic information obtained on the j section; g for multisource traffic information collection = the number of equipment categories, then(18)Pijk=b11′b12′⋯b1g′⋮⋮⋮br1′br2′⋯brg′.The effect maximization function of multisource traffic information collection equipment is(19)maxU=∑j=1r∑k=1gbjk′fjrj,where bjk′ is the k multisource traffic information jointly acquired by all collection equipment on the j section, when bjk′≥1, bjk′=1, otherwise bjk′=0,. The coverage rate of mobile multisource traffic information collection equipment y is(20)γy=∑j=1rayjr,where ayj as the coverage rate of the Y multisource traffic information collection equipment in section j.Finally, the sample supply ofy is clarified. In addition, on the basis of benefit maximization and economic benefit optimization, the planning function of multiple objectives is(21)minZ=∑i=1l∑j=1raji×φji×ci+∑i=1enicimaxU=∑i=1l∑j=1rbjkfjrjs.t.aji≥0,aji=0or1bjk=∑i=1l+eaji×xikbjk′,ifbjk≥1,bjk′=1,otherwise,bjk′=0ny=ϕ∑j=1rayj.


## 3.3.3. Solving Algorithm

In order to solve the multiobjective planning function problem, the first step is to maximize the function(22)minZ=−∑i=1l∑j=1raji×φji×ci−∑i=1enicimaxU=∑i=1l∑j=1rbjk′fjrjs.t.aji≥0,aji=0or1bjk=∑i=1l+eaji×xijbjk′,ifbjk≥1,bjk′=1,otherwise,bjk′=0ny=ϕ∑j=1rayj.During the process of solving, due to existence of certain conflicts between multiple targets, it is difficult to obtain the ideal optimal solution, so intelligent algorithms can be used to obtain the optimal solution.In this paper, we use a multisfunctional planning solution based on genetic algorithm to calculate [11]. First, the priority solution f(x∗) is determined, and the solution is 337519; 39 can be found around the solution. (X∗) is the satisfaction solution of the model.By checking the correlation between the two, two gray correlations can be expressed, that is, a single objective function converted into a solution(23)max∇f,f′s.t.aji≥0,aji=0or1bjk=∑i=1l+eaji×xikbjk′,ifbjk≥1,bjk′=1,otherwise,bjk′=0ny=ϕ∑j=1rayj,where the gray correlation ∇f,f′ is(24)∇f,f′=minf′x∗−fx∗+ξmaxf′x∗−fx∗f′x∗−fx∗+ξmaxf′x∗−fx∗.Assuming there arep objective functions in total, the solution model based on the gray relational degree algorithm is(25)max∑p=1kωpminf′x∗−fx∗+ξmaxf′x∗−fx∗f′x∗−fx∗+ξmaxf′x∗−fx∗s.t.aji≥0,aji=0or1ny=ϕ∑j=1rayj.The approximate optimal solution is obtained through genetic algorithm, and the final optimal solution is obtained through repetition.


## 3.4. Parking Lot Location Guidance Algorithm Based on Dijkstra Algorithm

Generally speaking, Dijkstra’s algorithm uses an adjacency matrix for storage. The adjacency matrix stores the relationship between each node. However, considering the actual situation of urban roads, although there are many nodes in the road graph, there are few directly connected points. Therefore, the actual road graph is a sparse graph, and the corresponding adjacency matrix is also a sparse matrix. Therefore, if the adjacency matrix is used to store the nodes, a lot of space will be wasted.In this paper, the adjacency list is used to replace the adjacency matrix, which can reduce the space complexity of the algorithm. The comparison of the two storage methods is as follows:If it is assumed that there areb nodes in the graph G=V,E, then its adjacency matrix A is a symmetric matrix.IfG is an unweighted graph, its adjacency matrix can be expressed as(26)Ai,j=1,Vi,Vj∈EG,0,Vi,Vj∉EG.We believe that the actual city road map is an undirected weighted map. In the adjacency matrix ofG=V,E, the elements are(27)Ai,j=ωij,Vi,Vj∈EG,0,Vi,Vj∉EG&i=j,∞,Vi,Vj∉EG&i≠j.That is, the element on the symmetry line of the adjacency matrix is 0, whereωij is the weight between two points, and ∞ represents that i and j are not connected. A typical undirected weighted graph is shown in Figure 5:Figure 5
A typical undirected weighted graph.The adjacency matrix is(28)A=012310∞42∞053450.On the one hand, the storage space of the adjacency matrix is only related to the number of nodes and containsn2 elements in total. However, since the adjacency matrix is mostly a sparse graph, a lot of space is wasted. On the other hand, the time complexity of the Dijkstra algorithm using the adjacency matrix storage method is On2, and the time cost is too large.The adjacency list is a very useful storage structure for sparse graphs. All the nodes in the graph are stored in a one-dimensional array, and then the edge with it as the end point is linked after each node to form a linked list. The linked list node is composed of three parts: the start point, the end point, and the weight of the edge. As shown in Figure6, v0 is a three-way intersection, and there are 3 sides with it as the endpoint. Then, we can build a singly linked list connecting these 3 edges and then connect it to v0.Figure 6
vo example diagram.Figure7 is stored as an adjacency list as follows:Figure 7
Adjacency list of undirected weighted graph.The adjacency table storage requires onlyn + m storage units, far less than n2.From the perspective of space complexity, the adjacency table only needsn+2m storage units, while the adjacency matrix requires n2, and the storage efficiency advantage of the adjacency table is significant. In terms of time complexity, the complexity of the adjacency list Om+n is also much lower than the complexity of the adjacency matrix On2.In the research process, the graph is regarded as a plane graph, and the shortest path value from the temporarily marked node to the starting node and the Euclidean distance to the target node are added, and this value is regarded as the characteristic value of the marked node. In the selection process of permanent marked nodes, it is necessary to use this value as a theoretical basis to select among the set of temporary marked nodes, and permanent marked nodes can select the smallest temporary node of this value. This method can ensure that the target node can be found more accurately and quickly through the Dijkstra algorithm, and the search efficiency can be improved.Through the above algorithm, the premise of determining the permanent mark point is that the above two values add to the minimum value. The concept of an ellipse here is a trajectory corresponding to a point in the surface where the distance betweens and t is added to a constant 2c. Among them, the point p is located on the trajectory, and the distances to the two points s and v are dsp and dtp, respectively, then dsp+dtp=2c can be obtained. Through this traversal method to find the shortest path method, the end point and the meta point can be regarded as two focal points, which can be regarded as a concentric ellipse. Before Dijkstra algorithm is optimized, the corresponding search process is shown in Figure 8:Figure 8
Classic Dijkstra algorithm.After Dijkstra algorithm is optimized, the corresponding search process is shown in Figure9:Figure 9
The optimized Dijkstra algorithm.If nodesv1 and vk are both temporarily marked nodes, s is the starting node, and t is the target node. It can be seen from Figure 10 that d1 and dk are the shortest path lengths between v1 and vk and s, respectively, and D1 and Dk are the Euclidean distances between v1 and vk and t, respectively. The Euclidean distance between v1 and vk is C.Figure 10
Schematic diagram of optimized Dijkstra algorithm.In the Dijkstra algorithm before optimization, in terms of selecting marked nodes, ifd1>dk, the marked node selects vk, otherwise it is v1. After the algorithm is optimized, if d1+D1>dk+Dk, then mark the node selects vk, otherwise it is v1.In summary, the search range of the latest algorithm is an ellipse. After optimization, the search efficiency is improved and the number of traversed nodes is reduced.The ellipse limits the range of the search area, see Figure11 for details. s is the starting node, v1 is the boundary node, t is the target node, and 2a is the maximum limit distance. The Euclidean distance between s and v1 is denoted by sv1, and the Euclidean distance between v1 and t is denoted by v1t, and the specific search range is sv1+v1t<2a. If sv1+v1t>2a, then these nodes can be ignored in the algorithm. The reason is that the distance traveled by s from v1 to t is greater than 2a. In this way, an ellipse is formed, the ellipse is composed of all nodes that meet the condition of sv1+v1t=2a, the focus is s and t, and the major axis is 2a.Figure 11
Search range restricted by ellipse.In summary, the parameters are set as follows:s and t are selected for the ellipse focus, and λ|st| is selected for the length of the major axis. The Euclidean distance between s and t is represented by st, and the confidence coefficient is λ.In the process of setting parameters, the main purpose is to find a more reasonable long axis, that is, to calculate the most reasonableλ, and get the desired ellipse search interval.The principle of findingλ: among the passing road network nodes, a group of nodes with strong representativeness is selected, and the starting node set and the target node are formed by multiplying A and B, which is the C composed of A and B of the required shortest path. C is also a set, that is,(29)C=A×B=a,b|aEAαbeB.Among them, the starting node is represented byal, the target node is represented by bl, the Euclidean distance between the two is represented by Ealbl, and Palbl is the specific value of the shortest path. Through λi=Palbl/Ealbl, λi can be obtained. Regarding what kind of data is selected, the coefficient size of the specific ratio is obtained, and it is expressed in the form of a set, which is Γ. By studying the elements in it, λ0 is obtained. Then, at λi≤λ0, the confidence level is 95%. Then, λ0 is the specific coefficient size, so the size of the major axis can be obtained: 2a=λ0st.It can be seen from Figure12 that s belongs to any element in A, t belongs to any element in B, λ=Pst/Est, and the shortest path between s and t is represented by Pst, which is s⟶v1⟶v2⟶v3⟶⋯⟶t. The Euclidean distance between s and t is denoted by Est. In the process of calculating λ, Est is divided into segments, the number is n, and any segment is denoted as Est1=Est2=⋯=Est=Estni=1,2,3,…,n. According to the situation of segmentation, Pst is also segmented, the number is also n, and any segment is Pst1=Pst2=⋯=Psti=Pstni=1,2,3,…,n, and there is Psti=Esti/cosθi.Figure 12
Schematic diagram of the research on the rule ofλ value.The calculation process ofλ is(30)λ=PstEst=Pst1+Pst2+⋯+Psti+⋯+PstnEst=1n1cosθ1+1cosθ2+⋯+1cosθn=1n∑i=1n1cosθi.In urban roads,θi generally takes a value on 0,π/4. The following three cases discuss the value of λ:(1)
Ifs and t have a relatively close distance, n has a smaller value. In order to prevent the shortest path from being found in the search range and to ensure that all valid nodes are included in the ellipse range, the maximum value of λ can be selected at this time.(31)λmax=1n∑i=1n1cosθi=1n⋅n2=2.(2)
Ifs and t have a very long distance, n is infinite. On 0,π/4, θi conforms to a uniform distribution, then λ is(32)λ∞=∫0π41cosθ4πdθ=4πlnsecθ+tanθ|0π4=4πln2+1≈1.122.(3)
Ifs and t have a longer distance, n has a larger value, and λ basically conforms to the normal distribution, then Nμ,σ2/n, and the specific formula is(33)μ=E1cosθ=∫0π41cosθ4πdθ≈1.122,σ2=D1cosθ=E1cos2θ−E1cosθ2=∫0π4sec2θ4πdθ−∫0π41cosθ4πdθ2=4π−4πln2+12≈0.01412.It can be seen that the larger the value ofn, the more normal distribution is obeyed. Therefore, in order to obtain more accurate data results, this paper chooses the ellipse with the largest area, then λ = 1.414. Moreover, when there is a long distance between s and t, when the study is conducted from the perspective of normal distribution, according to the confidence level query, the confidence level reaches 95%.The performance analysis of the ellipse search algorithm is as follows:(1)
Algorithm validity analysisIn this regard: the main focus of attention is running time. The search range of the Dijkstra algorithm before optimization is(34)SDiksrva=πr2=πλ+12st2.The search range of the ellipse restricted area algorithm is(35)Sllipse=πab=πst2x2−1st2.(2)
Reliability analysis of the algorithmThe so-called reliability is to ensure that the path found belongs to the shortest path.In a specific road network, nodes do not exist alone and have strong connectivity. There are basically paths connected between two points. If there is a small straight-line distance between the starting node and the target node, it will have a relatively small distance. The traversal range is small, and the path to China Unicom may not be found. In order to avoid this problem, in the research process of this paper, the eccentricity selected by the ellipse algorithm is the largest, that is, the ellipse area is the largest.In summary, in the case ofλ = 1.414, the confidence level is 95%, that is, only 5% may not be able to find the required shortest path.(3)
Algorithm applicability analysisIn the application process of the ellipse search algorithm, the search range is limited, the work efficiency is improved, and the traversal time is reduced. However, in order to make it clear that all newly appearing nodes are within this range through this method, it is necessary to perform many operations of product and square root extraction, so it takes a lot of time.The algorithm flow isThe first step is to initialize the data. The algorithm clarifiess and t and calculates the straight-line distance st between them based on their latitude and longitude calculations.The second step is to define the ellipse area. The focus iss and t, λ=1.414, from which the eccentricity can be known, and the elliptical area can be obtained.The third step is to select the breadth-first search method to find the node and compare the value of the sum of the Euclidean distance between the node tob and t with the length of the long axis of the ellipse. If sv1+v1t<2a, then this node is included in the area.The fourth step is to find the shortest path st in the ellipse interval using Dijkstra’s algorithm and then terminate the algorithm.Through the understanding of the algorithm of the ellipse restricted search area, it is found that the calculation process has a slower speed, takes more time, and has lower work efficiency. Therefore, the algorithm is analyzed and researched. In the calculation process of the rectangular restricted search area algorithm, the required result can be obtained without a lot of calculation, and it has a good effect. The algorithm mainly calculates the circumscribed rectangle of the ellipse area and treats it as a restricted search area, so it achieves the effect of reducing the calculation amount of the algorithm.The specific content is shown in Figure13. s is the starting node, t is the target node, and the ellipse equation can be described by s,t,λ. In this process, in order to make the calculation easier, the center of the ellipse is assumed to be the origin of the coordinates, and the two focal points of the ellipse are above the g axis, then the coordinates −xs,0 of s and the coordinates xt,0 of m are obtained, and xe=xt=c.Figure 13
Schematic diagram of ellipse algorithm coordinates.The elliptic equation is(36)x2a+y2b=1.The parametric equation is(37)x=acosθy=bsinθθ∈0,2π.In the above formula,c2+b2=a2,a=λc.The elliptic equation is used to derive the derivative of x:(38)y′=−b2a2xy.As shown in Figure13, when a point x0,y0 is taken, the tangent equation is(39)y=−b2a2xyx−x0+y0.Whenm=−b2/a2x0/y0, the tangent equation is(40)y=mx±a2m2+b2.Then the distance between the two tangents is(41)d1=2a2m2+b2m2+1.As shown in Figure14, we take a point x1,y1 and its tangent is(42)y=−1mx±a2m2+b2.Figure 14
Comparison of ellipse and rectangular restricted areas.Then the distance between the two tangents is(43)d2=2a2+b2m2m2+1.If the ellipse has a circumscribed rectangle with the smallest area, then the formulas (38) and (40) can be used to obtain Srectangle:(44)Srectangle=d1⋅d2=4a2m2+b2⋅a2+b2m2m2+1.It can be seen from the above formula that ifm2 is equal to 0, that is, in the case of m=0, the ellipse has a circumscribed rectangle with the smallest area. If the tangent line passes through x0,y0, it is parallel to the axis, and if the tangent line passes through x1,y1, it is parallel to the axis.Ifm=0, that is, in the case of θ=kπ/2k=0,1,2,3,…, the area of the rectangle is the minimum:(45)Srectargle=4ab=4λλ2−1st2.Ifm=1, that is, in the case of θ=π+2kπ/2k=0,1,2,3,…, the area of the rectangle is the maximum:(46)Srectargle=2a2+b2=22λ2−1st2.It can be seen from Figure14 that the figure can be obtained as a standard ellipse rotation. The rotation angle is θ, and it translates xc and yc in the x and y directions, respectively. The elliptic equation can be obtained by the coordinate values of s and t:(47)x−xccosθ+y−ycsinθ2a2+−x−xcsinθ+y−yccosθ2b2=1.In the above formula,c2+b2=a2,xc=xs+xt/2,yc=ys+yt/2,θ=arctanyt−ys/xt−xs. x and y:(48)xm=xc±a2cos2θ+b2sin2θ,ym=yc±b2cos2θ+a2sin2θ.By reduction, the boundary of the rectangular area is obtained:(49)xm=xc±stλ2−sin2θ,ym=yc±stλ2−cos2θ.Then, the area of the rectangular area isSrectargle∈4ab,2a2+b2Performance analysis of rectangle search algorithm:


### 3.4.1. Algorithm Validity Analysis

If the area of the rectangle is the smallest, the ratio of the search area of the rectangle and the ellipse is(50)SrectargleSellipse=4abπab≈1.27.If the area of the rectangle is the largest, the ratio of the search area of the rectangle and the ellipse is(51)SrectangleSellipse=2a2+b2πab=4λ2−2πλλ2−1.


## 3.4.1. Algorithm Validity Analysis

If the area of the rectangle is the smallest, the ratio of the search area of the rectangle and the ellipse is(50)SrectargleSellipse=4abπab≈1.27.If the area of the rectangle is the largest, the ratio of the search area of the rectangle and the ellipse is(51)SrectangleSellipse=2a2+b2πab=4λ2−2πλλ2−1.


## 3.5. Parking Space Reservation Module

After the user finds the target parking lot, he may need to make a parking space reservation. Generally speaking, there are two ways to make a reservation: reserve a parking lot or reserve a parking space. The following is an analysis of possible reservation methods: (1) reserve a parking lot with precise reservation: if the reservation method provided to the parking lot of the parking lot means that it cannot fully guarantee that the user will leave a space for reserved vehicles after driving to the parking lot. Therefore, scientific traffic forecasting is required to ensure that a certain number of reserved vehicles arrive at the time of arrival. It can also guarantee a certain parking space. The calculation process of this method is too complicated, and for the peak parking period, the supply is often in short supply. Therefore, it is difficult to realize the reservation behavior of reserved parking. Fuzzy reservation: the parker makes a reservation for a fixed parking time. The parking lot guarantees that the parking space is free at the scheduled time and will not be illegally occupied. In order to ensure the above effects, it is necessary to ensure that there is a certain amount of vacant parking spaces that can be turned over. The berth cannot be used at the highest efficiency. (2) Precise reservation of the reserved parking space: the parking space and the start and end time are accurately reserved by the parker. The system needs to have parking space status detection equipment and parking space occupancy equipment. But for CBD commercial buildings, hospitals, and other areas, parking behavior is of high frequency and changeable. A parking person may delay parking and affect the next scheduled parking person to park the vehicle. Therefore, this kind of contradiction is difficult to solve, so stop. Accurate prediction of the position is not feasible. Fuzzy reservation + precise reservation: fuzzy means that you do not book an accurate parking start time, and precision means that the object of pleasure is the parking space. When a parker chooses a predetermined behavior, the general understanding is that the parker is worried that it is difficult to find a parking space within the arrival time or that the parking space best meets the user’s expectations and wants to book in advance. Therefore, the system adopts this method. Specifically, the user has reserved a parking space in a parking lot, and since the reservation, the user’s billing starts. In order to balance the user’s affordability and the parking revenue, the reservation fee is set as 50% parking fee, the strategy can be optimized in the future, such as different charging standards in different time periods. In summary, only the fuzzy reservation + precise reservation mode for parking spaces is suitable for this system. Parkers can decide whether to reserve a parking space based on the predicted number of empty parking spaces mentioned in the previous chapter and their own needs. If there is a reservation in this mode, the reservation function can be designed with reference to the reservation business process, as shown in Figure15:Figure 15
Business process of parking space reservation.When the user clicks on a parking lot in the reservation module, he enters the parking space reservation details page. The module has a parking space map of the parking lot, and the parking space map indicates the best parking space recommended by the system. The most important factor in the problem of the best parking space in the parking lot is the parking distance, which can be regarded as the shortest path problem (other factors have a weak influence and are not considered for the time being). That is to find the minimum value of stopping distance + driving distance away, so the shortest path algorithm is used to calculate the parking space and guidance path of the shortest path. This module can greatly improve the decision-making efficiency of parking seekers.Suppose the entrance of the parking lot isE and the exit is S. If a certain free parking space is Pii=1,2,…,n, the shortest path corresponding to the entrance process is pathE,P, and the shortest path corresponding to the exit process is pathpi,s.Then the entire shortest path length corresponding to the parking space isdpathE,pi+pathpi,sThe shortest path length corresponding to the best parking space can be described asmindpathE,p1+pathpi,s,dpathE,p2+pathp2,s,…,dpathE,pn+pathpn,s.In other words, the core of this algorithm is to find the point and path of the minimum value ofdpathE,pi+pathpi,s.


## 4. Development and Design of System Software

Based on the design of the above-mentioned multisource traffic information collection and combination algorithm, the intelligent multisource traffic information collection combination optimization model is designed for the network design and software design of the multisource traffic information collection combination optimization model, to carry out the network design of multisource traffic information collection combination optimization mode. ZigBee network technology is used to build a three-layer structure model of multisource traffic information collection and optimization model, and ITU-TH.323 and IETFSIP network signaling is used for multisource traffic information collection combination optimization model network control, to design human-computer interaction module, to realize multisource traffic information collection combination optimization mode human-computer interaction response design, an to build in a single network environment multisource traffic information fusion and information dispatch center (Figure16).Figure 16
System network networking design.In the MVB bus control protocol and embedded environment, the software development and design of the multisource traffic information collection combination optimization model is realized, and the ZigBee, GPRS, and other network technologies are used to carry out the network design of the multisource traffic information platform. Under the B/S structure system, the network design of the multisource traffic information collection combination optimization model is carried out, the process management and bus scheduling are carried out under the MVB bus control protocol, the Sip protocol stack is used to establish the session protocol of the multisource traffic information platform, and SIP is called. The call interface is used to create an INVITE message, and the data source is wrote to the multisource traffic information collection and combination optimization model DataSet. during Web programming, ADO. NET is used to query, update, and database management of the large-scale multisource traffic information collection and optimization model. Through the above analysis, the software development and design of the system can be realized.The intelligent parking lot management system designed in this paper is mainly composed of parking lot server and mobile phone client. Communication methods include network communication based on TCP/IP protocol, Bluetooth communication, and Wi-Fi communication. The server uses a PC with Window 10 operating system as the socket communication and data storage device, responsible for socket communication with the mobile phone, and manages user information and parking lot information; adopts the ARM 6410-based development board as the core control of Bluetooth communication module, expand the Bluetooth module outwards, responsible for Bluetooth communication with mobile phones; use Wi-Fi routers to establish a local area network to simulate network communication between users and servers; and simulate the scene of opening the door when users arrive at the entrance of the parking lot. The mobile client uses a smartphone with Android operating system, equipped with Wi-Fi function, Bluetooth function, and GPS positioning function, etc. The Wi-Fi function is used to detect Wi-Fi signals and communication within the local area network. The Bluetooth function is used to communicate with Bluetooth nodes in the parking space. GPS positioning is used to query the current position. The SDK provided by Baidu Maps gives the distance from the current position to the parking lot. The SDK provided by Baidu Maps gives the driving route from the current location to the entrance of the parking lot. The overall architecture of the intelligent parking lot guidance system designed in this paper is shown in Figure17.Figure 17
Overall system architecture.In order to prevent data loss during the communication process between the user and the server, this design adopts a connection-oriented and reliable TCP/IP protocol, and the communication process is implemented through the socket interface. The function of socket is mainly to provide an interface for data transmission between two different programs. Users only need to know the IP address and port of the server to establish a connection with the server and perform network communication. The workflow is shown in Figure18.Figure 18
TCP/IP protocol workflow.In this design, the user’s mobile phone first accesses the LAN Wi-Fi and automatically obtains an IP address. Establish a connection with the server through the server’s IP address and port. The establishment of each connection requires the server to open a new socket thread to receive the registration, login, query, appointment, and other requests sent by the client to the server after the server receives the request, Through the operation of inserting and modifying the database, realize the functions of user registration and appointment; through the query operation to verify the correctness of the user information. The server returns the request result to the user through the user’s IP address, as shown in Figure19.Figure 19
Schematic diagram of client accessing server.In this design, an independent Bluetooth node is installed in each parking space, and the Bluetooth node and the parking number are bound one-to-one and stored in the database. When the user receives the parking space address from the server, the Bluetooth on the mobile phone is automatically turned on and starts to detect the Bluetooth address on the parking space. Since the distance of Bluetooth communication is only within 10 m, when the user’s car reaches the parking space, the pressure sensor detects the pressure signal. After turning on the Bluetooth module, the mobile phone Bluetooth can search for the address of the Bluetooth module, which can ensure that the user will park the car in the correct parking space and will not match the Bluetooth in other parking spaces. The Bluetooth matching process adopts an automatic matching method. Automatic matching requires program control on the mobile phone. This can reduce the user’s operation on the mobile phone and improve the safety of the user’s driving. The Bluetooth composition block diagram of this system is shown as in Figure20.Figure 20
System Bluetooth composition block diagram.Figure21 is a schematic diagram of the entrance to the parking lot. According to the data, there is a negative correlation between Wi-Fi signal strength and distance. As shown in the figure, the distance between the user’s mobile phone and Wi-Fi is equal to the distance between the cars plus the length of the car, and the distance between the first car and the second car from the Wi-Fi is one car length plus the distance between the cars. Generally, the length of a family car on the market is about 4 meters to 5.5 meters. The signal strength difference caused by this distance difference is huge. Therefore, it is not possible for two users to detect the same Wi-Fi signal strength.Figure 21
Wi-Fi signal diagram at the entrance of the parking lot.The entire urban parking process can be represented as a circular ecosystem, as shown in Figure22, which consists of three parts and two processes. Among them, the three parts are parking users, parking lots, and parking space recommendation systems. Contains the following entities, parking drivers, vehicles, and various sensors on them, parking lot management systems and parking space detection equipment, and parking space recommendation systems. The two processes are data flow and traffic flow. The traffic flow occurs on the road where the driver is looking for a parking space and when the vehicle arrives or leaves the parking lot, which is represented by the yellow double-headed arrow in Figure 22; the data flow occurs during parking. The process of interaction between the user and the parking lot and the parking space recommendation system is represented by a black arrow in Figure 22. The parking space sensor or parking lot management system installed on the roadside uploads the collected real-time parking space data to the parking space recommendation system. The driving vehicle uploads its real-time position, speed, and other status data, and the parking space recommendation system processes the data into effective information, release information on the availability of parking spaces in each parking lot, drivers can obtain the latest parking information from smart terminals that exchange information with base stations and other transceiver platforms, and turn to the parking area they want, and then park. When the vehicle arrives or leaves the parking space, the parking space sensor updates the parking space available information and uploads the information to the driver looking for the parking space through the intelligent terminal. Considering that when there are many drivers looking for parking spaces in a certain area, they can all receive parking space availability information. It is very likely that competition for a certain free parking space resource will result in parking conflicts. Therefore, the system should have a reservation mechanism. The reservation mechanism includes the reservation of free parking spaces, the cancellation or recycling of reservation orders, etc. The reservation operation causes data flow between the driver, the parking lot, and the parking space recommendation system.Figure 22
Urban parking process.Recommending suitable parking lots and parking spaces for drivers with parking needs so that they can quickly find their own satisfactory parking spaces is the original intention of this research. From the above analysis and combined with the driver user use case diagram, it can be seen that the parking space recommendation system must have parking lot recommendation, parking space reservation, and order management after reservation. However, the realization of a parking application software for driver users requires some other functions, such as system login/registration, user information addition, etc. to be more complete. In addition, the analysis of the circular ecosystem formed by the above-mentioned urban parking process shows that the realization of the parking space recommendation system requires two key steps, namely, real-time data collection and management and parking-related services. Real-time data collection and management includes the collection and management of parking space data and vehicle data. Among them, data collection is the basis for the system to provide parking-related services. However, due to the different parking detection technologies used in the current parking lot, the parking lot application has not been unified. There is no unified standard for the data interface and exchange mechanism. The heterogeneity of parking space data makes the current parking application have a strong closedness, which has great limitations in data collection and use, and it is impossible to obtain more information. Comprehensive parking information provides users with good parking recommendations. At the same time, there are many types of user vehicles, and there are many types of sensors on them. Even sensors of the same type may have different data formats and transmission methods among vehicles, making it difficult to use vehicle data. The system needs to provide a processing method for raw data so that various heterogeneous data can be represented in the same way to support parking-related services. Therefore, the system should also have real-time data collection and management functions. In summary, the functions of the parking space recommendation system based on resource agents in this subject are proposed. The system function structure is shown in Figure23.Figure 23
System data function structure.


## 5. Simulation Experiment and Result Analysis

In order to test the application performance of the combined optimization model for multisource traffic information collection designed in this paper, software debugging and simulation experiments are carried out. The multisource traffic information collection combination optimization model provides users with a simple and unified system call interface. The packet size is set to 24 kB/s, the weighting factorw = 2.19, the traffic information collection time is 1025, and the size of combined sequence training group is 2100 parameters.According to the analysis results in Table1, multisource traffic information collection is combined, as shown in Figure 24, to test the access delay rate of traffic information collection combinations in various cache percentages.Table 1
System parameter settings.
Dispatching dataNumber of tasksPercentage of dynamic traffic collection combination (%)331–655414–33445133–51335651–6121Figure 24
is the access delay rate of the traffic information collection combination in various cache percentages.According to Figure24, the access delay rate of the traffic information collection combination using this method is low. The delay rate of the traffic information collection combination of various data scales is tested, and the test results are obtained as shown in Figure 25.Figure 25
Access delay rate of traffic information collection combinations under various data sizes.After analyzing the above simulation results, it is found that using this method, the combined accuracy of multisource traffic information collection is high, the degree of information fusion is improved, and the delay is low.


## 6. Conclusions

In this paper, the combination ability of dynamic traffic information is improved. According to the improved information data, on the basis of collecting multisource traffic information, an information data processing system is developed combined with genetic algorithm. The multidimensional nonlinear joint statistical methods can be used to multiperform multidimensional feature space combination in the complex traffic network environment. In order to construct a multisource traffic information combination model, the genetic algorithm can be used to effectively collect the original traffic data information. According to the high-dimensional feature quantity, the obtained multisource traffic information is fused and combined to carry out the distributed clustering of traffic information and the effective control of fuzzy directivity constraints. Finally, the combined optimization model of traffic information collection has a high degree of intelligence, accurate information collection, and low delay in this paper.



---

*Source: 3793996-2022-01-27.xml*