# Intelligent Planning of Tourist Routes Based on Cloud Computing and Marching Algorithm

Authors: Junli Lu
Journal: Security and Communication Networks
 (2022)

---

## Abstract

In order to improve the effect of modern tourism route planning, this article combines the cloud computing advancement algorithm to construct a tourism route intelligent planning system and combines the current people's tourism needs to carry out intelligent tourism route planning. Based on the fast forward algorithm of the program function equation, this article uses the fast forward algorithm to solve the discrete nonlinear program function equation and directly obtain the cloud computing data. In addition, the self-intersection phenomenon of the wave front must be considered when describing the characteristics of the cloud computing information field by using the process of the equivalent cloud computing information front expanding to the surrounding. Finally, this article constructs the intelligent system structure. The research results show that the intelligent travel route planning system based on cloud computing and marching algorithm proposed in this article can play an important role in modern smart tourism.


---

## Body

## 1. Introduction

With the development of society, the income of my country’s tourism industry has grown rapidly, and a growing theme of popularization of consumption, quality demand, globalization of development, industrial modernization, and internationalization of competition has emerged. As a kind of travel activity including cultural thoughts, cultural travel is not only beneficial to protect and develop various characteristic civilizations, enrich and improve the intrinsic and value of tourism products, but also help to accelerate the transformation and development of regional economic structure. At present, short-term vacations for short-distance travel and long-term vacations for long-distance travel have become popular travel methods. Because of this, the popular tourist attractions will be full every holiday, which will bring people an uncomfortable travel experience and cause overload to the destination. Moreover, with the improvement of the economic level, every family has a family car. In order to better experience travel, self-driving travel and self-guided travel have become the first choice for family travel.It is time-consuming and labor-intensive to plan a satisfactory travel itinerary only by tourists themselves to search and integrate massive information. However, now the major travel websites only provide a large number of travel products, strategies, and other information, and there is no entrance that can automatically plan travel routes according to the needs of tourists, and there is a lack of such services in the market.This article combines the cloud computing promotion algorithm to build a travel route intelligent planning system and combines the current people’s travel needs to carry out intelligent travel route planning to improve the efficiency of people’s travel.


## 2. Related Work

