CN111222667B - Route planning method, device, equipment and storage medium - Google Patents
Route planning method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN111222667B CN111222667B CN201811422192.XA CN201811422192A CN111222667B CN 111222667 B CN111222667 B CN 111222667B CN 201811422192 A CN201811422192 A CN 201811422192A CN 111222667 B CN111222667 B CN 111222667B
- Authority
- CN
- China
- Prior art keywords
- route
- scenic spot
- scenic
- tour
- total
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 58
- 238000003780 insertion Methods 0.000 claims abstract description 124
- 230000037431 insertion Effects 0.000 claims abstract description 124
- 230000006872 improvement Effects 0.000 claims description 17
- 238000005457 optimization Methods 0.000 claims description 11
- 238000004590 computer program Methods 0.000 claims description 9
- 238000004364 calculation method Methods 0.000 claims description 2
- 238000012217 deletion Methods 0.000 description 29
- 230000037430 deletion Effects 0.000 description 29
- 230000008569 process Effects 0.000 description 15
- 238000010586 diagram Methods 0.000 description 10
- 238000004422 calculation algorithm Methods 0.000 description 5
- 230000000052 comparative effect Effects 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 238000007792 addition Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/14—Travel agencies
Landscapes
- Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Game Theory and Decision Science (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Navigation (AREA)
Abstract
The embodiment of the invention discloses a route planning method, a device, equipment and a storage medium. The method comprises the following steps: obtaining a starting point position, an end point position, a total tour duration of a user and preference degree scores of the user for each scenic spot; determining scenic spots to be inserted and the insertion positions of the scenic spots to be inserted from scenic spots which are not covered by the current route according to the preference degree scores; calculating the tour time length corresponding to the first target route after the scenic spot to be inserted is inserted into the insertion position; if the tour time is not longer than the tour total time, inserting the scenic spot to be inserted into the insertion position; continuously inserting scenic spots; and if the tour time length is longer than the tour total time length, determining the current route as a planned route. According to the route planning method, device, equipment and storage medium, route planning is performed according to the preference degree scores of the users aiming at the scenic spots, and the planned route can meet the preference requirements of the users.
Description
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a route planning method, apparatus, device, and storage medium.
Background
The orientation problem is divided into a traditional orientation problem and a team orientation problem, is a special non-deterministic polynomial (NP-hard) path optimization problem, is very common in the logistics field and the tourism field, and has great challenges at the same time.
The personalized travel route solution optimization problem can be modeled as a windowed directional problem (Orienteering Problem with Time Windows, OPTW).
Currently, the problem of OPTW is solved mainly by adopting an iterative local search (Iterated Local Search, ILS) algorithm. However, in the process of planning a route, the ILS algorithm may exclude places with higher user preference, so that the planned route cannot meet the user preference requirement.
Disclosure of Invention
The embodiment of the invention provides a route planning method, a device, equipment and a storage medium, which can enable a planned route to meet the preference requirement of a user.
In one aspect, an embodiment of the present invention provides a route planning method, including:
obtaining a starting point position, an end point position, a total tour duration of a user and preference degree scores of the user for each scenic spot;
determining scenery points to be inserted and the insertion positions of the scenery points to be inserted in the current route from the starting point position to the end point position according to the preference degree scores;
Calculating the tour time length corresponding to the first target route after the scenic spot to be inserted is inserted into the insertion position;
if the tour time is not longer than the tour total time, inserting the scenic spot to be inserted into the insertion position;
returning to the score according to the preference degree, and determining the scenic spot to be inserted and the scenic spot to be inserted to be continuously executed for the insertion position in the current route from the starting point position to the end point position;
and if the tour time length is longer than the tour total time length, determining the current route as a planned route.
In another aspect, an embodiment of the present invention provides a path planning apparatus, including:
the acquisition module is used for acquiring the starting point position, the end point position, the total tour duration and the preference degree score of the user for each scenic spot;
the first determining module is used for determining scenery spots to be inserted and the insertion positions of the scenery spots to be inserted in the current route from the starting point position to the end point position according to the preference degree score;
the calculation module is used for calculating the tour time length corresponding to the first target route after the scenic spot to be inserted is inserted into the insertion position;
the inserting module is used for inserting the scenic spot to be inserted into the inserting position if the tour time is not more than the tour total time; and triggering a determining module;
And the second determining module is used for determining the current route as the planned route if the tour time length is longer than the tour total time length.
In still another aspect, an embodiment of the present invention provides a route planning apparatus, including: a memory, a processor, and a computer program stored on the memory and executable on the processor;
the route planning method provided by the embodiment of the invention is realized when the processor executes the computer program.
In yet another aspect, an embodiment of the present invention provides a computer readable storage medium, where a computer program is stored, where the computer program when executed by a processor implements the route planning method provided by the embodiment of the present invention.
According to the route planning method, device, equipment and storage medium, route planning is performed according to the preference degree scores of the users aiming at the scenic spots, and the planned route can meet the preference requirements of the users.
Drawings
In order to more clearly illustrate the technical solution of the embodiments of the present invention, the drawings that are needed to be used in the embodiments of the present invention will be briefly described, and other drawings can be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 shows a schematic representation of the result of route planning provided by the prior art;
fig. 2 is a schematic flow chart of a route planning method according to an embodiment of the present invention;
fig. 3 is a schematic view of a scenario illustrating a route planning method according to an embodiment of the present invention;
FIG. 4 is a schematic flow chart of route optimization provided by an embodiment of the present invention;
FIG. 5 is a schematic diagram of the result of route planning provided by an embodiment of the present invention;
FIG. 6 is a graph showing the total duration of a route planned by an embodiment of the invention versus the total duration of a route planned by the prior art;
FIG. 7 is a graph showing the comparison of the time elapsed for planning a route in accordance with an embodiment of the present invention and the time elapsed for planning a route in accordance with the prior art;
fig. 8 is a schematic structural diagram of a route planning device according to an embodiment of the present invention;
fig. 9 illustrates a block diagram of an exemplary hardware architecture of a computing device capable of implementing the route planning method and apparatus according to an embodiment of the invention.
Detailed Description
Features and exemplary embodiments of various aspects of the present invention will be described in detail below, and in order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in further detail below with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are merely configured to illustrate the invention and are not configured to limit the invention. It will be apparent to one skilled in the art that the present invention may be practiced without some of these specific details. The following description of the embodiments is merely intended to provide a better understanding of the invention by showing examples of the invention.
It is noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.
Fig. 1 shows a schematic diagram of the result of route planning provided by the prior art. In fig. 1, there are 5 attractions, and 5 attractions are attraction 1, attraction 2, attraction 3, attraction 4, and attraction 5, respectively. The scenic spot 5 is a scenic spot with higher user preference. As can be seen from the resulting schematic diagram of the route planning shown in fig. 1, the route planned using the prior art does not include the scenic spot 5, so that the planned route cannot meet the user's preference requirements. The route planning in fig. 1 results in that: starting point position- > attraction 2- > attraction 4- > attraction 1- > end point position.
In order to solve the problems in the prior art, the embodiment of the invention provides a route planning method, a device, equipment and a storage medium for carrying out route planning, so that the planned route meets the preference requirement of a user. The following first describes a route planning method provided by the embodiment of the present invention in detail.
Fig. 2 shows a flow chart of a route planning method according to an embodiment of the present invention. The route planning method may include:
s201: and obtaining the starting point position, the end point position, the total tour duration and the preference degree score of the user for each scenic spot.
S202: and determining scenery points to be inserted and the insertion positions of the scenery points to be inserted in the current route from the starting point position to the end point position according to the preference degree scores.
S203: and calculating the tour time length corresponding to the first target route after the scenic spot to be inserted is inserted into the insertion position.
S204: if the tour time is not greater than the total tour time, inserting the scenic spot to be inserted into the insertion position, and continuing to execute S202.
S205: and if the tour time length is longer than the tour total time length, determining the current route as a planned route.
The route planning method provided by the embodiment of the invention is illustrated below by way of example with reference to a specific route planning scenario.
Fig. 3 is a schematic diagram of a scenario of a route planning method according to an embodiment of the present invention. The scene shown in fig. 3 includes 10 spots, spot 1, spots 2, … …, spot 9, and spot 10, respectively. The preference degree of the user for the scenic spot 1, the scenic spots 2, … …, the scenic spot 9 and the scenic spot 10 respectively can be as follows: very desirable, comparative undesirable, must desirable, very undesirable, comparative desirable, very desirable, comparative undesirable and comparative undesirable.
Wherein, the corresponding relation between the preference degree and the preference degree score is shown in table 1.
TABLE 1
| Preference degree | Preference degree score |
| Very much not want to go | 1 |
| Compare and do not want to go | 2 |
| Compare want to go | 3 |
| Very much want to go | 4 |
| Must go to | MAX |
In one embodiment of the invention, the preference degree score MAX is much larger than other preference degree scores, such as MAX being 10000, 1000000, 20000, etc.
Accordingly, based on table 1, the preference degree scores of the user for attraction 1, attraction 2, … …, attraction 9 and attraction 10 are respectively: 4. 3, 2, MAX, 1, 3, 4, 2 and 2.
In one embodiment of the present invention, if the user does not set the preference level for a certain scenic spot, the preference level of the user for the scenic spot may be defaulted as: comparison is intended.
Assume that the total length of the tour set by the user is 160 minutes.
The starting route is from the starting point position to the end point position, namely the current route is: start position— end position.
Assuming that the scenery spot to be inserted is scenery spot 5 according to the preference degree score, it is understood that the current insertion position is between the starting point position and the end point position. Calculating a first target route after inserting the scenery spot 5 between the start point position and the end point position: the tour duration corresponding to the initial point position- (scenic spot 5-) end point position is 100 minutes, if the calculated tour duration is less than the total tour duration set by the user for 160 minutes, the scenic spot 5 is inserted between the initial point position and the end point position, and the current route is: the tour duration corresponding to the starting point position- (scenic spot 5-) end point position.
Based on the current route: starting point position- > scenic spot 5- > end point position, and then performing the insertion operation of scenic spot.
Assuming that the scenery spot to be inserted is scenery spot 1 according to the preference degree score, it is understood that the current insertion position may be between the starting point position and the scenery spot 5, and may also be between the scenery spot 5 and the end point position.
In one embodiment of the invention, the location that consumes least time may be the best insertion location for insertion of a attraction.
For example, assuming that the time from the start point position to the attraction 5 is 25 minutes before the attraction 1 is not inserted, and the time from the start point position to the attraction 5 is 50 minutes after the attraction 1 is inserted between the start point position and the attraction 5, the time consumption is 50-25=25 minutes.
Assuming that the time from the spot 5 to the end position is 75 minutes before the spot 1 is not inserted, and that the time from the spot 5 to the end position after the spot 1 is inserted between the spot 5 and the end position is 85 minutes, the time consumption is 85-75=10 minutes.
The optimum insertion position for attraction 1 is determined between attraction 5 and the end position.
Calculating a first target route after inserting the sight 1 between the sight 5 and the end position: the calculated tour time length is 110 minutes which is smaller than the total tour time length set by the user by 160 minutes, then the scenic spot 1 is inserted between the scenic spot 5 and the end point, and the current route is as follows: starting point position- > attraction 5- > attraction 1- > end point position.
The subsequent insertion process is the same as the insertion process of the scenic spot 1, and specific reference may be made to the insertion process of the scenic spot 1, which is not described herein in detail in the embodiment of the present invention.
In one embodiment of the present invention, determining the scenery spot to be inserted and the insertion position of the scenery spot to be inserted in the current route from the start point position to the end point position according to the preference degree score may include: for each of the attractions not covered by the current route from the start point position to the end point position, calculating the corresponding time consumption between the attraction insertion into two adjacent attractions in the current route; determining the minimum insertion cost of the scenic spot according to the time consumption; taking the position between two adjacent scenic spots corresponding to the minimum insertion cost as the insertion position of the scenic spot; calculating the insertion ratio of each scenic spot according to the preference degree score and the minimum insertion cost; and taking the scenic spot corresponding to the highest insertion ratio as the scenic spot to be inserted.
Assume that the current route from the start point position to the end point position is: start point position- > attraction 5- > end point position.
Then for each attraction not covered by the current route: for attraction 1, attraction 2, attraction 3, attraction 4, attraction 6, attraction 7, attraction 8, attraction 9 and attraction 10, the time consumption between the start point position and attraction 5 and between attraction 5 and the end point position of each attraction inserted into the current route is calculated. Determining the minimum insertion cost of the scenic spot according to the time consumption; and taking the position between two adjacent scenic spots corresponding to the minimum insertion cost as the insertion position of the scenic spot.
In one embodiment of the present invention, the minimum time consumption corresponding to a attraction may be used as the minimum insertion cost for the attraction.
Illustratively, the above-described sight 1 is also described as an example.
The corresponding time consumption between the insertion start point position of the scenic spot 1 and the scenic spot 5 is 25 minutes; the corresponding time spent between the insertion of attraction 1 into attraction 5 and the end position is 10 minutes. The minimum time consumption is 10 minutes, then 10 minutes is determined to be the minimum insertion cost for attraction 1.
In one embodiment of the present invention, determining a minimum insertion cost for a attraction based on time consumption may include: if the scenic spot and the former scenic spot and/or the latter scenic spot in the two adjacent scenic spots are/is located in the same scenic spot cluster, the ratio of the minimum time consumption to the scenic spot cluster parameter value corresponding to the scenic spot cluster is used as the minimum insertion cost of the scenic spot; if the scenery spot is not located in the same scenery spot cluster with the former scenery spot and the latter scenery spot, the minimum time consumption is used as the minimum insertion cost of the scenery spot.
In one embodiment of the invention, attractions may be clustered to form a plurality of attraction clusters. The distances between scenery spots belonging to the same scenery spot cluster are relatively close. The embodiment of the invention is not limited to the algorithm of scenic spot clustering, and any available clustering algorithm can be applied to the embodiment of the invention, such as a K-means (K-means) algorithm.
The minimum insertion cost formula provided by the embodiment of the invention is as follows:
if a attraction is located in the same attraction cluster as the previous attraction and/or the next attraction in two neighboring attractions,
if the attraction is not located in the same attraction cluster as the previous attraction and the next attraction,
shiftCluster p ＝shift p (2)
wherein, in the formula (1) and the formula (2), the shiftCluster p For minimum insertion cost of scenic spot P, shift p ClusterParamter for minimum time consumption of attraction P P Is the scenic spot cluster parameter. Wherein ClusterParamaster P Greater than 1.
The formula of the insertion ratio provided by the embodiment of the invention is as follows:
wherein ratio is p For the insertion rate of the scenic spot P, profit p For the user's preference score for sight P, shiftCluster p Is the minimum insertion cost for the attraction P.
Determining the scenic spot to be inserted and the insertion position of the scenic spot to be inserted through the formulas (1), (2) and (3).
According to the embodiment of the invention, the scenic spots are clustered, and when the scenic spots are inserted, other scenic spots positioned in the same scenic spot cluster can be preferentially inserted, so that the time consumption of a route on a journey can be reduced, and the transfer times of users among the scenic spot clusters can be reduced.
Typically, the scenery spot has its corresponding open time and close time, i.e. the time window corresponding to the scenery spot, for example, for scenery spot 1, the open time is: 10:00 am to 13:00 pm. Therefore, in one embodiment of the present invention, the route planning method provided by the embodiment of the present invention may further include: for each scenic spot covered by the first target route, determining whether the tour of the scenic spot by the user meets the requirements of the opening time and the closing time of the scenic spot according to the duration and the starting time of the user for browsing the scenic spot; if each scenic spot covered by the first target route is aimed at, determining that the tour of the scenic spot by the user meets the requirements of the opening time and the closing time of the scenic spot, and inserting the scenic spot to be inserted into the insertion position.
Illustratively, assume that the departure time of the user from the start point location is 9:00 am. The current route is: start point position- > attraction 5- > end point position. The scenic spot to be inserted is scenic spot 1, and the position to be inserted is: between the starting point location and the attraction 5. The first target route is: starting point position- > attraction 1- > attraction 5- > end point position.
The duration from the starting point position to attraction 1 is 25 minutes, and the tour duration of attraction 1 is 35 minutes. The duration from attraction 1 to attraction 5 is 35 minutes and the tour duration of attraction 5 is 20 minutes. The user arrives at attraction 1 at a time of 9:25, is expected to start from attraction 1 at a time of 10:00, arrives at attraction 5 at a time of 10:35, and starts from attraction 5 at a time of 10:50.
Suppose that both sight 1 and sight 5 have an open time of 9:00 am and a closed time of 13:00 pm.
It is determined for attraction 1 that the user's tour for attraction 1 meets the requirements of attraction 1 for open time and closed time.
It is determined for attraction 5 that the user's tour for attraction 5 meets the requirements of the attraction 5 for open time and closed time.
Then spot 1 is inserted between the starting point location and spot 5, the current route is: starting point position- > attraction 1- > attraction 5- > end point position.
Suppose that the open time of attraction 1 is 9:00 am and the close time is 9:30 am. The open time of the scenic spot 5 is 9:00 am, and the close time is 13:00 pm.
If the user expects that the time 10:00 from the sight 1 exceeds the closing time of the sight 1, the user is determined for the sight 1 that the user's tour for the sight 1 does not meet the requirements of the opening time and the closing time of the sight 1. Then spot 1 is not inserted.
Suppose that the open time for attraction 1 is 9:00 am and the close time is 13:00 pm. The open time of the scenic spot 5 is 8:40 am, and the close time is 9:40 am.
If the user expects that the time 9:50 from attraction 5 has exceeded the time of closing of attraction 5, then it is determined for attraction 5 that the user's tour for attraction 5 does not meet the requirements of the open time and the closed time of attraction 5. Then spot 1 is not inserted.
Still further exemplary, assume that attraction 1 has an open time of 9:30 am and a closed time of 12:30 am. The open time of the scenic spot 5 is 9:00 am, and the close time is 13:00 pm.
The user arrives at attraction 1 at a time 9:25, and does not arrive at the open time of attraction 1. At this time, the user may wait 5 minutes. The user expects the time from sight 1 to become 10:05. The time for the user to reach attraction 5 becomes 10:40 and the time from attraction 5 becomes 10:55.
It is determined for attraction 1 that the user's tour for attraction 1 meets the requirements of attraction 1 for open time and closed time.
It is determined for attraction 5 that the user's tour for attraction 5 meets the requirements of the attraction 5 for open time and closed time.
Then spot 1 is inserted between the starting point location and spot 5, the current route is: starting point position- > attraction 1- > attraction 5- > end point position.
That is, the conditions for the insertion of the attraction are: the total tour time length of the route after the scenic spots are inserted is smaller than the total tour time length set by the user, and all scenic spots covered by the route after the scenic spots are inserted meet the requirements of respective opening time and closing time, namely the user needs to leave before the closing time of the scenic spots.
In an embodiment of the present invention, the route planning method provided by the embodiment of the present invention may further include: and optimizing the planned route. A specific optimization procedure is shown in fig. 4. Fig. 4 shows a schematic flow chart of route optimization provided by an embodiment of the present invention.
S401: taking the planned route as an intermediate planned route.
S402: the number of times a preset number of attractions are deleted from the attractions covered by the intermediate planned route is compared with a preset maximum number of iterations without improvement.
S403: and if the number of times is equal to the maximum iteration number, determining the intermediate planning route as a final planning route.
S404: if the number of times is smaller than the maximum iteration number, deleting a preset number of scenic spots from scenic spots covered by the intermediate planning route to obtain a second target route, and adding 1 to the number of times.
S405: and determining scenery points to be inserted and the insertion positions of the scenery points to be inserted in the second target route from scenery points which are not covered by the second target route according to the preference degree scores.
S406: and calculating the tour time length corresponding to the third target route after the scenic spot to be inserted is inserted into the insertion position.
S407: if the tour time is not greater than the total tour time, inserting the scenic spot to be inserted into the insertion position, and continuing to execute S405.
S408: if the tour time length is longer than the tour total time length, comparing the first total preference degree score of the scenic spots covered by the current route with the second total preference degree score of the scenic spots covered by the middle planning route. If the first total preference degree score is not greater than the second total preference degree score, continuing to execute S402.
S409: if the first total preference degree score is larger than the second total preference degree score, taking the current route as a middle planning route, and resetting the times; execution continues with S402.
S410: and if the first total preference degree score is equal to the second total preference degree score, comparing the first total tour duration corresponding to the current route with the second total tour duration corresponding to the intermediate planning route.
S411: if the first total tour duration is not greater than the second total tour duration, taking the current route as an intermediate planning route, and resetting the times; execution continues with S402.
S412: if the first total length of the tour is greater than the second total length of the tour, execution continues with S402.
In one embodiment of the present invention, a predetermined number of attractions are deleted from the attractions covered by the intermediate planned route, and a predetermined number of consecutive attractions may be deleted from the attractions covered by the intermediate planned route. At this time, the starting points and the number of deleted points may be specified, and the points may be continuously deleted from the specified starting points.
In one embodiment of the present invention, the preset number of attractions are deleted from the attractions covered by the middle planning route, and the M consecutive attractions can be deleted from the first attraction at the start point position, then the N consecutive attractions can be deleted from the first attraction before the end point position, so that the sum of M and N is equal to the preset number.
In one embodiment of the present invention, a preset number of attractions are deleted from the attractions covered by the middle planning route, and one attraction can be deleted every interval, if the number of the deleted attractions is less than the preset number, one attraction is deleted every interval from the route obtained after deletion, until the total number of the deleted attractions reaches the preset number.
The route optimization process is described in detail below by way of specific examples.
Assuming that the planned route is a starting point position- (scenic spot 1- (scenic spot 5-) end point position, the corresponding tour time of the planned route is 155 minutes, and the total preference degree score of scenic spots covered by the planned route is 10 minutes. The total length of the tour is 160 minutes. The initial value of the deletion times of deleting the preset number of scenery spots from scenery spots covered by the middle planning route is 0, and the preset maximum iteration times without improvement is 200.
First, a route is planned: the starting point position- > scenic spot 1- > scenic spot 5- > end point position is used as the intermediate planning route.
At this time, the deletion number 0 is smaller than the maximum iteration number 200, and a route is planned from the middle: and deleting the scenery spot from the starting point position- (scenery spot 1- (scenery spot 5-) end point position. The number of deletions was added to 1, at which time the number of deletions=1.
The route after the scenic spot is deleted is subjected to scenic spot insertion, wherein the scenic spot insertion process is basically the same as the above scenic spot insertion process, and the description of the embodiment of the present invention is omitted here.
Assume that the current route after the scenic spot deletion and insertion is: the starting point position- (scenic spot 1- (scenic spot 4-) end point position, the corresponding visit duration of the current route is 155 minutes, and the total preference degree score of the covered scenic spots is 13 minutes. The total preference score 13 for attractions covered by the current route is greater than the total preference score 10 for attractions covered by the intermediate planned route. The current route will be: the starting point position- (scenic spot 1- (scenic spot 4-) end point position is used as an intermediate planning route, and the deletion times are cleared.
At this time, the deletion number 0 is smaller than the maximum iteration number 200, and a route is planned from the middle: and deleting the scenery spot from the starting point position- (scenery spot 1- (scenery spot 4-) end point position. The number of deletions was added to 1, at which time the number of deletions=1.
And performing scenic spot insertion on the route after the scenic spots are deleted. Assume that the current route after the scenic spot deletion and insertion is: the starting point position- (scenic spot 2- (scenic spot 3-) end point position, the corresponding tour time of the current route is 145 minutes, and the total preference degree score of the covered scenic spots is 13 minutes. The total preference degree score of the scenery points covered by the current route is equal to the preference degree score of the scenery points covered by the middle planning route, wherein the preference degree score of the scenery points covered by the current route is 13, but the visit duration of 145 minutes corresponding to the current route is smaller than the visit duration of 145 minutes corresponding to the middle planning route, and the preference degree score of the scenery points covered by the middle planning route is equal. The current route will be: the starting point position- (scenic spot 2- (scenic spot 3-) end point position is used as the intermediate planning route, and the deleting times are cleared.
At this time, the deletion number 0 is smaller than the maximum iteration number 200, and a route is planned from the middle: and deleting the scenery spot from the starting point position- (scenery spot 2- (scenery spot 3-) end point position. The number of deletions was added to 1, at which time the number of deletions=1.
And performing scenic spot insertion on the route after the scenic spots are deleted. Assume that the current route after the scenic spot deletion and insertion is: the starting point position- (scenic spot 1- (scenic spot 7-) end point position, the corresponding tour time of the current route is 150 minutes, and the preference degree score of the covered scenic spots is 13 minutes. The total preference degree score of the scenery spots covered by the current route is equal to the preference degree score of the scenery spots covered by the middle planning route, wherein the preference degree score of the scenery spots covered by the current route is 13, but the visit duration of 150 minutes corresponding to the current route is longer than the visit duration of 145 minutes corresponding to the middle planning route. . The intermediate planned route is unchanged also: starting point position- > attraction 2- > attraction 3- > end point position.
At this time, the deletion number 1 is smaller than the maximum iteration number 200, and a route is planned from the middle: and deleting the scenery spot from the starting point position- (scenery spot 2- (scenery spot 3-) end point position. The number of deletions was added to 1, at which time the number of deletions=2.
And performing scenic spot insertion on the route after the scenic spots are deleted. Assume that the current route after the scenic spot deletion and insertion is: the starting point position- (scenic spot 2- (scenic spot 5-) end point position, the corresponding tour time of the current route is 145 minutes, and the preference degree score of the covered scenic spots is 12 minutes. The tour time 145 minutes corresponding to the current route is equal to the tour time 145 minutes corresponding to the middle planning route, but the preference degree score 12 of the scenery points covered by the current route is smaller than the preference degree score 13 of the scenery points covered by the middle planning route. The intermediate planned route is unchanged also: starting point position- > attraction 2- > attraction 3- > end point position.
At this time, the deletion number 2 is smaller than the maximum iteration number 200, and a route is planned from the middle: and deleting the scenery spot from the starting point position- (scenery spot 2- (scenery spot 3-) end point position. The number of deletions was added to 1, at which time the number of deletions=3. And performing scenic spot insertion on the route after the scenic spots are deleted.
If the number of deletions is equal to the maximum number of iterations 200, the intermediate planned route is determined to be the final planned route.
Illustratively, assume that for an intermediate planned route: starting point position- > attraction 2- > attraction 3- > end point position. It can be understood that when the number of deletion times reaches 200, the total time length of the route after each deletion and insertion of the scenery spot is not less than the total time length of the route corresponding to the middle planning route, and the total preference degree score of the scenery spot covered by the route after each deletion and insertion of the scenery spot is not greater than the total preference degree score of the scenery spot covered by the middle planning route, at this time, the middle planning route is: the starting point position- > scenic spot 2- > scenic spot 3- > end point position is determined as the final planned route.
In one embodiment of the present invention, in optimizing the route using the above-described process, the scenic spot cluster parameters for calculating the minimum insertion cost of the scenic spot may be reduced every time the maximum number of iterations of 1/4 passes. Illustratively, assume that the attraction cluster parameter ClusterParamter has an initial value of 1.2. When the deletion number=50, the scenic spot cluster parameter clusterParamter is reduced by 0.1, and at this time clusterParamter=1.1. When the deletion number=100, the scenic spot cluster parameter clusteripa is reduced by 0.1 again, and at this time clusteriparameter=1. When the deletion number=150, the scenic spot cluster parameter clusterParamter is reduced by 0.1 again, and at this time clusterParamter=0.9.
That is, the optimized route needs to satisfy the following condition 1 or condition 2.
Condition 1: the overall preference degree score of the scenic spots covered by the optimized route is higher than the overall preference degree score of the scenic spots covered by the route before optimization.
Condition 2: the total preference degree score of the scenic spots covered by the optimized route is equal to the total preference degree score of the scenic spots covered by the route before optimization. But the total tour time corresponding to the optimized route is shorter than the total tour time corresponding to the route before optimization.
The preconditions for the conditions 1 and 2 are: the total tour time corresponding to the optimized route is shorter than the tour time set by the user.
Fig. 5 shows a schematic diagram of the result of route planning provided by the embodiment of the invention.
Fig. 6 shows a graph comparing the total duration of a route planned by an embodiment of the present invention with the total duration of a route planned by the prior art. As can be seen from fig. 6, when the total duration of the tour set by the user is shorter, the total duration of the route planned by the embodiment of the present invention is substantially the same as the total duration of the route planned by the prior art. When the total time length of the tour set by the user is longer, the total time length of the route planned by the embodiment of the invention is shorter than the total time length of the route planned by the prior art, and the tour time of the user can be saved. Typically, the length of time required to visit a scenic spot is substantially more than two and a half hours, and even more, some scenic spots require at least 4, 5 hours, such as, for example, a jojo garden, a underway mountain, etc.
FIG. 7 is a graph showing the comparison of the time taken to route an embodiment of the present invention with the time taken to route a prior art. As can be seen from fig. 7, the time taken to route the embodiment of the present invention is about 1000 milliseconds (1 second) different from the time taken to route the prior art, which is acceptable to the user.
It should be noted that the above description is given by taking 10 scenic spots as an example, which is only a specific example of the present invention, and is not meant to limit the present invention.
According to the route planning method provided by the embodiment of the invention, route planning is performed according to the preference degree score of the user for the scenic spots, so that the planned route can meet the preference requirement of the user.
Corresponding to the method embodiment, the embodiment of the invention also provides a route planning device. As shown in fig. 8, fig. 8 shows a schematic structural diagram of a route planning device according to an embodiment of the present invention. The route planning device may include:
an obtaining module 801, configured to obtain a starting point position, an ending point position, a total tour duration, and a preference degree score of the user for each sight.
The first determining module 802 is configured to determine, according to the preference score, a scenic spot to be inserted and an insertion position of the scenic spot to be inserted in the current route from the start point position to the end point position, where the scenic spot is not covered by the current route.
The calculating module 803 is configured to calculate a tour duration corresponding to the first target route after the scenic spot to be inserted is inserted into the insertion position.
An inserting module 804, configured to insert the scenic spot to be inserted into the inserting position if the tour time is not greater than the total tour time; and triggers the first determination module 802.
A second determining module 805 is configured to determine the current route as the planned route if the tour time period is longer than the tour total time period.
In one embodiment of the invention, the first determining module 802 includes:
an insertion position determining unit for calculating, for each of the attractions not covered by the current route from the start point position to the end point position, a corresponding time consumption between insertion of the attraction into adjacent two attractions in the current route; determining the minimum insertion cost of the scenic spot according to the time consumption; taking the position between two adjacent scenic spots corresponding to the minimum insertion cost as the insertion position of the scenic spot;
the to-be-inserted scenic spot determining unit is used for calculating the insertion ratio of each scenic spot according to the preference degree score and the minimum insertion cost; and taking the scenic spot corresponding to the highest insertion ratio as the scenic spot to be inserted.
In one embodiment of the invention, the insertion position determining unit is specifically configured to:
If the scenic spot and the former scenic spot and/or the latter scenic spot in the two adjacent scenic spots are/is located in the same scenic spot cluster, the ratio of the minimum time consumption to the scenic spot cluster parameter value corresponding to the scenic spot cluster is used as the minimum insertion cost of the scenic spot;
if the scenery spot is not located in the same scenery spot cluster with the former scenery spot and the latter scenery spot, the minimum time consumption is used as the minimum insertion cost of the scenery spot.
In one embodiment of the present invention, the route planning device provided in the embodiment of the present invention further includes:
the third determining module is used for determining whether the tour of the scenic spot by the user meets the requirements of the opening time and the closing time of the scenic spot according to the duration and the starting time of the user for browsing the scenic spot for each scenic spot covered by the first target route; and if each scenic spot covered by the first target route is aimed at, determining that the tour of the scenic spot by the user meets the requirements of the opening time and the closing time of the scenic spot, and triggering the inserting module.
In one embodiment of the present invention, the route planning device provided in the embodiment of the present invention further includes:
the route optimization module is used for taking the planned route as an intermediate planned route;
comparing the number of times of deleting a preset number of scenic spots from scenic spots covered by the middle planning route with the preset maximum iteration number without improvement;
If the number of times is equal to the maximum iteration number, determining the intermediate planning route as a final planning route;
if the number of times is smaller than the maximum iteration number, deleting a preset number of scenic spots from scenic spots covered by the intermediate planning route to obtain a second target route, and adding 1 to the number of times;
determining scenery points to be inserted and the insertion positions of the scenery points to be inserted to the second target route from scenery points which are not covered by the second target route according to the preference degree scores;
calculating the tour time length corresponding to the third target route after the scenic spot to be inserted is inserted into the insertion position;
if the tour time is not longer than the tour total time, inserting the scenic spot to be inserted into the insertion position;
determining scenic spots to be inserted from scenic spots which are not covered by the second target route according to the preference degree score, and continuously executing the scenic spots to be inserted at the inserting positions of the scenic spots to be inserted on the second target route until the tour time is longer than the total tour time;
comparing the first total preference degree score of the scenic spots covered by the current route with the second total preference degree score of the scenic spots covered by the middle planning route;
if the first total preference degree score is larger than the second total preference degree score, taking the current route as a middle planning route, and resetting the times; returning to compare the number of times of deleting the preset number of scenic spots from scenic spots covered by the middle planning route with a preset maximum iteration number line without improvement to continue execution;
If the first total preference degree score is equal to the second total preference degree score, comparing the first total tour duration corresponding to the current route with the second total tour duration corresponding to the intermediate planning route;
if the first total tour duration is not greater than the second total tour duration, taking the current route as an intermediate planning route, and resetting the times; returning to compare the number of times of deleting the preset number of scenic spots from scenic spots covered by the middle planning route with the preset maximum iteration number without improvement to continue execution;
if the first total time length of the tour is longer than the second total time length of the tour, returning to compare the number of times of deleting the preset number of scenic spots from scenic spots covered by the middle planning route with the preset maximum iteration number without improvement to continue execution;
and if the first total preference degree score is not greater than the second total preference degree score, returning to compare the number of times of deleting the preset number of scenery spots from scenery spots covered by the middle planning route with the preset maximum iteration number without improvement to continue execution.
According to the route planning device provided by the embodiment of the invention, route planning is performed according to the preference degree score of the user for the scenic spots, so that the planned route can meet the preference requirement of the user.
Fig. 9 illustrates a block diagram of an exemplary hardware architecture of a computing device capable of implementing the route planning method and apparatus according to an embodiment of the invention. As shown in fig. 9, the computing device 900 includes an input device 901, an input interface 902, a central processor 903, a memory 904, an output interface 905, and an output device 906. The input interface 902, the central processor 903, the memory 25 904, and the output interface 905 are connected to each other through a bus 910, and the input device 901 and the output device 906 are connected to the bus 910 through the input interface 902 and the output interface 905, respectively, and further connected to other components of the computing device 900.
Specifically, the input device 901 receives input information from the outside, and transmits the input information to the central processor 903 through the input interface 902; the central processor 903 processes the input information based on computer-executable instructions stored in the memory 904 to generate output information, temporarily or permanently stores the output information in the memory 904, and then transmits the output information to the output device 906 through the output interface 905; output device 906 outputs the output information to the outside of computing device 900 for use by a user.
That is, the computing device shown in fig. 9 may also be implemented as a route planning device, which may include: a memory storing computer-executable instructions; and a processor that when executing computer-executable instructions may implement the route planning methods and apparatus described in connection with fig. 2 and 8.
Embodiments of the present invention also provide a computer readable storage medium having computer program instructions stored thereon; the computer program instructions, when executed by a processor, implement the route planning method provided by the embodiments of the present invention.
It should be understood that the invention is not limited to the particular arrangements and instrumentality described above and shown in the drawings. For the sake of brevity, a detailed description of known methods is omitted here. In the above embodiments, several specific steps are described and shown as examples. However, the method processes of the present invention are not limited to the specific steps described and shown, and those skilled in the art can make various changes, modifications and additions, or change the order between steps, after appreciating the spirit of the present invention.
The functional blocks shown in the above-described structural block diagrams may be implemented in hardware, software, firmware, or a combination thereof. When implemented in hardware, it may be, for example, an electronic circuit, an Application Specific Integrated Circuit (ASIC), suitable firmware, a plug-in, a function card, or the like. When implemented in software, the elements of the invention are the programs or code segments used to perform the required tasks. The program or code segments may be stored in a machine readable medium or transmitted over transmission media or communication links by a data signal carried in a carrier wave. A "machine-readable medium" may include any medium that can store or transfer information. Examples of machine-readable media include electronic circuitry, semiconductor memory devices, ROM, flash memory, erasable ROM (EROM), floppy disks, CD-ROMs, optical disks, hard disks, fiber optic media, radio Frequency (RF) links, and the like. The code segments may be downloaded via computer networks such as the internet, intranets, etc.
It should also be noted that the exemplary embodiments mentioned in this disclosure describe some methods or systems based on a series of steps or devices. However, the present invention is not limited to the order of the above-described steps, that is, the steps may be performed in the order mentioned in the embodiments, or may be performed in a different order from the order in the embodiments, or several steps may be performed simultaneously.
In the foregoing, only the specific embodiments of the present invention are described, and it will be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the systems, modules and units described above may refer to the corresponding processes in the foregoing method embodiments, which are not repeated herein. It should be understood that the scope of the present invention is not limited thereto, and any equivalent modifications or substitutions can be easily made by those skilled in the art within the technical scope of the present invention, and they should be included in the scope of the present invention.
Claims (8)
1. A method of route planning, the method comprising:
obtaining a starting point position, an end point position, a total tour duration of a user and preference degree scores of the user for each scenic spot;
determining scenery points to be inserted and the insertion positions of the scenery points to be inserted in the current route from the starting point position to the end point position according to the preference degree score;
calculating the tour time length corresponding to the first target route after the scenic spot to be inserted is inserted into the insertion position;
If the tour time is not longer than the tour total time, inserting the scenic spot to be inserted into the insertion position;
returning the preference degree score, and determining scenic spots to be inserted and the scenic spot to be inserted to be continuously executed for the insertion position in the current route from the starting point position to the end point position in scenic spots which are not covered by the current route;
if the tour time length is greater than the tour total time length, determining the current route as a planned route;
the determining, according to the preference degree score, the scenic spot to be inserted and the insertion position of the scenic spot to be inserted in the current route from the starting point position to the end point position, wherein the scenic spot is not covered by the current route, includes:
for each of the attractions not covered by the current route from the starting point location to the ending point location, calculating a corresponding time consumption between insertion of the attraction into two neighboring attractions in the current route; determining a minimum insertion cost of the attraction according to the time consumption; taking the position between two adjacent scenic spots corresponding to the minimum insertion cost as the insertion position of the scenic spot;
Calculating the insertion ratio of each scenic spot according to the preference degree score and the minimum insertion cost; taking the scenic spot corresponding to the highest insertion rate as the scenic spot to be inserted;
the insertion ratio is expressed as follows:
wherein the ratio p For the insertion ratio, profit p For the preference degree score, a shiftCluster p For the minimum insertion cost;
the determining the minimum insertion cost of the scenic spot according to the time consumption comprises the following steps:
if the scenic spot and the former scenic spot and/or the latter scenic spot in the two adjacent scenic spots are/is located in the same scenic spot cluster, the ratio of the scenic spot cluster parameter values corresponding to the scenic spot cluster with the minimum time consumption is used as the minimum insertion cost of the scenic spot;
and if the scenic spot is not located in the same scenic spot cluster with the previous scenic spot and the next scenic spot, the minimum time consumption is used as the minimum insertion cost of the scenic spot.
2. The method of claim 1, wherein prior to said inserting the point of interest to be inserted into the insertion location, the method further comprises:
for each scenic spot covered by the first target route, determining whether the tour of the scenic spot by the user meets the requirements of the opening time and the closing time of the scenic spot according to the duration and the starting time of the user for browsing the scenic spot; and if each scenic spot covered by the first target route is determined that the tour of the scenic spot by the user meets the requirements of the opening time and the closing time of the scenic spot, inserting the scenic spot to be inserted into the insertion position.
3. The method according to claim 1, wherein the method further comprises:
taking the planned route as an intermediate planned route;
comparing the number of times of deleting a preset number of scenic spots from scenic spots covered by the intermediate planning route with the preset maximum iteration number without improvement;
if the number of times is equal to the maximum iteration number, determining the intermediate planned route as a final planned route;
if the number of times is smaller than the maximum iteration number, deleting a preset number of scenic spots from scenic spots covered by the intermediate planning route to obtain a second target route, and adding 1 to the number of times;
determining scenery points to be inserted and the insertion positions of the scenery points to be inserted to the second target route from scenery points which are not covered by the second target route according to the preference degree scores;
calculating the tour time length corresponding to the third target route after the scenic spot to be inserted is inserted into the insertion position;
if the tour time is not longer than the tour total time, inserting the scenic spot to be inserted into the insertion position;
returning the score according to the preference degree, and determining scenic spots to be inserted from scenic spots which are not covered by the second target route and the insertion positions of the scenic spots to be inserted to the second target route to continue execution until the tour time is longer than the tour total time;
Comparing the first total preference degree score of the scenic spots covered by the current route with the second total preference degree score of the scenic spots covered by the middle planning route;
if the first total preference degree score is larger than the second total preference degree score, taking the current route as the middle planning route, and clearing the times; returning to the comparison, and continuously executing the times of deleting the preset number of scenic spots from scenic spots covered by the intermediate planning route and a preset maximum iteration time line without improvement;
if the first total preference degree score is equal to the second total preference degree score, comparing a first total tour duration corresponding to the current route with a second total tour duration corresponding to the intermediate planning route;
if the first total tour duration is not greater than the second total tour duration, taking the current route as the intermediate planning route, and clearing the times; returning to the comparison, and continuously executing the times of deleting the preset number of scenic spots from scenic spots covered by the intermediate planning route and the preset maximum iteration times without improvement;
if the first total time length of the tour is longer than the second total time length of the tour, returning to the comparison, and continuously executing the comparison of the number of times of deleting the preset number of scenic spots from scenic spots covered by the intermediate planning route and the preset maximum iteration number without improvement;
And if the first total preference degree score is not greater than the second total preference degree score, returning to the comparison, and continuing to execute the comparison of the number of times of deleting the preset number of scenic spots from scenic spots covered by the intermediate planning route and the preset maximum iteration number without improvement.
4. A path planning apparatus, the apparatus comprising:
the acquisition module is used for acquiring the starting point position, the end point position, the total tour duration and the preference degree score of the user for each scenic spot;
the first determining module is used for determining scenery spots to be inserted and the insertion positions of the scenery spots to be inserted in the current route from the starting point position to the end point position according to the preference degree score;
the calculation module is used for calculating the tour time length corresponding to the first target route after the scenic spot to be inserted is inserted into the insertion position;
the inserting module is used for inserting the scenic spot to be inserted into the inserting position if the tour time is not greater than the tour total time; triggering the first determining module;
the second determining module is used for determining the current route as a planned route if the tour time length is greater than the tour total time length;
The first determining module includes:
an insertion position determining unit configured to calculate, for each of the attractions not covered by the current route from the start point position to the end point position, a corresponding time consumption between two neighboring attractions of the attraction insertion in the current route; determining a minimum insertion cost of the attraction according to the time consumption; taking the position between two adjacent scenic spots corresponding to the minimum insertion cost as the insertion position of the scenic spot;
a to-be-inserted scenic spot determining unit, configured to calculate, for each scenic spot, an insertion ratio of the scenic spot according to the preference degree score and the minimum insertion cost; taking the scenic spot corresponding to the highest insertion rate as the scenic spot to be inserted; the insertion ratio is expressed as follows:
wherein the ratio p For the insertion ratio, profit p For the preference degree score, a shiftCluster p For the minimum insertion cost;
the insertion position determining unit is specifically configured to:
if the scenic spot and the former scenic spot and/or the latter scenic spot in the two adjacent scenic spots are/is located in the same scenic spot cluster, the ratio of the scenic spot cluster parameter values corresponding to the scenic spot cluster with the minimum time consumption is used as the minimum insertion cost of the scenic spot;
And if the scenic spot is not located in the same scenic spot cluster with the previous scenic spot and the next scenic spot, the minimum time consumption is used as the minimum insertion cost of the scenic spot.
5. The apparatus of claim 4, wherein the apparatus further comprises:
the third determining module is used for determining whether the tour of the scenic spot by the user meets the requirements of the opening time and the closing time of the scenic spot according to the duration and the starting time of the user for browsing the scenic spot for each scenic spot covered by the first target route; and if each scenic spot covered by the first target route is aimed at, determining that the requirement of the opening time and the closing time of the scenic spot is met by the user for the sightseeing of the scenic spot, and triggering an inserting module.
6. The apparatus of claim 4, wherein the apparatus further comprises:
the route optimization module is used for taking the planned route as an intermediate planned route;
comparing the number of times of deleting a preset number of scenic spots from scenic spots covered by the intermediate planning route with the preset maximum iteration number without improvement;
if the number of times is equal to the maximum iteration number, determining the intermediate planned route as a final planned route;
If the number of times is smaller than the maximum iteration number, deleting a preset number of scenic spots from scenic spots covered by the intermediate planning route to obtain a second target route, and adding 1 to the number of times;
determining scenery points to be inserted and the insertion positions of the scenery points to be inserted to the second target route from scenery points which are not covered by the second target route according to the preference degree scores;
calculating the tour time length corresponding to the third target route after the scenic spot to be inserted is inserted into the insertion position;
if the tour time is not longer than the tour total time, inserting the scenic spot to be inserted into the insertion position;
returning the score according to the preference degree, and determining scenic spots to be inserted from scenic spots which are not covered by the second target route and the insertion positions of the scenic spots to be inserted to the second target route to continue execution until the tour time is longer than the tour total time;
comparing the first total preference degree score of the scenic spots covered by the current route with the second total preference degree score of the scenic spots covered by the middle planning route;
if the first total preference degree score is larger than the second total preference degree score, taking the current route as the middle planning route, and clearing the times; returning to the comparison, and continuously executing the times of deleting the preset number of scenic spots from scenic spots covered by the intermediate planning route and a preset maximum iteration time line without improvement;
If the first total preference degree score is equal to the second total preference degree score, comparing a first total tour duration corresponding to the current route with a second total tour duration corresponding to the intermediate planning route;
if the first total tour duration is not greater than the second total tour duration, taking the current route as the intermediate planning route, and clearing the times; returning to the comparison, and continuously executing the times of deleting the preset number of scenic spots from scenic spots covered by the intermediate planning route and the preset maximum iteration times without improvement;
if the first total time length of the tour is longer than the second total time length of the tour, returning to the comparison, and continuously executing the comparison of the number of times of deleting the preset number of scenic spots from scenic spots covered by the intermediate planning route and the preset maximum iteration number without improvement;
and if the first total preference degree score is not greater than the second total preference degree score, returning to the comparison, and continuing to execute the comparison of the number of times of deleting the preset number of scenic spots from scenic spots covered by the intermediate planning route and the preset maximum iteration number without improvement.
7. A route planning device, the device comprising: a memory, a processor, and a computer program stored on the memory and executable on the processor;
A route planning method according to any one of claims 1 to 3 when the processor executes the computer program.
8. A computer readable storage medium, characterized in that the computer readable storage medium has stored thereon a computer program which, when executed by a processor, implements a route planning method according to any of claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811422192.XA CN111222667B (en) | 2018-11-27 | 2018-11-27 | Route planning method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811422192.XA CN111222667B (en) | 2018-11-27 | 2018-11-27 | Route planning method, device, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111222667A CN111222667A (en) | 2020-06-02 |
| CN111222667B true CN111222667B (en) | 2023-09-19 |
Family
ID=70806264
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811422192.XA Active CN111222667B (en) | 2018-11-27 | 2018-11-27 | Route planning method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111222667B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112465176B (en) * | 2020-12-10 | 2022-05-10 | 南京领行科技股份有限公司 | Driving route planning method and device |
| CN112541021B (en) * | 2020-12-10 | 2024-05-03 | 北京百度网讯科技有限公司 | Route evaluation method, scenic spot tour estimated time length calculation method and device |
| CN113689025B (en) * | 2021-07-08 | 2023-12-01 | 湖南中惠旅智能科技有限责任公司 | Scenic spot playing item planning method and system based on electronic map |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1871499A (en) * | 2003-09-30 | 2006-11-29 | 株式会社建伍 | Guide route search device and guide route search method |
| CN101236095A (en) * | 2008-03-06 | 2008-08-06 | 倚天资讯股份有限公司 | Navigation system |
| TW200936988A (en) * | 2008-02-19 | 2009-09-01 | E Ten Information Sys Co Ltd | Navigation system, method of automatically planning trip itinerary, computer readable recording media with stored program and computer program product with stored program |
| CN104036441A (en) * | 2013-03-06 | 2014-09-10 | 中兴通讯股份有限公司 | Tourist guide system and tourist guide method |
| WO2016044855A1 (en) * | 2014-09-19 | 2016-03-24 | Arris Enterprises, Inc. | Systems and methods for street level routing |
| CN106447097A (en) * | 2016-09-20 | 2017-02-22 | 北京工业大学 | Method for inquiring limited longest frequent path |
| CN107025495A (en) * | 2015-12-17 | 2017-08-08 | Sap欧洲公司 | The complexity for determining the route for carrying containers is reduced based on user's selection |
| CN107704508A (en) * | 2017-08-31 | 2018-02-16 | 北京空间飞行器总体设计部 | The data fusion and data digging method of polymorphic type magnanimity extraterrestrial target data |
| CN107748937A (en) * | 2017-11-03 | 2018-03-02 | 哈尔滨工业大学 | A kind of ratio section preference guiding multiobiective decision optimum method based on MOEAD |
| CN107832872A (en) * | 2017-10-19 | 2018-03-23 | 金华航大北斗应用技术有限公司 | Dynamic programming method for scenic spot route |
| CN108108847A (en) * | 2017-12-29 | 2018-06-01 | 合肥工业大学 | A kind of paths planning method of electric business logistics last one kilometer dispatching |
-
2018
- 2018-11-27 CN CN201811422192.XA patent/CN111222667B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1871499A (en) * | 2003-09-30 | 2006-11-29 | 株式会社建伍 | Guide route search device and guide route search method |
| TW200936988A (en) * | 2008-02-19 | 2009-09-01 | E Ten Information Sys Co Ltd | Navigation system, method of automatically planning trip itinerary, computer readable recording media with stored program and computer program product with stored program |
| CN101236095A (en) * | 2008-03-06 | 2008-08-06 | 倚天资讯股份有限公司 | Navigation system |
| CN104036441A (en) * | 2013-03-06 | 2014-09-10 | 中兴通讯股份有限公司 | Tourist guide system and tourist guide method |
| WO2016044855A1 (en) * | 2014-09-19 | 2016-03-24 | Arris Enterprises, Inc. | Systems and methods for street level routing |
| CN107025495A (en) * | 2015-12-17 | 2017-08-08 | Sap欧洲公司 | The complexity for determining the route for carrying containers is reduced based on user's selection |
| CN106447097A (en) * | 2016-09-20 | 2017-02-22 | 北京工业大学 | Method for inquiring limited longest frequent path |
| CN107704508A (en) * | 2017-08-31 | 2018-02-16 | 北京空间飞行器总体设计部 | The data fusion and data digging method of polymorphic type magnanimity extraterrestrial target data |
| CN107832872A (en) * | 2017-10-19 | 2018-03-23 | 金华航大北斗应用技术有限公司 | Dynamic programming method for scenic spot route |
| CN107748937A (en) * | 2017-11-03 | 2018-03-02 | 哈尔滨工业大学 | A kind of ratio section preference guiding multiobiective decision optimum method based on MOEAD |
| CN108108847A (en) * | 2017-12-29 | 2018-06-01 | 合肥工业大学 | A kind of paths planning method of electric business logistics last one kilometer dispatching |
Non-Patent Citations (1)
| Title |
|---|
| "机场接送服务中基于协作的车次分配与调度方法研究";许争争;《中国博士学位论文全文数据库工程科技Ⅱ辑》;20170315;第C031-13页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111222667A (en) | 2020-06-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111222667B (en) | Route planning method, device, equipment and storage medium | |
| Khreich et al. | A survey of techniques for incremental learning of HMM parameters | |
| US9581454B2 (en) | Route information processing apparatus and route information processing method | |
| US20140323130A1 (en) | Trajectory-Aware Location-Based Hand-Offs | |
| CN105635962A (en) | Automated wlan radio map construction method and system | |
| CN105912683B (en) | A kind of chronologically-based path matching method | |
| CN108268971B (en) | Path searching method, device, processor and electronic device | |
| US9674083B2 (en) | Path calculation order deciding method, program and calculating apparatus | |
| CN110702133A (en) | Path planning method, robot and device with storage function | |
| CN111626489A (en) | Shortest path planning method and device based on time sequence difference learning algorithm | |
| CN114091763A (en) | Route planning method and device, readable medium and electronic equipment | |
| CN113108806B (en) | Path planning method, device, equipment and medium | |
| CN105159941B (en) | Data record lookup method and device | |
| US20210192371A1 (en) | Computer-readable recording medium, information processing apparatus, and data generating method | |
| WO2020162205A1 (en) | Optimization device, method, and program | |
| CN111159490B (en) | Method, device and equipment for processing pattern character strings | |
| CN111476075B (en) | CNN-based object detection method and device by using 1x1 convolution | |
| US9547983B2 (en) | Analysis method and analyzing device | |
| CN106034266B (en) | Optical route generation method and device | |
| CN111626168A (en) | Gesture recognition method, device, equipment and medium | |
| CN112764660A (en) | Method, apparatus, and computer-readable storage medium for data migration | |
| CN111736582A (en) | Path processing method and device, electronic equipment and computer readable storage medium | |
| CN115203552A (en) | Map interest point recommendation method and system based on deep learning model | |
| CN114646313A (en) | User track positioning method, electronic equipment and computer storage medium | |
| KR20190040863A (en) | Method and apparatus for providing supervised and extended restart in random walks for ranking and link prediction in networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |