A personalized travel route planning method

Abstract

The application relates to the technical field of tourism route planning, and particularly discloses a personalized tourism route planning method, which comprises the following steps: S1, obtaining target point, avoidance point and passable point data; S2, constructing a Thiessen polygon network through the target point, the avoidance point and the passable point, and connecting the target points in sequence to obtain a reference path; S3, obtaining an initial path; S4, directly connecting the lines in the initial path to optimize the initial path; S5, screening out the connected avoidance points in the initial path, searching for a Thiessen polygon region adjacent to the avoidance point, deleting the line connected with the avoidance point in the initial path, connecting the searched Thiessen polygon regions in sequence to obtain an avoidance path, and connecting the two ends of the avoidance path with two breakpoints in the initial path after deletion, so as to complete the planning of the tourism route. The personalized tourism route planning method can improve the planning efficiency of the tourism route.

Description

Technical Field

[0001] This invention relates to the field of tourism route planning technology, and in particular to a method for planning personalized tourism routes. Background Technology

[0002] Personalized travel route planning is a specific application of TSP-related problems. It is widely used in logistics delivery, customized travel routes, and other fields. Its essence is to reach a certain number of target points while avoiding specific areas, and to reach all target points under constraints such as the shortest distance, the lowest cost, and the least time.

[0003] Personalized travel route planning is a typical NPH and NPC problem, which can be described as follows: given several target points and certain nodes along the route, the goal is to achieve the optimal route while avoiding specific nodes.

[0004] Compared to the classic multi-objective path problem, this problem has an additional interference factor: specific nodes must be avoided and the route must be optimal. It can be considered a more complex version of the classic multi-objective path problem, and therefore the difficulties in optimizing multi-objective path problems also apply. The computational complexity of current traditional algorithms far exceeds O(N!), making it difficult to achieve the minimization of personalized travel routes using existing thinking. Summary of the Invention

[0005] The present invention aims to solve at least one of the technical problems mentioned above, and to provide a method for planning personalized travel routes, which can improve the efficiency of travel route planning.

[0006] To achieve the above objectives, the technical solution adopted by this invention is: a method for planning personalized travel routes, comprising the following steps:

[0007] S1. Obtain data on target points, avoidance points, and passable points, and distribute the target points, avoidance points, and passable points on the same plane;

[0008] S2. Construct a Thiessen polygon network using target points, avoidance points, and passable points, and connect the target points sequentially to obtain the baseline path;

[0009] S3. Extract the Thiessen polygon regions traversed by the baseline path, and connect the target points, avoidance points, and passable points in the Thiessen polygon regions to obtain the initial path.

[0010] S4. When there are three adjacent regions of Thiessen polygons in the initial path, extract the initial path in the region to be optimized as the path segment to be optimized. If the Thiessen polygon in the middle of the path segment to be optimized is not the Thiessen polygon where the target point is located, then connect the Thiessen polygons at both ends of the path segment to be optimized.

[0011] S5. Filter the avoidance points in the initial path, take the Thiessen polygon where the avoidance point is located as the avoidance polygon, and delete the line connecting the avoidance point to the initial path. After deletion, two breakpoints are formed on the initial path. Take the Thiessen polygon where one of the breakpoints is located as the base polygon, and search for another Thiessen polygon that is adjacent to both the avoidance polygon and the base polygon as the selection polygon. If the selection polygon is adjacent to the Thiessen polygon where the other breakpoint is located, stop the search. If the selection polygon is not adjacent to the Thiessen polygon where the other breakpoint is located, use the selection polygon as the base polygon again and repeat the above search steps until the selected polygon is adjacent to the Thiessen polygon where the other breakpoint is located, then stop the search. Connect all the selected polygons in sequence to obtain the avoidance path. At the same time, connect the two ends of the avoidance path to the two breakpoints to filter the avoidance points. Filter all the avoidance points in the initial path to complete the planning of the travel route.

[0012] Preferably, in step 2, the reference path is obtained through the following steps:

[0013] S21. Construct a target point Thiessen polygon network based on the target points, so that all target points are covered in the constructed target point Thiessen polygon network;

[0014] S22. Search for any two adjacent Thiessen polygons in the Thiessen polygon network and connect the target points within the two Thiessen polygons with a line to construct the initial connection.

[0015] S23. Using the two adjacent Thiessen polygons that form the initial connection as the initial polygons, search for any Thiessen polygon that is simultaneously adjacent to the two initial polygons.