The team-oriented problem with time dependencies and time windows means given a set of nodes and the travel time between each pair of nodes, where each node is associated with profit, visit time, and time window, the goal is to find the starting node from the starting node. A fixed number of disjoint paths to a destination node, each not exceeding a given time limit, maximizing the total profit collected by visiting nodes in all paths without violating its time window. Literature [1] proposes two different methods to solve the above problems: (1) use precalculation to get the average travel time between all POI pairs, minus the time-dependent limit; and (2) add time-dependence to the travel time, but this method is based on the simplified assumption of periodic service time, which is not in line with the real urban transportation network. In addition, there are some TOP variants for simulating the tourist route planning problem. Considering more attributes of the problem or multiple constraints on different attributes, literature [2] introduced a heuristic algorithm for the TOP variant, and this algorithm applies two different priority rules when inserting nodes during driving and the algorithm is superior to other heuristic algorithms in terms of solution quality and execution time, and can obtain the optimal solution in the instance solved by the exact algorithm in a relatively short time; Literature [3] formulated a team orientation problem with capacity constraints and time windows, adding constraints on the availability of service nodes in a limited time, and using an integer linear programming solution method to obtain accurate solutions; however, this method is not suitable for real-time applications.In the tourism field, users usually share their own experiences and comments after a trip, forming a large amount of user-generated content including user comments, photos, check-in data, travel notes, and GPS tracks. The program offers great opportunities [4]. While there may be noise or bias in an individual review or travelogue, taking contributions from a large number of users as a whole can effectively capture the essence of an attraction. Therefore, more and more research studies use technologies such as spatial analysis and data mining to analyze these contents [5], obtain the relevant literatures and historical trajectory information of users, discover the similarity between tourists, and realize the recommendation of travel routes.As the number of GPS-equipped devices continues to grow, more and more trajectories are continuously generated and shared, changing the way people interact with the web. Based on this trajectory information, some application problems become feasible, such as travel route planning problem, GPS trajectory contains rich information, users can mine the time spent in one location, and the order of visits to different locations. This information can be used to mining popular attractions and general travel routes in a designated area to further improve route recommendation [6]. Literature [7] mines the user’s travel habits using the user’s historical GPS information and proposes two personalized travel route recommendation algorithms, which can consider the user’s personal literature when recommending and improve the degree of personalization of the recommendation results. (1) First, use the collaborative filtering technology to estimate the user’s travel behavior frequency, and then, generate a route that conforms to the user’s travel habits based on the Naive Bayes model. (2) In the process of route generation, the user’s cold start problem is considered, and the average value of the implicit factor vectors of all users is used as the implicit factor vector of users whose travel habits have not been mined; literature [8] integrates the user’s travel habits. It can better limit the length of the generated route to meet the user’s historical travel habits. The research in the literature [9] did not consider the sequence of the user’s travel habits nor the dynamics of the user’s travel, and there was a certain deviation in the rationality of the generated route results.Literature [10] proposed a route reasoning framework based on collective knowledge. First, given a location sequence and time span, popular route information is obtained by aggregating user photo data in a mutually reinforcing manner, and then, the route algorithm constructs a top-k route based on the user-specified query. Literature [11] uses a large collection of geo-tagged photos collected from Panoramio to propose a travel route generation algorithm that takes into account the time spent at each location, the total travel time, and user literatures. Based on the above shortcomings, the literature [12] uses user photo data and adds more contextual information to improve the accuracy of route recommendation results. Literature [13] uses geo-tagged photos to extract the semantic information of tourist attractions while mining user literature information and considers the user’s current context information, including spatiotemporal context information, social context information, and weather context information, when making recommendations. Based on the principle that there is a similarity in context when tourists visit scenic spots, Literature [14] proposes a heuristic-based context similarity calculation method, which can accurately describe the context similarity between users, so as to guide the users in the route. Contextual information is added to the recommendation process to provide users with more accurate recommendations.Literature [15] uses a multisource social media fusion method to integrate fragmented tourism information from multiple aspects to recommend routes to users. Use the method of information entropy to calculate the proportion of a word in a comment, so as to further obtain the proportion of a comment in all comments, remove the invalid comment information of the scenic spots, and take the order of the scenic spots in the travel notes as the user’s visit to the scenic spot sequence, and then use the sequence pattern mining algorithm to mine popular routes from user travel notes, and finally obtain the correlation between multisource information based on the similarity between user reviews and pictures of scenic spots and the popular routes mined from travel notes, and realize user route recommendation. In literature [16], a novel framework named ScenicPlanner is proposed for travel route recommendation using geo-tagged images and user check-in information in geo-location-based social networks. Literature [17] applied a heuristic algorithm to iteratively add road segments to maximize the total attractions score while satisfying user-specified constraints (including origin, destination, and total new travel distance); finally, through 3 real-world datasets, the efficiency and effectiveness of the framework are verified.


## 3. Cloud Computing Marching Algorithm

