Personalized tour route planning method

Abstract

The invention relates to the technical field of travel route planning, and particularly discloses a personalized travel route planning method, which comprises the following steps of S1, acquiring data of a target point, an avoidance point and a passable point; s2, constructing a Thiessen polygon network through the target points, the avoidance points and the passable points, and sequentially connecting the target points to obtain a reference path; s3, obtaining an initial path; s4, connecting lines in the initial path are directly connected to optimize the initial path; s5, screening out connected avoiding points in the initial path, searching Thiessen polygon areas adjacent to the avoiding points, deleting connecting lines between the initial path and the avoiding points, sequentially connecting the searched Thiessen polygon areas to obtain an avoiding path, and respectively connecting two ends of the avoiding path with two breakpoints in the deleted initial path to obtain a connection line between the initial path and the Thiessen polygon areas; therefore, the travel route planning is completed. According to the personalized travel route planning method, the travel route planning efficiency can be improved.

Description

Technical Field

[0001] The present invention relates to the technical field of travel route planning, and in particular to a method for planning a personalized travel route. Background Art

[0002] Personalized travel route planning is a specific application of TSP-related problems. It is widely used in logistics delivery, travel route customization and other fields. Its essence refers to a certain number of target points, and specific areas must be avoided, and all target points must be reached under the constraints of shortest distance, minimum cost, and least time.

[0003] The personalized tourism route planning problem is a typical NPH and NPC problem, which can be expressed as: given a number of target points, passing through certain nodes, while avoiding specific nodes to achieve the optimal route.

[0004] Compared with the classic multi-objective path problem, this problem has an additional interference factor: specific nodes must be avoided and the route must be optimal, which can be considered as a complication of the classic multi-objective path problem. Therefore, the difficulty in optimizing the multi-objective path problem also applies. The computational complexity of the current traditional algorithm far exceeds O(N!), so it is difficult for traditional thinking under existing thinking to achieve the planning of minimized personalized travel routes. Summary of the invention

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

[0006] In order to achieve the above object, the technical solution adopted by the present invention is: a method for planning a personalized travel route, comprising the following steps:

[0007] S1, obtain the data of target points, avoidance points and passable points, and distribute the target points, avoidance points and passable points in the same plane;

[0008] S2, constructing a Thiessen polygon network through target points, avoidance points and passable points, and connecting the target points in sequence to obtain a reference path;

[0009] S3, extracting the Thiessen polygon area that the reference path passes through, and connecting the target points, avoidance points and passable points in the Thiessen polygon area to obtain an initial path;

[0010] S4. When there are three areas to be optimized that are adjacent to each other in pairs in the initial path, the initial path in the area to be optimized is extracted as the path segment to be optimized. If the Thiessen polygon located in the middle of the path segment to be optimized is the Thiessen polygon where the non-target point is located, the Thiessen polygons at both ends of the path segment to be optimized are directly connected.

[0011] S5. Filter the avoidance points in the initial path, take the Thiessen polygon where the avoidance points are located as the avoidance polygon, and delete the connection line with the avoidance points in 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, search for another Thiessen polygon that is adjacent to 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 searching. If the selection polygon is not adjacent to the Thiessen polygon where the other breakpoint is located, take the selection polygon as the base polygon, repeat the above search steps until the searched selection polygon is adjacent to the Thiessen polygon where the other breakpoint is located, stop searching, connect all the searched selection polygons in sequence to obtain the avoidance path, and connect the two breakpoints at both ends of the avoidance path respectively 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 by the following steps:

[0013] S21, constructing a target point Thiessen polygon network according to the target points, so as to cover all the target points in the constructed target point Thiessen polygon network;

[0014] S22, searching for any two adjacent Thiessen polygons in the target point Thiessen polygon network, and connecting the target points in the two searched Thiessen polygons with a line to construct an initial line;

[0015] S23, using the two adjacent Thiessen polygons that construct the initial connection as initial polygons, searching for any Thiessen polygon that is adjacent to the two initial polygons at the same time;

[0016] S24, connecting the two nodes of the initial connection line to the nodes in the searched Thiessen polygon respectively to obtain a triangle;

