# Collaborative Optimization Model of Highway Network with Tourism Resources as the Target Node

Authors: Wei Niu
Journal: Mobile Information Systems
 (2022)

---

## Abstract

In order to improve the collaborative optimization effect of tourism resources and highway network, this paper combines deep learning algorithm to construct a collaborative optimization model of tourism resources and highway network, and adopts an algorithm based on continuous convex approximation. By iterating the optimal solution obtained each time, a high-quality approximate beamforming matrix and artificial noise covariance matrix can finally be obtained, which eliminates the problem that the traditional algorithm cannot solve the noise. Moreover, this paper introduces artificial noise to prove that the rank relaxation is compact by considering the corresponding minimization power problem. The simulation results show that the proposed scheme and approximation algorithm can obtain better system security and speed than the existing literature, and there are certain improvements compared with the traditional method, so the effectiveness of the method in this paper is verified by simulation experiments.


---

## Body

## 1. Introduction

The research on the interaction between the transportation system and the tourism system has always been a hot topic in the discussion of spatial geography. The continuous development of the expressway network, which is the key to the transportation system, has an increasingly obvious impact on the development of tourism resources, and the development of the tourism industry in turn promotes or restricts the extension of the expressway network.Through the analysis of the structural characteristics of the regional passenger transportation network, we locate the roles and functions of each tourism node in the passenger flow network and transportation network, and find out and identify potential traffic improvement nodes and tourism investment nodes. The operation effect of the entire regional highway network can be optimized, and the total social investment benefit can be maximized. This provides new ideas for highway planning and a theoretical basis for regional highway network planning decision-makers, to effectively save the travel time and travel costs of road travelers, improve travel satisfaction, and further increase the revisit rate of big tourist travelers.The main contributions of this paper are as follows: in the previous provincial expressway network planning, only the connectivity of major cities was generally considered, and the connectivity of tourist attractions was not included. With the continuous development of tourism and the improvement of the service demand of tourist attractions, the planning of high-speed tourist highways will become inevitable. In this paper, combined with deep learning, the tourism resources and the road network collaborative optimization model are linked, and it is hoped that the planned road network tourism resources’ demand will increase the most. From the point of view of network users (travelers), each user wishes to travel with the least amount of time or expense.In this paper, through this optimization method, this paper optimizes the allocation of tourism resources; at the same time, improves the operation efficiency of the highway network; and provides a strong support for the integration, development, and utilization of regional system resources.


## 2. Related Work

The research on tourism spatial structure is an extension of the research theory of regional spatial structure. The research on regional spatial structure accompanies the time course from the agricultural era to the industrial era. Foreign scholars have put forward the spatial structure theories divided by economic industries, such as agricultural regional theory and industrial location theory [1]. The regional spatial evolution structure of different grades of central places with decreasing scale from top to bottom under the constraints of different factors is proposed, that is, the principle of central places [2]. The study puts forward the growth pole theory, which holds that economic growth first occurs on the growth pole, and then spreads to the surrounding areas in different ways [3]. Taking increasing returns and monopolistic competition as analytical tools for the study of the regional spatial economy, he proposes the “center-periphery” theory [4], arguing that the spatial distribution pattern of economic activities will eventually reach equilibrium under the influence of agglomeration and dispersion.The research system of tourism geography is summarized [5]. It is proposed that the places where tourists gather, such as hotels and restaurants, can be used as a tourist bubble, which can be divided into the core area and the peripheral area, and tourism-influenced activities are mainly concentrated in the core area [6]. By analyzing the tourism spatial characteristics of the most important international tourism regions in South Africa, it is believed that tourism activities are mainly concentrated in a few regions and are concentrated [7]. The study found that the tourism fringe area is an important part of tourism development [8]. The “core-periphery” model of tourism space has been applied in many cases, and through the comparative study of the spatial distribution of the tourism industry, it is found that the tourism industry tends to be concentrated in the central cities [9].The study found that destination transportation cost and destination living cost are important influencing factors of tourism behavior [9]. The study analyzed that high-speed transportation infrastructure such as highways and high-speed railways (high-speed rail) can promote long-distance travel for tourists [10].The study believes that the lack of accessibility in India caused by aviation policy is an important factor hindering the development of tourism in India [11]. In terms of analysis methods for measuring the impact of transportation infrastructure on space, the accessibility analysis model is often used to measure the change in regional spatial pattern, and measurement indicators such as distance and weighted time are used to analyze the impact of transportation accessibility on the change in regional pattern [12].Foreign research on road network optimization problems is mainly reflected in the research on network design problems (NDP, network design problem). According to the different conditions of the road network optimization, the decision variables can be divided into continuous and discrete. For the improvement of road capacity, discrete variables correspond to the problem of new roads [13]. The type of decision variables in network design problems determines the type of optimization model to be constructed, so network optimization problems can be divided into three categories: continuous, discrete, and mixed according to the different types of variables [14]. Among them, the hybrid optimization design problem takes into account the problems of new road sections and reconstruction of existing road sections, which is consistent with the idea of road network optimization in practical engineering. However, since the hybrid problem involves two types of decision variables, the solution of its optimization model method design is the most difficult of the three types of models [15]. Road linearity, geographic conditions, etc. are the constraints [16]. We combined the discrete network design with road route selection optimization and established a two-layer optimization model for continuous route layout. From the perspective of macro planners, the model can optimize road network corridor selection and route layout at the same time [14]. A double-layer planning model for highway network lines is constructed, which takes into account factors such as expressway operation, earthworks, and line collinearity [17]. On the basis of considering travel demand, construction cost, and related soft factors, an optimization model of highway corridor layout is established. A variety of heuristic algorithms are used to solve the model, and it is found that the improved simulated annealing algorithm can better deal with the local minimum problem under low traffic demand [18].