The program function equation is also known as the travel time field equation. Through this equation, it transitions to the category of geometric cloud computing, which greatly simplifies the elastic wave equation, and the problem of computing the cloud computing information field will be easier to deal with. However, the prerequisite for the transition from wave cloud computing to geometric cloud computing is that the wavelength of cloud computing information tends to zero; that is, it is applicable when the frequency tends to high frequency. Therefore, under the premise of high frequency, the elastic wave equation of longitudinal waves in isotropic medium can be expressed as the following formula [18]:(1)∇2ϕ−1v∂2ϕ∂t2=0.Among them,ϕ is the scalar potential function of the longitudinal wave, v is the speed of the longitudinal wave, and t is the time. The general solution form of the above formula is(2)ϕ=Aexp−iwTx+t,where A = A(x) is the amplitude, w is the angular frequency, and T is the isophase surface.Then, the functionϕ is the Laplace operator, which can be expressed as the following formula:(3)∇2ϕ=∇2Aexp−iwT+t−iw∇T⋅∇Aexp−iwT+t−iw∇A⋅∇Texp−iwT+t−iwA∇2Texp−iwT+t−w2A∇T⋅∇TexpiwT+t.The second derivative of functionϕ with respect to time t is calculated as(4)∂2ϕ∂t2=−w2Aexp−iwT+t.Substituting formula (4) into formula (3), we can get(5)∇2A−w2A∇T2−i2w∇A⋅∇T+wA∇2T=−Aw2α2.The above formula consists of real part and imaginary part. If the real part is taken and both sides of the equal sign are divided byAw2 at the same time, it can be obtained [19]:(6)∇2AAw2−∇T2=−1α2.Because the high-frequency assumptionw⟶∞ has been made, the function equation can be obtained:(7)∇T=s,where s = 1/v is the slow speed, and T(x) is the travel time of cloud computing information. When T is constant, T represents the wave front.The fast-advance algorithm systematically constructs the travel time of cloud computing information by adopting a narrowband method. The principle is roughly as shown in Figure1. In the figure, the black solid point area on the left side is the upwind area, also called the near area, the pink solid point area in the middle is the narrow band area, and the hollow point area on the right side is the downwind area, also called the far area. Points in the upwind area are receiver points, points in the narrowband area are narrowband points, and points in the downwind area are far points.Figure 1
Schematic diagram of FMM implementation.The implementation process of the fast forward algorithm can be vividly compared to “wind blowing wheat waves,” and all the grid points in Figure1 can be visually regarded as a wheat field, the wind travels from the upwind area to the downwind area, and the wheat waves dance with the wind.The specific update process of the wavefront expansion of the fast-marching algorithm on the grid nodes is shown in Figure2, where the black solid point is the receiving point, that is, the known travel time point. As shown in Figure 2(b), according to the basic idea of wavefront expansion of the fast-marching algorithm, the known travel time point is selected to calculate the travel time value of the unknown point in the upwind direction; that is, the travel time value of the four grid nodes near the epicenter is calculated using the upwind difference method. As shown in Figure 2(c), the four pink solid points at the upper, lower, left, and right sides of the hypocenter are regarded as the initial narrowband. It is necessary to select the minimum travel time point in the narrowband and change the attribute of this point from the narrowband point to the accepting point. As shown in Figure 2(d), the travel time of the surrounding points is calculated again with the newly changed travel time point as the accepted point attribute as the center. As shown in Figure 2(e), the minimum travel time point is selected again from all the expanded narrowband points, and its attribute is changed to the acceptance point. As shown in Figure 2(f), the above operations are repeated in sequence until all far points are calculated. In order to clearly and intuitively show the entire implementation process of the fast-marching algorithm, its flow can be summarized in Figure 3.Figure 2
Grid node update process of fast-marching algorithm.Figure 3
Implementation flowchart of fast-marching algorithm.The program function equation of formula (7) can be expressed as follows in the two-dimensional rectangular coordinate system [20]:(8)∂tx,z∂x2+∂tx,z∂z2=s2x,z,where t is the cloud computing information travel time and s is the slowness, that is, the reciprocal of the speed. Next, the upper wind difference method is used to replace the partial differential method in the functional equation; that is, the upper wind difference method is used to discretize formula (8), and its discrete expression can be expressed as follows:(9)Δt=maxDi,j−xt,02+minDi,t+x,02+maxDi,j−zt,02+minDi,t+z,021/2=si,j.The above formula is further simplified, and its simplified expression is(10)Δt=maxDi,j−xt,−Di,j+xt,02+maxDi,j−zt,−Di,j+zt,021/2=si,j.In the above formula,Dij+xt,Dij−xt represents the forward and backward difference operators of travel time t in the x-direction at point (i, j), respectively. Dij+zt,Dij−zt represents the forward and backward difference operators in the z-direction at point (i, j), respectively, for travel time t.It should be pointed out that the first-order upwind difference operator is [21](11)Di,j−xt=ti,j−ti,j−1Δx,Di,j+xt=ti,j+1−ti,jΔx,Di,j−zt=ti,j−ti−1,jΔz,Dij−zt=ti+1,j−ti,jΔz.The second-order upwind difference operator is(12)Di,j−xt=3ti,j−4ti,j−1+ti,j−22Δx,Dij−xt=3ti,j−4ti,j+1+ti,j+22Δx,Di,j−zt=3ti,j−4ti−1,j+ti−2,j2Δz,Di,j+zt=3ti,j−4ti+1,j+ti+2,j2Δz.The fast-marching algorithm is based on Huygens and Fermat's principles and uses the process of expanding the front of the equivalent cloud computing information. The self-intersection phenomenon of the wave front must be considered when characterizing the cloud computing information field. As shown in Figure4(a), if the cloud computing information encounters its gradient discontinuity in the medium propagation, there will be a dovetail phenomenon in front of the propagating wave. However, the upwind difference method can still guarantee the stability of solving (10) in this case. It can be seen from Figure 4(b) that the first-arrival wavefront obtained by the solution under the viscous limitation is not continuous. In Figure 4(c), the grey dots are known points (i.e., the travel time of this point is known), and the black dots are the points to be found (i.e., the travel time of this point needs to be obtained). The following will explain in detail how the upwind difference method is a viscous solution at the stable computing node Ti,j based on this figure:Figure 4
Schematic diagram of wavefront discontinuity and travel time of target point.
(a)(b)(c)In Figure4(c), we use the known travel time node information around the target point to calculate the travel time value at node Ti,j and use the first-order operator to solve (10). In the Q1 and Q2 regions, although the solved travel time value cannot yet fully meet the requirements for the first-order accuracy, its approximate value can be calculated by the two formulas Ti,j=Ti−1,j+δx⋅si,j and Ti,j=Ti+1,j+δx⋅si,j. At the same time, in the Q3 and Q4 regions, the information of the two travel time nodes is known, and the directly solved value fully meets the first-order accuracy requirements. In the Q3 region, the quadratic equation can be expressed as(13)Ti+1,j−Ti,jδx2+Ti,j−Ti,j−1δz2=si,j2.By solving the above formula, two solutions can be finally obtained. The larger value of the two is selected as the approximate value of the local wave front travel time. Similarly, the quadratic equation in the Q4 region can be expressed as(14)Ti,j−Ti−1,jδx2+Ti,j−Ti,j−1δz2=si,j2.Similarly, in the obtained two solutions, the larger value is used as the approximate value of the travel time in front of the local wave. Finally, the minimum value among these solutions is selected as the final result value of the travel time at pointTi,j. The fast-marching algorithm uses the upwind difference scheme to discretize the program function equation, which replaces the differential method to discretize the program function equation, and then simplifies the program function expression, and its expression is as follows:(15)Δt=maxDi,j−xt,−Di,j+xt,02+maxDi,j−zt,−Di,j+zt,021/2=si,j,where Dij−xt,Dij+xt,Dij+zt,Dij−zt represents the forward and backward difference operators of the travel time function t at the grid node (i, j) in the x- and z-directions, respectively. Since the use of difference operators of different orders will affect the accuracy of the fast-marching algorithm and also change the difference calculation formula, it is necessary to deduce the first-order and second-order difference operators and their calculation formulas that are commonly used in this algorithm in detail in this section.In the two-dimensional case, the travel time functiont(x, z) is a function of the spatial position coordinates (x, z), and the first-order partial differential operator of this function in its x- and z-directions can be expressed as ∂t/∂x,∂t/∂z, respectively. In the process of discrete operation, the partial differential calculation method can be replaced by the difference method, so that it can be approximated. First, we use a rectangular grid to perform gridding operations in the computing area. The coordinate positions of grid nodes are shown in Figure 5.Figure 5
Schematic diagram of grid node location and orientation.Next, we will use the Taylor series expansion method to derive the first- and second-order upwind difference operators. First, a difference operator in thez-direction is established at the target point (i, j), and then, the function t is expanded at the value of the point (i + 1, j) by Taylor series as(16)ti+1,j=ti,j+∂t∂z|i,jΔz+12∂2t∂z2|i,jΔz2+16∂3t∂z3|i,jΔz3+Λ.In the above formula,Δz is the grid spacing in the z-direction. After sorting it out, we get(17)∂t∂z|i,j=ti+1,j−ti,jΔz+oΔz,where boΔz is the first-order infinitesimal of the grid spacing Δz. If we ignore it, we get(18)∂t∂z|i,j≈ti+1,j−ti,jΔz.The right-hand term of the above formula is used to replace the backward difference operator corresponding to the partial differential term. At the same time, since the difference operator ignores the first-order infinitesimaloΔz of the grid spacing Δz when performing approximate calculation, the difference operator is called the first-order backward difference operator. According to the above analysis, the approximate first-order backward difference operator in the x-direction can be derived in the same way:(19)∂t∂x|i,j≈ti,j+1−ti,jΔx.According to the similar operations above, the first-order forward and backward difference operators of the travel timeT(i, j) of the target point in the x- and z-directions can be obtained:(20)Di,j−xt=ti,j−ti,j−1Δx,Di,j+xt=ti,j+1−ti,jΔx,Di,j−zt=ti,j−ti−1,jΔz,Dij−zt=ti+1,j−ti,jΔz.The second-order difference operator of the fast-marching algorithm will be derived below. Similarly, we first establish a difference operator in thez-direction at the target point (i, j). Then, the function t is expanded by Taylor series at the value of point (i + 1, j) as(21)ti+2,j=ti,j+∂t∂z|i,j2Δz+12∂2t∂z2|i,j4Δz2+16∂3t∂z3|i,j8Δz3+Λ.Then, through first-order Taylor series expansion (16) and first-order difference operator (20) deduced above, formula (21) can be simplified as(22)∂t∂z|i,j=−3ti,j−4ti+1,j+ti+2,j2Δz+oΔz2,whereoΔz2 is the second-order infinitesimal of the grid spacing Δz. If we ignore it, we get(23)∂t∂z|i,j≈−3ti,j−4ti+1,j+ti+2,j2Δz.The right-hand term of formula (23) is the backward difference operator used to replace the partial differential term. At the same time, because the difference operator ignores the second-order infinitesimal oΔz2 of the grid spacing Δz when it performs approximate calculation, so the difference operator is called the second-order backward difference operator. According to the above analysis, the approximate second-order backward difference operator in the x-direction can be derived in the same way:(24)∂t∂x|i,j≈−3ti,j−4ti,j+1+ti,j+22Δx.According to the similar operations above, the first-order forward and backward difference operators of the travel timeT(i, j) of the target point in the x- and z-directions can be obtained:(25)Di,j−xt=3ti,j−4ti,j−1+ti,j−22Δx,Dij−xt=3ti,j−4ti,j+1+ti,j+22Δx,Di,j−zt=3ti,j−4ti−1,j+ti−2,j2Δz,Di,j+zt=3ti,j−4ti+1,j+ti+2,j2Δz.Formulas (20) and (25) give the first-order and second-order upwind difference operators corresponding to the partial differential term, respectively. Using the same method as above, the difference operator of any order in the upwind difference method can be derived.Since the equations of the viscous solutions constructed by the difference operators of different orders will have different precisions and calculation formulas, we substitute the derived first-order and second-order difference operators into the simplified functional equation; that is, the expression isΔt=maxDi,j−xt,−Di,j+xt,02+maxDi,j−zt,−Di,j+zt,021/2=si,j. In the equation, the first-order and second-order difference calculation formulas of the travel time of the target point are continuously deduced.Then, for the first-order difference calculation formula, we takei,j,i,j+1,i+1,j as an example, and the position coordinates of these points are shown in the figure. We assume that the travel time value of the point i,j+1,i+1,j is known, the travel time value at the target point (i, j) is the target to be calculated, and the slowness values corresponding to these three points are set as si,j,si,j+1,si+1,j, respectively. Then, the travel time value at the target point (i, j) satisfies the first-order backward difference scheme in the x- and z-directions, and its expression is(26)∂t∂x=ti,j+!−ti,jΔx,∂t∂z=ti+1−ti,jΔz.Substituting formula (26) into the simplified Δt=maxDi,j−xt,−Di,j+xt,02+maxDi,j−zt,−Di,j+zt,021/2=si,j, the quadratic equation satisfied by the target point t(i, j) is(27)ti,j+1−ti,jΔx2+ti+1,j−ti,jΔz2=si,j2.We set the division grid spacing to beh=Δx=Δz (a square grid is used for illustration here), then the expression is(28)ti,j+1−ti,j2+ti+1,j−ti,j2=si,jh2.By arranging formula (28), we get(29)2ti,j2+2ti+1,j+ti,j+1ti,j+ti+1,j2+ti,j+12+si,j|+1h2=0.We solve (29) and select the larger value among the two calculated solutions, which is the first-order difference calculation formula of the travel time value at the target point (i, j), and the solution expression is(30)ti,j=ti+1,j+ti,j+1+2si,jh2−ti+1,j−ti,j+122.In the same way, the travel time calculation formula of thex- and z-direction nodes in the four direction nodes of the target point (i, j) can be calculated. To sum up, the first-order difference calculation formula of the travel time can be calculated by using the travel time values of the target point (i, j) at the node i±1,j,i,j±1 in the four directions of up, down, left, and right:(31)ti,j=ti±1,j+ti,j±1+2si,jh2−ti±1,j−ti,j+122,ti,j=ti±1,j+si,jhti,j=ti,j±1+si,jh.Special emphasis needs to be made here for the above formula. The travel time value of the target point (i, j) cannot be calculated and updated by the travel time value of the four nodes at the same time. The basic principle of narrowband expansion must be followed; that is, according to the direction of narrowband propagation expansion, the formula that satisfies the new law in equation (31) is selected to calculate the travel time value of the target point. Moreover, the minimum travel time point is selected in the obtained multivalued solution, which is the true travel time value at the target point (i, j). In addition, it should be noted that the average value of node slowness can be used as the final slowness value in formula (31), and this operation detail can further ensure the calculation accuracy and its stability.Similarly, for its second-order difference calculation formula, five points, namely,i,j,i,j+1,i,j+2,i+1,j,i+2,j, are selected for illustration. The position coordinates of the five points in the Cartesian coordinate system. We assume that the travel time value at node i,j+1,i,j+2,i+1,j,i+2,j is known, the travel time value at the target point (i, j) is the target to be calculated, and the slowness values corresponding to these five points are, respectively, set as si,j,si,j+1,si,j+2,si+1,j,si+2,j. Then, the travel time value at the target point (i, j) satisfies the second-order backward difference scheme in the x- and z-directions, and its expression is(32)∂t∂x=−3ti,j−4ti,j+1+ti,j+22Δx,∂t∂z=−3ti,j−4ti+1,j+ti+2,j2Δz.Substituting formula (32) into the simplified Δt=maxDi,j−xt,−Di,j+xt,02+maxDi,j−zt,−Di,j+zt,021/2=si,j, the quadratic equation satisfied by the target point t(i, j) is(33)−3ti,j−4ti,j+1+ti,j+22Δx2+−3ti,j−4ti+1,j+ti+2,j2Δz2=si,j2.The derivation process of the same-order calculation formula is similar. By solving formula (33) and selecting the solution with the larger value among the obtained multiple solutions, this value is the second-order difference calculation formula of the travel time value at the target point (i, j). The expression for its solution is(34)ti,j=4ti+1,j−ti+2,j+4ti,j+1−ti,j+2+8si,jh2−4ti+1,j−ti+2,j−4ti,j+1−ti,j+226.Among the above five points, the travel time at point (i, j) satisfies the second-order difference in one of the x- and z-directions. At the same time, when the first-order difference is satisfied in the other direction, the travel time calculation formula at the point (i, j) is different. When the point (i, j) satisfies the second-order difference in the x-direction and the first-order difference in the z-direction, the calculation formula of the mixed-order difference when walking at the point (i, j) is(35)ti,j=34ti,j+1−ti,j+2+4ti+1,j+213si,jh2−4ti,j+1−ti,j+2−3ti+1,j213.Similarly, when the point (i, j) satisfies the second-order difference in the z-direction and the first-order difference in the x-direction, then the travel time mixed-order difference calculation formula at the point (i, j) is(36)ti,j=34ti+1,j−ti+2,j+4ti,j+1+213si,jh2−4ti+1,j−ti+2,j−3ti,j+1213.Similarly, the travel time calculation formula of thex- and z-direction nodes among the eight direction points around the target point (i, j) can also be calculated. To sum up, the second-order difference calculation formula of the travel time can be calculated by using the travel time values at the node i,j±1,i,j±2,i±1,j,i±2,j in the eight directions around the target point (i, j) as formula (37).The fast-marching algorithm used in the final numerical simulation of this article is all based on the second-order difference calculation formula:(37)ti,j=4ti±1,j−ti±2,j+4ti,j±1−ti,j±2+8si,jh2−4ti±1,j−ti±2,j−4ti,j±1−ti,j±226ti,j=34ti,j±1−ti,j±2+4ti±1,j+213si,jh2−4ti,j±1−ti,j±2−3ti+1,j213,ti,j=34ti±1,j−ti±2,j+4ti,j±1+213si,jh2−4ti±1,j−ti±2,j−3ti,j+1213,ti,j=ti±1,j−ti,j±1+2si,jh2−ti±1,j−ti,j±122,ti,j=ti+1,j+si,jh,ti,j=ti,j±1+si,jh..The reverse tracing method calculates the ray path according to the characteristic that the cloud computing information always propagates in the direction perpendicular to its wave front, that is, parallel to the direction of the maximum gradient of its travel time field. The calculation idea of this method is to take the position coordinate of the receiving point as the starting point and calculate the ray path in the reverse direction along the gradient∇T direction of the travel time field until it ends at the source point.If it is assumed that the travel time value at the nodexi,zi is ti,j, and the coordinates of the node position are shown in Figure 6, then the derivative of ti,j in the x- and z-directions can be obtained by the central difference scheme, which is approximately as follows:(38)∂t∂x≈ti+1,j+ti+1,j+1−ti,j+ti,j+12h,∂t∂z≈ti,j+1+ti+1,j+1−ti,j+ti+1,j2h.Figure 6
Travel time field ray path.Among them,h is the grid spacing, so the incident angle of the ray at point xi,zi can be calculated, and its expression is(39)θk=tanh−1∂t/∂z/∂t/∂x+π.The above formula only expresses the case where the target node is on the grid. However, when the target point is not on the grid, such as point A in Figure6, the ray position at the next node must be determined by calculating the two angles a1,a2 in the graph. The formulas for calculating the two angles are as follows:(40)a1≈tanh−1zj+1−za/ha2≈tanh−1za−zj/h,where za represents the value of point A in the z-direction.Next, the search method will be introduced. According to Fermat's principle, it can be known that cloud computing information always propagates along its shortest time-consuming path in the underground medium. If the ray pathLSR from the source point S to the receiving point R is set to be the shortest path and the travel time corresponding to LSR is t(S, R), and the point P is any point on LSR, then the following formula holds(41)tS,P+tP,R=tS,R.The above equation is the travel time equation, and the search method is based on the travel time equation to find the minimum travel time path of the ray in a certain search area. For the convenience of expression, we set the search area as a functionD(P, n), where P in the function is the reference point in the search area, and n is the radius of the search area. Then, we take the source point R as the starting point to find a point A1 in D(P, n) that satisfies formula (39):(42)tS,A1+tA1,R−tS,R=minp∈DR,ntS,P+tP,R−tS,R.According to the above method, a section of pathLA1R is found, and then, the above operation is continued from point A1 as the starting point until the last point is at the source point S, and the calculation is ended. By connecting the calculated multi-section paths, the entire real ray path is obtained.