[0017] S25, delete the initial connection line of the triangle, and use the remaining two connection lines as the initial connection lines, and return to step S23;

[0018] S26. Repeat steps S23-S25 until all target points are searched and a reference path is obtained.

[0019] Preferably, in step S3, the target points, avoidance points and passable points in the passed Thiessen polygon area are connected in sequence along the order in which the reference path passes.

[0020] Preferably, in step S5, if there are two avoidance paths for 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 travel route planning method is used for plane route planning.

[0022] The beneficial effect is as follows: compared with the prior art, a personalized tourist route planning method of the present invention does not consider avoidance points first during path planning, but directly searches for the shortest path between target points, classifies and groups problems, realizes dimensionality reduction of complex multidimensional problems, and improves planning efficiency. At the same time, the target point area is formed by Thiessen polygons, and the point avoidance is upgraded to a non-intersecting surface, thereby realizing dimensionality simplification of line problems; and through simple line and surface analysis, the path part that needs to be avoided is obtained, and through surface adjacency analysis, alternative solutions for this part of the path are obtained. The problem complexity is only related to the adjacent surface, that is, the node degree, and the complexity is far below linearity, thus avoiding the upgrade of the complexity of the problem dimension interweaving. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] The specific embodiments of the present invention are further described in detail below in conjunction with the accompanying drawings, wherein:

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

[0025] Figure 2 A schematic diagram of the baseline route; a schematic diagram of the search results without avoiding tourist routes

[0026] Figure 3 A schematic diagram of the Thiessen polygons that the reference path passes through;

[0027] Figure 4 A schematic diagram for constructing the initial path;

[0028] Figure 5 It is an enlarged schematic diagram of the optimized position in the initial path;

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

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

[0031] Figure 8 To search for the Thiessen polygon area adjacent to the avoidance point;

[0032] Fig. 9 It is a schematic diagram after the initial path and the avoidance path are connected;

[0033] Fig.10 A schematic diagram after searching all avoidance points and producing corresponding avoidance paths;

[0034] Fig.11 It is an enlarged schematic diagram of the filtering point;

[0035] Fig.12 This is a schematic diagram of the filter points after filtering;

[0036] Fig.13 This is a schematic diagram of the final travel route planning results. DETAILED DESCRIPTION

[0037] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0038] It should be noted that when a component is referred to as being "fixed to" another component, it may be directly on the other component or there may be a central component. When a component is considered to be "connected to" another component, it may be directly connected to the other component or there may be a central component at the same time. When a component is considered to be "set on" another component, it may be directly set on the other component or there may be a central component at the same time. When a component is referred to as being "set in the middle", it does not only mean being set in the middle, as long as it is not set at both ends within the range defined by the middle. The terms "vertical", "horizontal", "left", "right" and similar expressions used herein are for illustrative purposes only.

[0039] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art of the present invention. The terms used herein in the specification of the present invention are only for the purpose of describing specific embodiments and are not intended to limit the present invention. The term "and / or" used herein includes any and all combinations of one or more related listed items.

[0040] The tourist route problem is a typical NP problem. Its essence is the path selection to the target point. It is a one-dimensional line problem in multidimensional space. Its ultimate goal is to select a line. The difference is that it must avoid specific targets and the route must be optimal. The selection belongs to logic. The line is the connection relationship between points, which is distributed in multidimensional space. So far, the path problem has been theoretically unified in terms of points, lines and surfaces in thinking.

[0041] From the basic thinking of solving problems in natural science, it can be known that the discovery of necessary conditions in problem solving is often easy to discover necessary and sufficient conditions. In other words, it is relatively easy to find the initial solution, which is the premise of problem solving. Optimization is the key and is relatively difficult. The combination of the two can achieve the optimal solution of the problem, which is also a common thinking in engineering implementation. Based on this logic, this application discloses a method for planning a personalized tourist route, including the following steps:

[0042] S1, obtain the data of target points, avoidance points and passable points, and distribute the target points, avoidance points and passable points in the same plane;

[0043] S2, constructing a Thiessen polygon network through target points, avoidance points and passable points, and connecting the target points in sequence to obtain a reference path;

[0044] S3, extracting the Thiessen polygon area that the reference path passes through, and connecting the target points, avoidance points and passable points in the Thiessen polygon area to obtain an initial path;