## 3. Network Collaborative Optimization Model

The realization of the highway initial path generation based on deep reinforcement learning can solve the problem that the manually selected route cannot approach the optimal and provide the basis for the generation of the highway route path based on the deep reinforcement learning. It can promote the simulation of the model in this paper.As shown in Figure1, it consists of a source node, a legitimate destination node, K relay nodes, and M eavesdropping nodes. The source node tries to send confidential information to the destination node in the presence of M listening nodes. It is assumed that there is no direct link between the destination node and the source node, and all the information transfer between them needs to be completed by the relay node. Since there is information leakage in the two-hop link, all relay nodes are divided into two. The KR nodes used to transmit confidential information are called cooperative relays, and the KJ nodes used to generate interference signals to weaken the listening nodes are called interference relays, where KR+KJ=K.Figure 1
One-way AF relay network with multiple eavesdroppers.Here, we consider the scenario where eavesdropping nodes are also system users, but they do not have the right to receive services provided by the current source, such as pay TV services. Therefore, it is assumed that the global CSI (including the CSI of the eavesdropping node) is known, and all channels experience slow fading with flat frequency. Among them, the vectorf,gR∈ℂKR represents the channel from the source to the cooperative relay, and from the cooperative relay to the destination node, respectively. The vector gJ,hl∈ℂKJ represents the channel from the interfering relay to the destination node, to the l-th eavesdropping node, and there is HJ≜h1,…,hM.In the traditional secure relay network, the cooperative beamforming and cooperative interference techniques complete information transfer and signal interference within two time slots. In the proposed new transmission scheme, these two functions will be extended to three slots, so we will describe the transmission process with a three-slot transfer model.In the first time slot, that is, the broadcast stage in the relay two-hop, the source broadcasts a unit energy signals to all cooperative relays, and this signal will be monitored by the eavesdropping node at the same time. In order to interfere with the eavesdropping node listening to confidential information, the interfering relay generates a set of artificial noise locally and transmits the interference signal tJ. In this time slot, the signal containing the useful signal s received by the cooperative relay and eavesdropping node can be written in the following form, where the superscript indicates the serial number of the time slot in question.(1)yR=PSfs+nR,(2)yE,l1=PSh0,ls+hlTtJ+nE,l1,∀l∈M,In the above formula, for simple processing, the above artificial noise is designed in the null space of all cooperative relays and destination nodes, so as not to bring additional interference to them. If the interfering relay works in the receiving mode, the information security of this time slot completely depends on the cooperative relay. Similarly, using the idea of null space to design the beamforming weight vector at the cooperative relay can ensure that no information is leaked to the eavesdropping node.In the second time slot, that is, the relay stage in the relay two-hop, the cooperative relay adopts the AF-based cooperative beamforming strategy to forward the information of the source to the destination node. The received signal abouts involved in this time slot is only at the interfering node and the destination node.(3)yJ=GTtR+nJ,(4)yD2=gRTtR+nD2,The introduction of the third time slot is to allow the interfering relay to complete the transfer of confidential informations to the destination node. The difference is that the source emits the next useful signal with unit energy. The signal tJ at the interfering node is no longer only composed of artificial noise. It can be seen that all copies of the signal s can be received by the destination node only after the transmission of the above three time slots is completed.As mentioned earlier, the null-space design of artificial noise completely eliminates its influence on cooperative relays and destination nodes. Similarly, the useful signal partDyJv in tJ is designed in the null space of eavesdropping nodes and cooperative relays. In this way, on the one hand, information leakage is prevented, and on the other hand, the mutual interference between the two groups of relay nodes is avoided. Since only the reception containing the copy of the s signal is concerned, in the third time slot, there is only a received signal about s at the destination node.(5)yD3=gJTtJ+nD3=PSwTDfGDgJvs+nRTDwGDgJv+nJTDgJv+nD3For the confidential signal generated by the next source, its transmission mode is the same ass, which can be described by the above three time slots. It should be noted that tJ will always remain in the form of a mixed signal, as shown in equation (4). In the expression (2) of the signal received by the corresponding eavesdropping node, hlTtJ needs to be changed to hlTna. In the proposed transmission model, a signal is transmitted across three time slots. However, it can be easily analyzed that the broadcast stages of the two connected signals overlap, as shown in Figure 2.Figure 2
Time slot diagram.Therefore, the transmission efficiency of this scheme isN/2N+1, where N is the frame length. When the value of N is large, the transmission efficiency will tend to 1/2, which is the same as the traditional cooperative relay system. In addition, if the useful signal part in tJ is ignored, the scheme can easily degenerate into a situation that the traditional interference relay only sends artificial noise. Below, the above null space constraints on w,v, and na are summarized as follows.According to the above constraints of null space, in order to ensure sufficient spatial degrees of freedom, the selection of the number of cooperative relays, interfering relays, and eavesdropping nodes needs to satisfy two conditions:KR≥M+1 and KJ≥KR+M+1. When the vector z0,z1 and the covariance matrix Σ are given, according to the signal model in formulas (2), (4), and (5), the received signal-to-noise ratio at the destination node and the eavesdropping node can be calculated as follows:(6)γE,l1=PSh0,l2TrHlΣ+1,∀l,(7)γD2=z0HBz0z0HQRz0+1,(8)γD3=z1HA2HU0∗z0∗z0TU0TA2z1z1HA1HDU0∗z0∗z0TU0TA1z1+z1HQJz1+1.Therefore, the achievable safe rate can be defined as the following form:(9)Rsz0,z1,Σ=12minl∈ℳlog1+γD2+γD3−log1+γE,l1.In the formula,log⋅ represents the logarithmic function of base two, and the coefficient 1/2 is the approximate relay transmission efficiency when N is large. It should be noted that Rsz0,z1,Σ represents a certain transmission rate at which the destination node can decode the confidential information but the eavesdropping node cannot.This paper focuses on a joint beamforming and artificial noise design scheme based on safety rate maximization. First, the constraints of each relay’s own power are given, which can be obtained as follows:(10)EyR,iwi2=eR,iTCRU0z0z0HU0HeR,i≤P1,i,∀iEyJ,kvk+na,k2=eJ,kTCJU1z1z1HU1H+U2ΣU2HeJ,k≤P2,k,∀kIn the formula,eR,i∈ℂKR represents the unit vector whose ith element is one, eJ,k∈ℂKJ represents the unit vector whose kth element is one, and IKR represents the unit matrix whose size is KR. Meanwhile, P1,i and P2,k denote the own power budgets of the ith cooperative relay and the kth interfering relay, respectively.The goal of this scheme is to maximize the safe rate under the power constraints of each cooperative relay and interfering relay. The optimization problem after ignoring the constant $1/2$ can be expressed as follows:(11)maxz0,z1,Σminl∈ℳlog1+γD2+γD3−log1+γE,l1s.t.eJ,kTCJU1z1z1HU1H+U2ΣU2HeJ,k≤P2,k,∀keR,iTCRU0z0z0HU0HeR,i≤P1,i,∀iProblem (11) is nonconvex. It is difficult to solve. In order to simplify the problem, problem (11) is decomposed into two subproblems. First, z1 and Σ are not considered, and z0 is only optimized with the goal of maximizing γD2. The second subproblem utilizes the obtained z0,opt to optimize z1 and Σ according to the corresponding criteria. Such a decomposition undoubtedly results in a loss of safe rate performance, since z0,z1 and Σ cannot be jointly optimized. However, the subsequent simulation results prove that the above suboptimal solution can still achieve a good safe rate. The first subproblem can be expressed as follows:(12)minz0z0HQRz0+1z0HBz0,s.t.eR,iTCRU0z0z0HU0HeR,i≤P1,i,∀i,In order to solve the above problems effectively, problem (12) is first relaxed into a convex semidefinite program (SDP) with the help of semidefinite relaxation (SDR) and Charnes–Cooper transformation. By defining Z0≜ξz0z0H, and there is ξ>0, the semidefinite relaxation problem of problem (12) can be obtained as follows:(13)minZ0,ξTrQRZ0+ξs.t.TrBZ0=1TrU0HeR,ieR,iTCRU0Z0≤ξP1,i,∀iZ0≽0,ξ≥0.Problem (13) is a convex problem, so it can be solved directly by the toolkit SeDuMi or CVX based on interior point methods. Since problem (12) is relaxed into the form of problem (13), a semidefinite relaxation method is adopted, and the rank-one constraint of Z0’s nonconvexity is removed, so it seems that the two problems are not equivalent. However, through the following theorem, we will prove that the abovementioned rank relaxation is compact, that is, the only optimal z0,opt can be obtained from the matrix Z0.Theorem 1.
If it is assumed that problem (13) is feasible, and Z0,opt,ξopt is the optimal solution to problem (13), the rank of Z0,opt must be equal to one.Proof.
It can be seen that all problems in problem (13) are linear constraints. If Z0,opt is the optimal solution of problem (13), the optimal solution of Z0,opt and its dual problem satisfies the KKT condition. The KKT conditions related to the proof are listed as follows:(14)Y=QR−μ0B+∑i=1KRμiU0HeR,ieR,iTCRU0,(15)YZ0,opt=0,(16)Y≽0,Z0,opt≽0,μi≥0,∀i.
In the formula,μ0 and Y are the optimal dual variables corresponding to the equation constraints and Z0≽0 constraints in problem (13), respectively. μi is a dual variable corresponding to each node’s own power constraint. Problem (14) is substituted into problem (15), and we can get the following:(17)μ0BZ0,opt=U0HDHgRDgR+∑i=1KRμieR,ieR,iTCRU0Z0,opt
Among them,DHgRDgR+∑i=1KRμieR,ieR,iTCR≻0. is a full rank matrix. Therefore, the following conclusions can be drawn as follows:(18)rankZ0,opt=rankU0HDHgRDgR+∑i=1KRμieR,ieR,iTCRU0Z0,opt=rankμ0BZ0,opt≤rankB=1
Obviously,rankZ0,opt=0 is impossible because Z0,opt=0 is infeasible for the equality constraints in problem (15). Therefore, rankZ0,opt=1 must hold.
According to Theorem1, we can simply extract the optimal solution z0,opt of problem (12) from Z0,opt by eigenvalue decomposition. On the basis of obtaining z0,opt, the corresponding γD,opt2 can be calculated by substituting it into formula (6). After the solution to the first subproblem is known, the results that have been obtained are used to turn to the second subproblem, which is shown below as follows:(19)maxz1,00minl∈ℳlog1+γD,opt2+γD3−log1+γE,l1s.t.eJ,kTCJU1z1z1HU1H+U2ΣU2HeJ,k≤P2,k,∀k.
It can be seen that the objective function of problem (19) is in the form of the subtraction of two concave functions, and it is very difficult to solve it directly. In order to effectively solve the above problem, a slack variable τ is introduced. It aims to solve the original problem into an optimization problem with a two-layer structure. First, the inner layer problem is solved. For any feasible τ, the inner layer problem can be expressed as follows:(20)maxz1,Σ≽0log1+γD,opt2+γD3−log1τs.t.log1+γE,l1≤log1τ,∀leJ,kTCJU1z1z1HU1H+U2ΣU2HeJ,k≤P2,k,∀k.
Since the logarithmic function is monotonically increasing, it can be removed. After the specific expressions ofγD3 and γE,l1 are substituted, the following form can be further obtained:(21)maxz1,Σ≽0τ1+z1HA2HWopt∗A2z1z1HA1HDWopt∗A1+QJz1+1s.t.τPSh0,l2TrHlΣ+1+1≤1,∀leJ,kTCJU1z1z1HU1H+U2ΣU2HeJ,k≤P2,k,∀k.
In the formula, there isWopt∗≜U0z0,optz0,optHU0H. In the objective function of problem (21), the operation of ignoring γD,opt2 does not affect the solution of the entire optimization problem. This is because for any given τ,γD,opt2 is a constant. Similar semidefinite relaxation techniques and Charnes–Cooper transformations to the first subproblem are employed. In order to write problem (21) as a convex semidefinite program, first we set the following:(22)Z1=ηz1z1H,X=ηΣ
At the same time, the original maximization problem is rewritten in the form of minimizing the reciprocal of the original problem as follows:(23)minZ1,X,ηTrA1HDWopt∗A1Z1+QJZ1+ηs.t.TrU1HeJ,keJ,kTCJU1Z1+U2HeJ,keJ,kTU2X≤ηP2,k,∀kτη1+PSh0,l2+TrHlX<η+TrHlX,∀lτTrA1HDWopt∗A1Z1+A2HWopt∗A2Z1+TrQJZ1+η=1Z1≽0,X≽0,η≥0.
Since problem (23) is convex, its global optimal solution Z1,opt,Xopt,ηopt can be efficiently solved by SeDuMi or CVX toolkit. The problem now is that if Z1,opt is a matrix of rank one, the rank relaxation for the second subproblem is also compact. The optimal z1,opt can be directly obtained by eigenvalue decomposition of Z1,opt. In the following theorem, we will show that the relaxation for Z1,opt is also tight.Theorem 2.
If it is assumed that problem (23) is feasible, and Z1,opt,Xopt,ηopt is the optimal solution to problem (23), the rank of Z1,opt must be equal to one.Proof.
We setZ1,opt≠0 to be the optimal solution to problem (23). Since the constraints in problem (23) are all linear constraints, Z1,opt satisfies the KKT condition as follows:(24)−Ψ+1−ατA1HDWopt∗A1+QJ−ατA2HWopt∗A2+∑k=1KJλkU1HeJ,keJ,kTCJU1=0,(25)ΨZ1,opt=0,Ψ≽0,Z1,opt≽0,λk≥0,∀k,λk corresponds to the power constraints of each cooperating relay and interfering relay. Through the Lagrangian strong duality property, we can simply prove that the value of α is the value of the objective function of problem (23). This means that α must be positive.(26)11+γD,opt3τ=Φτ=α,1−ατ=1−11+γD,opt3>0.
In the formula,Φτ represents the optimal value of problem (23). By substituting problem (24) into ΨZ1,opt=0, the following formula can be obtained:(27)RZ1,opt≜1−ατA1HDWopt∗A1+QJ+∑k=1KJλkU1HeJ,keJ,kTCJU1Z1,opt=ατA2HWopt∗A2Z1,opt,
It can be seen thatR is a positive definite matrix R≻0, because it is the sum of a positive definite matrix and a positive semidefinite matrix. Then, we can get the following:(28)rankZ1,opt=rankRZ1,opt=ατrankA2HWopt∗A2Z1,opt≤rankWopt∗=1.
Likewise,rankZ1,opt=0 cannot appear because the equality constraint in problem (23) needs to be satisfied.
Theorem2 shows that problem (23) is indeed equivalent to problem (21). Meanwhile, the optimal solution z1,opt of problem (21) can be obtained by z1,opt=PZ1,opt/ηopt,Σopt=Xopt/ηopt. Among them, P⋅ represents the operation of taking the corresponding eigenvector.
For any givenτ, the inner layer problem has been optimally solved. To this end, we next turn our attention to the outer optimization problem. It can be seen that it is a univariate optimization problem.(29)minτΦτ1+τγD,opt2Φτs.t.τlb≤τ≤τub.
In the formula,τlb and τub represent the lower and upper bounds of log1+γE,l1≤log1/τ,∀l implied in the constraint τ, respectively. τ≤1≜τub can be obtained by carefully observing the feasibility of this constraint. Furthermore, an effective τlb>0 is derived from the following relation:(30)γE,l=PSh0,l2TrHlΣ+1<1τ−1<maxlPSh0,l2.
The expression about the lower bound can be obtained by sorting the following:(31)τ≥11+maxlPSh0,l2≜τlb.
Because problem (31) is a univariate optimization problem on a finite interval with interval lengths less than 1, many one-dimensional optimization techniques that require no derivatives can be used to search for an optimal solution to problem (31). In practice, in order to reduce the complexity, the golden-section search can be used, which guarantees that at least one local optimal solution can be found.
This section presents some simulation results to verify the safe rate performance of the proposed transmission strategy. Because the distance between the cooperative relay and the interfering relay is relatively short, it is assumed that the channel between them obeys the complex Gaussian distribution ofG∼CN0,10IKJ, and the rest of the channels obey the standard complex Gaussian distribution CN0,1. In the simulation, the average transmit power of the source is set to PS=20dB,PR, which represents the total power budget of the cooperative and interfering relays. As a comparison, we also simulate three existing traditional two-slot-based secure transmission schemes. In the first strategy, all KJ jamming relays only transmit artificial noise to jam eavesdropping nodes. In the second strategy, all relays (including KR cooperative relays and KJ interfering relays) use the null-space design to help forward confidential signals to destination nodes. In the third strategy, the operation of the relay node is the same as the second strategy. The difference is that the destination node will act as an interfering node in the broadcast phase, and the interference is transmitted to weaken the received signal quality at the eavesdropping node.
Figure3 presents the curves of the safe rate versus the total power budget PR for the proposed scheme and the other three schemes. The specific parameters are that each cooperative relay and the interfering relay have the same power budget, which is P1,i=P2,k=PR/KJ+KR. The number of cooperative relays is KR=5, the number of interfering relays is KJ=10, and the number of eavesdropping nodes is M = 3. Obviously, the proposed scheme shows the optimal safe rate performance at each power value. In addition, it can be seen from the figure that the second scheme will tend to a fixed value after the power continues to increase. This is because this transmission scheme does not protect the information leakage in the broadcast stage; the security rate will gradually reach a bottleneck.
Figure4 plots the safe rate curves of different schemes with respect to the source transmit power PS when there is KR=5,KJ=10,M=3,PR=25dB. As can be seen, the proposed transmission strategy exhibits the best performance. Moreover, with the increase in the transmit power of the source, the security rate will experience a process of first increasing and then decreasing. This is because when PS is relatively small, the source transmit power is increased, which can significantly improve the received signal-to-noise ratio of the destination node. When PS is larger, the information leakage of the first time slot will become more serious.
Figure5 illustrates the relationship between the security rate and the number M of eavesdropping nodes. In this simulation, PR=20dB,KR=10,KJ=20 is set. We note that in the proposed scheme, the selection of M needs to satisfy the M<minKR,KJ−KR=10 constraint to ensure that there are enough spatial degrees of freedom to design the beamforming weight vector. First, it can be seen that the proposed scheme exhibits obvious advantages when the number of eavesdropping nodes is much smaller than the number of cooperative relays and interfering relays. When the number of eavesdropping nodes gradually increases, the security rate of all schemes decreases. Within the limited value range of M, the proposed scheme still shows the best performance.
Figure6 considers the scenario of K=30,M=5,PS=20dB,PR=25dB, and shows the curve of the safe rate and the value of cooperative relay KR. Since there is M = 5, in order to ensure enough degrees of freedom in space, KR can take all the possibilities of the abscissa in the figure. As can be seen from the curve of scheme 3, since it assumes that all relays are used as cooperative relays, the allocation of the number of KR and KJ does not affect its safe speed.
However, for the proposed scheme and scheme 1, how to allocate the number of cooperative relays and interfering relays has an impact on the security rate. As can be seen from the figure, after the number of cooperative relays increases in scheme 1, the security rate has a significant improvement. Moreover, the proposed scheme is relatively stable over the entire range of possible values, with only a small downward trend. This shows that the proposed scheme does not need to think too much about how to distribute the relays. In addition, there is still a gap of about 0.6 bps/Hz between the optimal performance point of scheme 1 and the optimal performance point of the proposed scheme.Figure 3
Curve of safe rate versus total relay power budgetPR, KR=5,KJ=10,M=3,PS=20$$dB,P1,i=P2,k=PD=PR/KJ+KR.Figure 4
The curve of the safe rate with respect to the transmit powerPS of the source KR=5,KJ=10,M=3,PR=25dB,P1,i=P2,k=PD=PR/KJ+KR.Figure 5
The curve of the security rate with respect to the numberM of eavesdropping nodes.Figure 6
The curve of the safe rate with respect to the number of cooperative relaysKR and the number of interfering relays KJ allocation scheme.