## 4. Intelligent Planning of Travel Route Based on Cloud Computing Marching Algorithm

In Figure7, the main feature is that an IaaS architecture of tourism cloud is laid out according to each user group of tourism, through which the virtualization of tourism resources can be realized. At the same time, the structure includes a schematic structure of the composition of the IaaS of the travel cloud, and a cloud computing model such as Amazon EC2 can also be rented according to the requirements of the travel cloud computing. Moreover, the energy consumption control mode of the travel cloud is also designed and laid out in this structure, as shown in Figure 8.Figure 7
Architecture of tourism cloud technology.Figure 8
The structure of the tourism cloud system.After constructing the above model system structure, the tourism data processing and tourism route intelligent planning of the system model are analyzed, and the results shown in the following Tables1 and 2 are obtained.Table 1
Evaluation of tourism data cloud computing processing effect.
NumData processing193.03291.80393.23488.74589.39687.02789.81892.08991.141087.471190.361289.201392.401487.861589.871687.451792.781890.801990.442090.692193.142293.382393.222491.232588.412689.922787.962890.182991.163090.463193.363288.413390.413490.503592.093688.413790.693890.053988.524089.824192.274292.364387.604489.564592.854687.154788.394892.814990.655087.695193.065293.065391.635490.905593.715692.455792.445892.725993.296093.566192.976292.126393.176489.026593.106690.73Table 2
Evaluation of the effect of intelligent planning of tourist routes.
NumTravel plan190.59285.48390.93485.25587.28690.44789.18888.05989.091084.231185.961286.911386.021483.531586.451689.711782.611885.201989.232088.412190.252288.922386.842485.492590.042683.662783.652887.882990.913085.313184.573286.083389.623486.703585.953685.363784.823886.763988.674090.664189.784290.614388.834487.824585.814688.854787.874889.884982.175088.075190.225286.145388.965485.615583.995685.245783.445882.045984.886085.306187.066286.146388.186485.896589.036686.47It can be seen from the above experimental research that the intelligent planning system of travel route based on cloud computing and marching algorithm proposed in this article can play an important role in modern smart tourism.


## 5. Conclusion

At present, there are many tourists in the travel community who have posted help posts about travel itinerary arrangements. They have some basic requirements for travel itinerary planning, such as destination, travel time, number of days to visit, group of visitors, and itinerary preferences. In fact, these needs can be met through intelligent search or personalized recommendation technology. However, in order to plan the best travel route for tourists, it is necessary to consider the user's preference, travel distance, time and cost, etc., which is a relatively complex problem. This article combines cloud computing and marching algorithm to construct an intelligent planning system for travel routes and analyzes the intelligent planning of travel routes based on the current people’s travel needs. The experimental results show that the intelligent travel route planning system based on cloud computing and marching algorithm proposed in this article can play an important role in modern smart tourism.



---

*Source: 8793392-2022-05-23.xml*