[0016] S24. Connect the two nodes of the initial connection to the nodes within the searched Thiessen polygon to obtain a triangle;

[0017] S25. Delete the initial connection of the triangle, and use the remaining two connections as the initial connections, then return to step S23.

[0018] S26. Repeat steps S23-S25 until all target points have been searched and the baseline path is obtained.

[0019] Preferably, in step S3, the target point, avoidance point, and passable point in the passed Thiessen polygon region are connected sequentially along the reference path.

[0020] Preferably, in step S5, if there are two avoidance paths to the avoidance point, the lengths of the two avoidance paths are calculated, and the shorter one is selected as the optimized path.

[0021] Preferably, the method for planning tourist routes is used for planar route planning.

[0022] The beneficial effects are as follows: Compared with the prior art, the personalized travel route planning method of the present invention does not consider avoidance points during path planning, but directly searches for the shortest path between target points, classifies and groups the problem, realizes the dimensionality reduction of complex multidimensional problems, and improves planning efficiency. At the same time, by forming the target point region through Thiessen polygons, the point avoidance is upgraded to non-intersecting surfaces, realizing the dimensionality simplification of line problems. Furthermore, through simple line and surface analysis, the part of the path that needs to be avoided is obtained, and through surface adjacency analysis, alternative solutions for this part of the path are obtained. The complexity of the problem is only related to the adjacent surfaces, that is, the degree of nodes, and the complexity is far below linear, avoiding the escalation of complexity due to the intertwining of problem dimensions. Attached Figure Description

[0023] The specific embodiments of the present invention will be further described in detail below with reference to the accompanying drawings, wherein:

[0024] Figure 1 A schematic diagram for obtaining data on target points, avoidance points, and passable points;

[0025] Figure 2 A schematic diagram for constructing a baseline path; a schematic diagram of search results without avoiding tourist routes.

[0026] Figure 3 A schematic diagram of the Thiessen polygon traversed by the baseline path;

[0027] Figure 4 A diagram illustrating the construction of the initial path;

[0028] Figure 5 This is an enlarged view of the optimized position in the initial path;

[0029] Figure 6 This is a schematic diagram of the optimized initial path;

[0030] Figure 7 This is an enlarged view of one of the selected avoidance points;

[0031] Figure 8 To search for and avoid Thiessen polygon regions adjacent to the point;

[0032] Figure 9 This is a diagram showing the connection between the initial path and the bypass path;

[0033] Figure 10 A diagram showing the results of searching all avoidance points and generating corresponding avoidance paths;

[0034] Figure 11 This is a magnified view of the filter point;

[0035] Figure 12 A schematic diagram showing the filter points after filtration.

[0036] Figure 13 This is a schematic diagram of the final tourism route planning result. Detailed Implementation

[0037] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of the present invention.

[0038] It should be noted that when a component is described as "fixed to" another component, it can be directly on the other component or may have a central component. When a component is described as "connected to" another component, it can be directly connected to the other component or may have a central component. When a component is described as "set on" another component, it can be directly set on the other component or may have a central component. When a component is described as "set in the middle," it is not simply set in the exact center, as long as it is not set within the area defined by both ends being in the middle. The terms "vertical," "horizontal," "left," "right," and similar expressions used in this document are for illustrative purposes only.

[0039] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention pertains. The terminology used herein in the description of the invention is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. The term "and / or" as used herein includes any and all combinations of one or more of the associated listed items.

[0040] The travel route problem is a typical NP problem, essentially a path selection to a destination point. It is a one-dimensional line problem in a multi-dimensional space, with the ultimate goal of choosing a line. The difference lies in the requirement to avoid a specific destination and to ensure the route is optimal. Selection is a logical concept, while a line is a connection between points distributed across a multi-dimensional space. This theoretically unifies the path problem in terms of points, lines, and planes.

[0041] Based on the fundamental thinking of problem-solving in natural sciences, discovering necessary conditions is often easier than discovering sufficient and necessary conditions. In other words, finding an initial solution is relatively easy and is a prerequisite for problem-solving. Optimization is the key and relatively difficult. Combining the two can achieve an optimized solution to the problem, which is also a common approach in engineering implementation. Based on this logic, this application discloses a method for planning personalized tourism routes, including the following steps:

[0042] S1. Obtain data on target points, avoidance points, and passable points, and distribute the target points, avoidance points, and passable points on the same plane;