## 4. Model Building

During the process of tourism resource development and road network construction, the travel (including tourists) will be affected. The game relationship between traffic travelers and planners is shown in Figure7.Figure 7
The game relationship between planning decision-makers and traffic travelers.Generally speaking, road tourism is a process in which tourists travel from the tourist source to the tourist destination and back through the road. In this paper, tourism resources are used as the nodes of the road network, which mainly include cities, core scenic spots, and scenic spots and scenic spots. It is necessary to break the circle or add edges to the tourist road network, and establish a reasonable and effective tourist road network with complete functions, as shown in Figure8(b). Corresponding tourist highway functions are classified as follows: urban hub-scenic area road (including the main line of tourism service and main line-scenic area tourist road), scenic area-scenic area tourist road, and scenic spot (scenic spot-scenic spot) tourist road.Figure 8
Schematic diagram of tourism and road network, (a) desired itinerary for tourist trips, and (b)schematic diagram of functional classification of tourist roads.
(a)(b)This paper analyzes the mechanism of the coupling system between tourist roads and resources. Moreover, on the basis of constructing the evaluation index system of the spatial coupling between the tourist road network and the tourist resources, this paper adopts the gray relational analysis method to quantitatively reveal the main factors and the degree of coupling correlation between the tourism road network and the tourism resource space from the perspective of time and space, so as to show the scientificity and rationality of the tourism road network layout planning based on the perspective of tourism resources. The coupling between the tourism road network and the tourism resource composite system is shown in Figure9.Figure 9
The coupling between the tourism road network and the tourism resource complex system.The coupling effect and optimization effect of the collaborative optimization model of tourism resources and highway network based on deep learning proposed in this paper are verified, and the experimental analysis is carried out in combination with the actual situation. The statistical simulation test results are shown in Figure10.Figure 10
Coupling effect and optimization effect of the collaborative optimization model of tourism resources and highway network based on deep learning.From the above research, it can be seen that the collaborative optimization model of tourism resources and highway network based on deep learning proposed in this paper can effectively promote the collaborative optimization of tourism resources and highway network.