[0045] S4. If the point in the Thiessen polygon passed by the initial path is not the target point, and multiple Thiessen polygons are adjacent, directly connect the lines in the initial path to optimize the initial path;

[0046] S5. Filter the avoidance points in the initial path, take the Thiessen polygon where the avoidance points are located as the avoidance polygon, and delete the connection line with the avoidance points in 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, search for another Thiessen polygon that is adjacent to 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 searching. If the selection polygon is not adjacent to the Thiessen polygon where the other breakpoint is located, take the selection polygon as the base polygon, repeat the above search steps until the searched selection polygon is adjacent to the Thiessen polygon where the other breakpoint is located, stop searching, connect all the searched selection polygons in sequence to obtain the avoidance path, and connect the two breakpoints at both ends of the avoidance path respectively 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 FIG. 1 , in one specific implementation, data samples of 15 avoidance points, 16 target points, and 169 passable points are obtained, wherein the five-pointed stars are avoidance points, the triangles are target points, and the small dots are passable points. These target points, avoidance points, and passable points are distributed in the same plane, and are shown in FIG. Figure 2 As shown, the 16 target points in the figure are connected in sequence to obtain a reference path. In the construction of the reference path, the search method in the existing patent CN202111033680.3 can be used, specifically, including the following steps:

[0048] S21, constructing a target point Thiessen polygon network according to the target points, so as to cover all the target points in the constructed target point Thiessen polygon network;

[0049] S22, searching for any two adjacent Thiessen polygons in the target point Thiessen polygon network, and connecting the target points in the two searched Thiessen polygons with a line to construct an initial line;

[0050] S23, using the two adjacent Thiessen polygons that construct the initial connection as initial polygons, searching for any Thiessen polygon that is adjacent to the two initial polygons at the same time;

[0051] S24, connecting the two nodes of the initial connection line to the nodes in the searched Thiessen polygon respectively to obtain a triangle;

[0052] S25, delete the initial connection line of the triangle, and use the remaining two connection lines as the initial connection lines, and return to step S23;

[0053] S26. Repeat steps S23-S25 until all target points are searched and a reference path is obtained.

[0054] Then as Figure 3 As shown in the figure, the Thiessen polygon area passed by the reference path is extracted, and the target points, avoidance points and passable points in the Thiessen polygon area are connected to obtain Figure 4 The initial path shown in FIG. 1 can be connected in the order in which the target points, avoidance points, and passable points are connected in sequence along the reference path, such as Figure 5 and Figure 6 As shown, when there are three areas to be optimized that are passed through in sequence and are adjacent to each other in pairs in the initial path, that is, any two of the three Thiessen polygons in the area to be optimized are adjacent, then the initial path in the area to be optimized is extracted as the path segment to be optimized. If the Thiessen polygon located in the middle of the path segment to be optimized is the Thiessen polygon where the non-target point is located, then the points in the Thiessen polygons at both ends of the path segment to be optimized are directly connected, and the directly connected path does not need to pass through the non-target point where the middle Thiessen polygon is located. Then, as shown in Figures 6 to 10 As shown, the avoidance points in the initial path are screened and the avoidance points are filtered. When filtering, the Thiessen polygon where the screened avoidance point is located is used as the avoidance polygon, and the connection line with the avoidance point in the initial path is deleted. After deletion, two breakpoints are formed on the initial path. The Thiessen polygon where one of the breakpoints is located is used as the base polygon, and another Thiessen polygon adjacent to the avoidance polygon and the base polygon is searched as the selection polygon. Then the selection polygon is used as the base polygon, and the above search steps are repeated until the searched selection polygon is adjacent to the Thiessen polygon where another breakpoint is located. Then the search is stopped, and all the searched selection polygons are connected in sequence according to the adjacent principle to obtain the avoidance path. At the same time, the two ends of the avoidance path are respectively connected to the two breakpoints to filter the avoidance points. The above method is used to filter all the avoidance points in the initial path to complete the planning of the travel route, as shown in FIG. Fig.11 As shown in , there is an avoidance path above and below the avoidance point. By calculating the lengths of the two avoidance paths, the length of the avoidance path above the avoidance point is less than the length of the avoidance path below the avoidance point. Therefore, Fig.12 As shown in the figure, the avoidance path below the avoidance point is deleted, and the avoidance path above the avoidance point is retained. According to this method, the paths at all avoidance points are optimized, and finally the avoidance path is obtained. Fig.13 The path planning scheme shown.

[0055] In addition, it should be noted that the route planning method of the present application is not only applicable to automatic planning by computer programming, but also to planar route planning by human work drawings.

[0056] A personalized travel route planning method of the present invention does not consider avoidance points first during path planning, directly searches for the shortest path between target points, classifies and groups problems, realizes dimensionality reduction of complex multi-dimensional problems, improves planning efficiency, and simultaneously forms a target point area through Thiessen polygons, and avoids points and upgrades the dimensions to non-intersecting surfaces, thereby realizing dimensionality simplification of line problems; and through simple line and surface analysis, obtains the path portion that needs to be avoided, and through surface adjacency analysis, 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 linearity, thereby avoiding the upgrade of the complexity of the problem dimension interweaving.

[0057] The above embodiments are only used to illustrate the technical solution of the present invention rather than to limit it. Any modification or equivalent substitution that does not depart from the spirit and scope of the present invention shall be included in the scope of the technical solution of the present invention.

Claims

1. A method for planning a personalized travel route, characterized in that: The following steps are involved: S1, obtain the data of target points, avoidance points and passable points, and distribute the target points, avoidance points and passable points in the same plane; S2, constructing a Thiessen polygon network through target points, avoidance points and passable points, and directly connecting the target points in sequence to obtain a reference path; S3, extracting the Thiessen polygon area that the reference path passes through, and connecting the target points, avoidance points and passable points in the Thiessen polygon area to obtain an initial path; S4. When there are three areas to be optimized that are adjacent to each other in pairs in the initial path, the initial path in the area to be optimized is extracted as the path segment to be optimized. If the Thiessen polygon located in the middle of the path segment to be optimized is the Thiessen polygon where the non-target point is located, the Thiessen polygons at both ends of the path segment to be optimized are directly connected. S5. Filter the avoidance points in the initial path, take the Thiessen polygon where the avoidance points are located as the avoidance polygon, and delete the connection line with the avoidance points in 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, search for another Thiessen polygon that is adjacent to 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 searching. If the selection polygon is not adjacent to the Thiessen polygon where the other breakpoint is located, take the selection polygon as the base polygon, repeat the above search steps until the searched selection polygon is adjacent to the Thiessen polygon where the other breakpoint is located, stop searching, connect all the searched selection polygons in sequence to obtain the avoidance path, and connect the two breakpoints at both ends of the avoidance path respectively to filter the avoidance points. Filter all the avoidance points in the initial path to complete the planning of the travel route.

2. A method for planning a personalized travel route according to claim 1, characterized in that: In step 2, the reference path is obtained by the following steps: S21, constructing a target point Thiessen polygon network according to the target points, so as to cover all the target points in the constructed target point Thiessen polygon network; S22, searching for any two adjacent Thiessen polygons in the target point Thiessen polygon network, and connecting the target points in the two searched Thiessen polygons with a line to construct an initial line; S23, using the two adjacent Thiessen polygons that construct the initial connection as initial polygons, searching for any Thiessen polygon that is adjacent to the two initial polygons at the same time; S24, connecting the two nodes of the initial connection line to the nodes in the searched Thiessen polygon respectively to obtain a triangle; S25, delete the initial connection line of the triangle, and use the remaining two connection lines as the initial connection lines, and return to step S23; S26. Repeat steps S23-S25 until all target points are searched and a reference path is obtained.

3. A method for planning a personalized travel route according to claim 1, characterized in that: In the step S3, the target points, avoidance points and passable points in the passed Thiessen polygon area are connected in sequence along the order in which the reference path passes.

4. A method for planning a personalized travel route according to claim 1, characterized in that: In step S5, if there are two avoidance paths for the avoidance point, the lengths of the two avoidance paths are calculated, and the shorter one is selected as the optimized path.

5. A method for planning a personalized travel route according to claim 1, characterized in that: The travel route planning method is used for plane route planning.

Images