[0043] S2. Construct a Thiessen polygon network using target points, avoidance points, and passable points, and connect the target points sequentially to obtain the baseline path;

[0044] S3. Extract the Thiessen polygon regions traversed by the baseline path, and connect the target points, avoidance points, and passable points in the Thiessen polygon regions to obtain the initial path.

[0045] S4. If the points in the Thiessen polygons passed through by the initial path are not the target points, and multiple Thiessen polygons are adjacent, then connect the lines in the initial path directly to optimize the initial path.

[0046] S5. Filter the avoidance points in the initial path, take the Thiessen polygon where the avoidance point is located as the avoidance polygon, and delete the line connecting the avoidance point to the initial path. After deletion, two breakpoints are formed on the initial path. Take the Thiessen polygon where one of the breakpoints is located as the base polygon, and search for another Thiessen polygon that is adjacent to both the avoidance polygon and the base polygon as the selection polygon. If the selection polygon is adjacent to the Thiessen polygon where the other breakpoint is located, stop the search. If the selection polygon is not adjacent to the Thiessen polygon where the other breakpoint is located, use the selection polygon as the base polygon again and repeat the above search steps until the selected polygon is adjacent to the Thiessen polygon where the other breakpoint is located, then stop the search. Connect all the selected polygons in sequence to obtain the avoidance path. At the same time, connect the two ends of the avoidance path to the two breakpoints to filter the avoidance points. Filter all the avoidance points in the initial path to complete the planning of the travel route.

[0047] like Figure 1 As shown, in one specific implementation, data samples of 15 avoidance points, 16 target points, and 169 passable points are obtained. Pentagrams represent avoidance points, triangles represent target points, and small dots represent passable points. These target points, avoidance points, and passable points are distributed on the same plane, as shown in the diagram. Figure 2 As shown, the 16 target points in the figure are connected sequentially to obtain the baseline path. In constructing the baseline path, the search method in the existing patent CN202111033680.3 can be used. Specifically, it includes the following steps:

[0048] S21. Construct a target point Thiessen polygon network based on the target points, so that all target points are covered in the constructed target point Thiessen polygon network;

[0049] S22. Search for any two adjacent Thiessen polygons in the Thiessen polygon network and connect the target points within the two Thiessen polygons with a line to construct the initial connection.

[0050] S23. Using the two adjacent Thiessen polygons that form the initial connection as the initial polygons, search for any Thiessen polygon that is simultaneously adjacent to the two initial polygons.

[0051] S24. Connect the two nodes of the initial connection to the nodes within the searched Thiessen polygon to obtain a triangle;

[0052] S25. Delete the initial connection of the triangle, and use the remaining two connections as the initial connections, then return to step S23.

[0053] S26. Repeat steps S23-S25 until all target points have been searched and the baseline path is obtained.

[0054] Then as Figure 3 As shown, the Thiessen polygon regions traversed by the baseline path are extracted, and the target points, avoidance points, and passable points within these regions are connected to obtain... Figure 4 The initial path shown can be connected sequentially along the order of the baseline path when connecting the target point, avoidance point, and passable point, as follows: Figure 5 and Figure 6 As shown, when there are three consecutively traversed Thiessen polygons in the initial path that form mutually adjacent regions to be optimized (i.e., any two Thiessen polygons in the three regions to be optimized are adjacent), the initial path in the region to be optimized is extracted as the path segment to be optimized. If the Thiessen polygon in the middle of the path segment to be optimized is not the Thiessen polygon where the target point is located, then the points in the Thiessen polygons at both ends of the path segment to be optimized are directly connected. The path after the direct connection does not need to pass through the non-target point located in the middle Thiessen polygon. Then, as... Figures 6 to 10 As shown, the process involves filtering out points in the initial path. During filtering, the Thiessen polygon containing one of the selected points is used as the avoidance polygon, and the line connecting it to that point in the initial path is deleted. This creates two breakpoints in the initial path. The Thiessen polygon containing one of these breakpoints is used as the base polygon. Another Thiessen polygon adjacent to both the avoidance polygon and the base polygon is searched for as the selection polygon. This search process is repeated until the selected polygon is adjacent to the Thiessen polygon containing the other breakpoint. All the selected polygons are then connected sequentially according to their adjacency to obtain the avoidance path. The two ends of the avoidance path are then connected to the two breakpoints to filter out the points. This method filters out all avoidance points in the initial path, completing the planning of the travel route. Figure 11 As shown, there is an avoidance path both above and below the avoidance point. Calculations show that the avoidance path above the avoidance point is shorter than the avoidance path below it. Therefore... Figure 12 As shown, delete the avoidance paths below the avoidance point, and keep the avoidance paths above the avoidance point. Following this method, optimize the paths at all avoidance points to obtain the final result. Figure 13 The path planning scheme shown.