## 5. Conclusions

The vigorous development of the economy has brought about the continuous improvement of people’s living standards. People’s demand for tourism activities is also showing a blowout development, whether it is a suburban trip or a long-distance trip, and even the number of foreign trips is increasing year by year. However, the premise of travel is that it needs good transportation facilities to support it. For this reason, the country is constantly improving the construction of infrastructure, especially the construction of transportation, and the annual increase in high-speed mileage ranks first in the world. While vigorously supporting the tourism industry, the country is also insisting on expanding its opening to the outside world, strengthening international economic cooperation, and creating new opportunities for the better development of the tourism industry. At this stage, the development of tourism has gradually transformed from the early single-point breakthrough and advanced development model to the development model of regional cooperation and system integration. Making development and optimization plans from the perspective of a single system can easily lead to repeated infrastructure configuration, and it is difficult to improve the level of resource utilization. Therefore, from the perspective of system coordination, it is necessary to realize the reconfiguration and combination of resources through the integration of the tourism system and the highway transportation system, so as to maximize the regional economic benefits. This paper combines deep learning algorithms to build a collaborative optimization model of tourism resources and highway network, verifies the dependence of tourism travel on the transportation network, and determines the potential development points of tourism resources in the network and the optimization and improvement points of the road network, so as to coordinate the tourism resources and the highway network. Optimization provides a reliable basis. The research shows that the collaborative optimization model of tourism resources and highway network based on deep learning proposed in this paper can effectively promote the collaborative optimization of tourism resources and highway network. In actual life, it can facilitate people’s travel, improve the convenience and comfort of tourism, accelerate the mining and promotion of local tourism resources, and drive the local economy to develop along with the green management model.



---

*Source: 8720801-2022-08-21.xml*