[0055] Furthermore, it should be noted that the route planning method of this application is applicable not only to automatic planning via computer programming, but also to planar route planning via manual mapping.

[0056] The personalized travel route planning method of this invention does not consider avoidance points during path planning, but directly searches for the shortest path between target points. It classifies and groups the problem, realizing the dimensionality reduction of complex multidimensional problems and improving planning efficiency. At the same time, it forms the target point region by using Thiessen polygons, elevating point avoidance to non-intersecting surfaces, thus simplifying the dimensionality of line problems. Furthermore, through simple line and surface analysis, it obtains the part of the path that needs to be avoided, and through surface adjacency analysis, it obtains alternative solutions for this part of the path. The problem complexity is only related to the adjacent surfaces, that is, the node degree, and the complexity is far below linear, avoiding the escalation of complexity due to the intertwining of problem dimensions.

[0057] The above embodiments are only used to illustrate the technical solutions of the present invention and are not intended to limit them. Any modifications or equivalent substitutions that do not depart from the spirit and scope of the present invention should be covered within the scope of the technical solutions of the present invention.

Claims

1. A method for planning personalized travel routes, characterized in that, Includes the following steps: S1. Obtain data on target points, avoidance points, and passable points, and distribute the target points, avoidance points, and passable points on the same plane; S2. Construct a Thiessen polygon network using target points, avoidance points, and passable points, and connect the target points directly in sequence to obtain the baseline path; S3. Extract the Thiessen polygon regions traversed by the baseline path, and connect the target points, avoidance points, and passable points in the Thiessen polygon regions in the order traversed by the baseline path to obtain the initial path. S4. When there are three adjacent regions of Thiessen polygons in the initial path, extract the initial path in the region to be optimized as the path segment to be optimized. If the Thiessen polygon in the middle of the path segment to be optimized is not the Thiessen polygon where the target point is located, then connect the Thiessen polygons at both ends of the path segment to be optimized. S5. Filter the avoidance points in the initial path, taking the Thiessen polygon containing the avoidance point as the avoidance polygon, and deleting the line connecting the avoidance point to the initial path. After deletion, two breakpoints are formed on the initial path. Take the Thiessen polygon containing one of the breakpoints as the base polygon, and search for another Thiessen polygon that is adjacent to both the avoidance polygon and the base polygon as the selection polygon. If the selection polygon is adjacent to the Thiessen polygon containing the other breakpoint, stop the search. If the selection polygon is not adjacent to the Thiessen polygon containing the other breakpoint, repeat the above search steps with the selection polygon as the base polygon until the selected selection polygon is adjacent to the Thiessen polygon containing the other breakpoint, then stop the search. Connect all the selected selection polygons in sequence to obtain the avoidance path. At the same time, connect the two ends of the avoidance path to the two breakpoints to achieve the filtering of avoidance points. If there are two avoidance paths for an avoidance point, calculate the length of the two avoidance paths, and select the shorter one as the optimized path. Filter all avoidance points in the initial path to complete the planning of the travel route.

2. The method for planning a personalized travel route according to claim 1, characterized in that, In step S2, the reference path is obtained through the following steps: S21. Construct a target point Thiessen polygon network based on the target points, so that all target points are covered in the constructed target point Thiessen polygon network; S22. Search for any two adjacent Thiessen polygons in the Thiessen polygon network and connect the target points within the two Thiessen polygons with a line to construct the initial connection. S23. Using the two adjacent Thiessen polygons that form the initial connection as the initial polygons, search for any Thiessen polygon that is simultaneously adjacent to the two initial polygons. S24. Connect the two nodes of the initial connection to the nodes within the searched Thiessen polygon to obtain a triangle; S25. Delete the initial connection of the triangle, and use the remaining two connections as the initial connections, then return to step S23. S26. Repeat steps S23-S25 until all target points have been searched and the baseline path is obtained.

3. The method for planning a personalized travel route according to claim 1, characterized in that, The method for planning tourist routes is used for horizontal route planning.

Images