CN109839120B - Route planning method, device, medium and electronic equipment - Google Patents
Route planning method, device, medium and electronic equipment Download PDFInfo
- Publication number
- CN109839120B CN109839120B CN201711195036.XA CN201711195036A CN109839120B CN 109839120 B CN109839120 B CN 109839120B CN 201711195036 A CN201711195036 A CN 201711195036A CN 109839120 B CN109839120 B CN 109839120B
- Authority
- CN
- China
- Prior art keywords
- interest
- constraint condition
- user
- interest point
- resource
- 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
Images
Abstract
The invention provides a journey planning method, a journey planning device, a journey planning medium and electronic equipment. The route planning method comprises the following steps: determining a resource constraint condition and an interest constraint condition for the journey planning according to a journey planning request input by a user; acquiring information of each interest point matched with the interest constraint condition; and planning the journey based on the resource constraint condition and the information of each interest point. The technical scheme of the embodiment of the invention can automatically plan the journey for the user according to the requirement of the user, solves the problem that the user needs to plan the journey by himself and takes much time and energy in the prior art, and simultaneously enables the planned journey to meet the personalized requirement of the user.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a journey planning method, a journey planning device, a journey planning medium and electronic equipment.
Background
With the improvement of living standard of people, travel becomes a normal state. At present, users generally need to query and plan travel routes according to the requirements of time and expense, such as planning which sights to visit, the tour order of the sights, which hotels to live, which meals to eat, and the like, and the preparation work at the early stage needs much effort and time.
Meanwhile, although the group tour can travel under the guidance of the tour guide, the problem of planning a travel route by the user is solved, the group tour often loses some fun of travel.
Therefore, how to automatically plan a journey to a user according to the requirement of the user becomes a technical problem to be solved urgently.
It is to be noted that the information disclosed in the above background section is only for enhancement of understanding of the background of the present invention and therefore may include information that does not constitute prior art known to a person of ordinary skill in the art.
Disclosure of Invention
An object of embodiments of the present invention is to provide a method, an apparatus, a medium, and an electronic device for route planning, which overcome one or more of the problems due to the limitations and disadvantages of the related art, at least to a certain extent.
Additional features and advantages of embodiments of the invention will be set forth in the detailed description which follows, or in part will be obvious from the description, or may be learned by practice of the invention.
According to a first aspect of the embodiments of the present invention, there is provided a trip planning method, including: determining a resource constraint condition and an interest constraint condition for the journey planning according to a journey planning request input by a user; acquiring information of each interest point matched with the interest constraint condition; and planning the journey based on the resource constraint condition and the information of each interest point.
In some embodiments of the present invention, based on the foregoing solution, performing a trip planning based on the resource constraint condition and the information of each point of interest includes: based on the resource constraint condition and the information of each interest point, selecting at least one interest point from the interest points, wherein the total resource consumption of the interest points meets the resource constraint condition; and planning the journey according to the information of the at least one interest point.
In some embodiments of the present invention, based on the foregoing solution, selecting at least one point of interest from the respective points of interest whose resource consumption sum satisfies the resource constraint condition based on the resource constraint condition and the information of the respective points of interest, includes: selecting the interest points one by one according to the sequence of the priority from high to low; after any interest point is selected, judging whether the resource constraint condition is met or not according to the sum of the resource consumption of all the selected interest points; if the resource constraint condition is determined to be met, taking any interest point as one of the at least one interest point, and continuously selecting the next interest point for judgment; and if the resource constraint condition is not satisfied, removing any interest point, and continuously selecting the next interest point until all the interest points are traversed.
In some embodiments of the present invention, based on the foregoing solution, after selecting any one of the points of interest, determining whether the resource constraint condition is satisfied according to a sum of resource consumption of all the selected points of interest includes: performing line-crossing processing on all the selected interest points to determine the minimum resource consumption of all the selected interest points; and judging whether the resource consumption sum of all the selected interest points meets the resource constraint condition or not according to the minimum resource consumption and the resource constraint condition.
In some embodiments of the present invention, based on the foregoing scheme, performing a series processing on all the selected interest points to determine minimum resource consumption of all the selected interest points includes: determining the travel sequence of all the selected interest points based on a solution of a traveler problem; and determining the minimum resource consumption of all the selected interest points according to the travel sequence of all the selected interest points, the resource consumption of each interest point in all the selected interest points and the resource consumption of going to each interest point.
In some embodiments of the present invention, based on the foregoing solution, selecting at least one point of interest from the respective points of interest whose resource consumption sum satisfies the resource constraint condition based on the resource constraint condition and the information of the respective points of interest, includes: sequencing the interest points according to the sequence of the priority from high to low; searching target interest points in the sorted interest points based on a dichotomy, wherein the resource consumption sum of an interest point set of which the priority is higher than the target interest point in the interest points meets the resource constraint condition, and the resource consumption sum of the interest point set and the target interest point does not meet the resource constraint condition; taking the interest point set as the at least one interest point.
In some embodiments of the present invention, based on the foregoing solution, the trip planning method further includes: acquiring a schedule which is planned based on the resource constraint condition and the information of each interest point and contains at least one interest point; predicting the position of the user in a preset time offset range at a preset time according to the schedule and the preset departure time; and acquiring the places of the specified types recommended to the user according to the positions, and adding the acquired places into the travel schedule.
In some embodiments of the present invention, based on the foregoing solution, the trip planning method further includes: in the travel process of the user, acquiring the position information and the corresponding time information of the user; judging whether the actual travel progress of the user is normal or not according to the travel arrangement planned for the user, the position information and the time information; and executing corresponding operation according to whether the actual travel progress of the user is normal or not.
In some embodiments of the present invention, based on the foregoing scheme, according to whether the actual travel progress of the user is normal, corresponding operations are performed, including: and if the actual travel progress of the user is earlier than the travel arrangement, recommending other interest points to the user according to the position information.
In some embodiments of the present invention, based on the foregoing scheme, according to whether the actual travel progress of the user is normal, corresponding operations are performed, including: and if the actual travel schedule of the user is behind the travel schedule, adjusting the travel schedule according to the actual travel schedule, or recommending interest points conforming to the normal schedule to the user according to the travel schedule.
In some embodiments of the present invention, based on the foregoing scheme, the resource constraint condition includes duration constraint information and/or cost constraint information; the interest constraints include: a destination and/or a specified point of interest of a destination; the information of each interest point comprises time length consumption and/or expense consumption of each interest point and position information of each interest point.
According to a second aspect of the embodiments of the present invention, there is provided a trip planning apparatus, including: the system comprises a determining unit, a processing unit and a processing unit, wherein the determining unit is used for determining a resource constraint condition and an interest constraint condition for route planning according to a route planning request input by a user; the first acquisition unit is used for acquiring the information of each interest point matched with the interest constraint condition; and the processing unit is used for planning the journey based on the resource constraint condition and the information of each interest point.
According to a third aspect of embodiments of the present invention, there is provided a computer-readable medium, on which a computer program is stored, which program, when executed by a processor, implements the trip planning method as described in the first aspect of the embodiments above.
According to a fourth aspect of embodiments of the present invention, there is provided an electronic apparatus, including: one or more processors; storage means for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to implement the trip planning method as described in the first aspect of the embodiments above.
In the technical solutions provided in some embodiments of the present invention, a resource constraint condition and an interest constraint condition for performing a trip planning are determined according to a trip planning request input by a user, and information of each interest point matched with the interest constraint condition is acquired, so that the trip planning is performed according to the resource constraint condition and the information of each interest point, so that a trip can be automatically planned for the user according to the user's requirement, thereby solving the problem that the user needs to plan the trip by himself in the prior art and spending much time and energy, and simultaneously enabling the planned trip to meet the personalized requirement of the user.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention, as claimed.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and together with the description, serve to explain the principles of the invention. It is obvious that the drawings in the following description are only some embodiments of the invention, and that for a person skilled in the art, other drawings can be derived from them without inventive effort. In the drawings:
fig. 1 schematically shows a flow chart of a trip planning method according to a first embodiment of the invention;
fig. 2 schematically shows a flowchart of a specific implementation of step S14 shown in fig. 1;
fig. 3 schematically shows a flowchart of a specific implementation of step S142 shown in fig. 2;
FIG. 4 schematically shows a flow chart of a trip planning method according to a second embodiment of the invention;
fig. 5 schematically shows a flow chart of a trip planning method according to a third embodiment of the invention;
fig. 6 schematically shows a flow chart of a trip planning method according to a fourth embodiment of the invention;
FIG. 7 schematically shows a flow diagram of a path planning algorithm according to an embodiment of the invention;
FIG. 8 schematically shows a flow diagram of a string algorithm according to an embodiment of the invention;
FIG. 9 schematically illustrates a flow diagram for integrating a holding row, according to an embodiment of the invention;
FIG. 10 schematically shows a flow diagram of real-time planning adjustments according to an embodiment of the invention;
FIG. 11 schematically shows a block diagram of a trip planning apparatus according to an embodiment of the present invention;
FIG. 12 schematically illustrates a block diagram of a computer system suitable for use with an electronic device to implement an embodiment of the invention.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art.
Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to provide a thorough understanding of embodiments of the invention. One skilled in the relevant art will recognize, however, that the invention may be practiced without one or more of the specific details, or with other methods, components, devices, steps, and so forth. In other instances, well-known methods, devices, implementations or operations have not been shown or described in detail to avoid obscuring aspects of the invention.
The block diagrams shown in the figures are functional entities only and do not necessarily correspond to physically separate entities. I.e. these functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor means and/or microcontroller means.
The flow charts shown in the drawings are merely illustrative and do not necessarily include all of the contents and operations/steps, nor do they necessarily have to be performed in the order described. For example, some operations/steps may be decomposed, and some operations/steps may be combined or partially combined, so that the actual execution sequence may be changed according to the actual situation.
Fig. 1 schematically shows a flow chart of a trip planning method according to a first embodiment of the invention.
Referring to fig. 1, a trip planning method according to a first embodiment of the present invention includes:
and step S12, determining resource constraint conditions and interest constraint conditions for the journey planning according to the journey planning request input by the user.
In the embodiment of the present invention, optionally, the journey planning request input by the user may include personal requirements of the user, such as an input resource constraint condition, an interest constraint condition, and the like, and further, journey planning may be performed according to the requirements of the user. If the journey planning request input by the user includes the resource constraint condition and the interest constraint condition, the resource constraint condition and the interest constraint condition can be extracted. If the user inputs a trip plan request that does not include resource constraints and interest constraints, these conditions may be determined based on a user representation (which is determined based on historical behavioral data of the user).
In embodiments of the invention, the resource constraints comprise duration constraint information (e.g. duration of scheduled tours) and/or cost constraint information (e.g. projected tour costs). The interest constraints include: a destination selected by the user and/or a specified point of interest of the destination. It should be noted that the destination selected by the user may be one or more cities, one or more countries, etc.; the specified interest point can be scenic spot information, hotel information, restaurant information and the like.
And step S14, acquiring the information of each interest point matched with the interest constraint condition.
In the embodiment of the present invention, if the interest constraint condition includes a destination selected by the user, each sight point information of the destination may be used as the information of the matched interest point. Of course, restaurant information, hotel information, and the like of the destination may be used as the information of the matching points of interest. If the interest constraint conditions contain the specified interest points of the destination, taking the specified interest points as matched interest points; if the interest constraint condition contains the destination and the interest point specified by the user, the interest point specified by the user and the related interest point (including scenic spots, hotels, restaurants, and the like) of the destination are taken as matched interest points.
It should be noted that: the information of each point of interest includes time duration consumption and/or cost consumption of each point of interest, and location information of each point of interest.
The time consumption of each interest point may be the time spent at each interest point, such as the time spent browsing the scenic spots, the time spent in restaurants, and the like. The cost consumption of each point of interest may be a cost spent at each point of interest, such as a cost spent browsing sights, a cost spent eating in restaurants, and the like. In the embodiment of the present invention, the visit duration and the visit fee of each sight spot can be determined according to the duration and the fee taken by the visited users to visit each sight spot, for example, the average visit duration and the average visit fee of all the visited users are used as the visit duration and the visit fee of the sight spots.
And step S16, planning the journey based on the resource constraint condition and the information of each interest point.
According to an exemplary embodiment of the present invention, as shown in fig. 2, step S16 may include:
step S162, based on the resource constraint condition and the information of each interest point, selecting at least one interest point from each interest point, wherein the total resource consumption of the interest points meets the resource constraint condition.
And step S164, planning a journey according to the information of the at least one interest point.
The steps S162 and S164 shown in fig. 2 will be described in detail below.
For step S162, the embodiment of the present invention provides the following two implementation manners:
the implementation mode is as follows:
referring to fig. 3, step S162 may include:
step S1621, selecting each interest point one by one according to the order of priority from high to low.
In an embodiment of the present invention, the priority between the points of interest may be determined according to the user profile and the comment of the public, such as determining the priority of each point of interest according to the preference of the user, determining the priority of each point of interest according to the rating of each point of interest, and the like. Further, if the user designates points of interest, the priority of the points of interest may be set to be the highest.
Step S1622, after selecting any one of the points of interest, determining whether the resource constraint condition is satisfied according to the sum of resource consumption of all the selected points of interest.
According to an exemplary embodiment of the present invention, step S1622 may include: performing line-crossing processing on all the selected interest points to determine the minimum resource consumption of all the selected interest points; and judging whether the resource consumption sum of all the selected interest points meets the resource constraint condition or not according to the minimum resource consumption and the resource constraint condition.
Optionally, when all the selected interest points are processed in a series manner, the travel sequence of all the selected interest points may be determined based on a solution of a traveler problem, and then the minimum resource consumption of all the selected interest points is determined according to the travel sequence of all the selected interest points, the resource consumption of each of the selected interest points, and the resource consumption of going to each of the selected interest points.
It should be noted that the resource consumption described in the embodiment of the present invention may include time consumption and/or cost consumption.
Step S1623, if it is determined that the resource constraint condition is satisfied, taking the any one of the interest points as one of the at least one interest point, and continuing to select a next interest point for judgment.
Step S1624, if the resource constraint condition is not satisfied, any interest point is removed, and the next interest point is continuously selected until all the interest points are completely traversed.
The technical scheme of the first implementation mode can arrange more scenic spots for the user as much as possible on the premise of meeting the resource constraint conditions.
The implementation mode two is as follows:
in an embodiment of the present invention, step S162 may include: sequencing the interest points according to the sequence of the priority from high to low; searching target interest points in the sorted interest points based on a dichotomy, wherein the resource consumption sum of an interest point set of which the priority is higher than the target interest point in the interest points meets the resource constraint condition, and the resource consumption sum of the interest point set and the target interest point does not meet the resource constraint condition; taking the interest point set as the at least one interest point.
The technical scheme of the second implementation mode can quickly determine the selected at least one interest point.
It should be noted that, in the embodiment of the present invention, when searching for the target interest point, the solution of the series processing described in the first implementation manner may also be used, so as to find the optimal tour order of the interest point set, and meanwhile, it can be ensured that the number of interest points in the interest point set is the largest as possible.
In an embodiment of the present invention, for step S164 shown in fig. 2, after at least one point of interest is selected, the route planning may be performed based on a solution of the traveler problem, for example, the solution may be performed by a double-tone euclidean traveler problem dynamic algorithm.
Referring to fig. 4, on the basis of the above embodiment, the trip planning method according to the embodiment of the present invention further includes the following steps:
step S402, acquiring a schedule containing at least one interest point planned based on the resource constraint condition and the information of each interest point.
In embodiments of the present invention, the schedule may include dwell periods, dwell time periods, etc. for various points of interest. Such as tour duration, tour time period, etc. of the scenic spot.
And step S404, predicting the position of the user in a preset time offset range at a preset time according to the schedule and the preset departure time.
In an embodiment of the present invention, the predetermined time may be a meal point time and/or a bedtime. The time of a meal point is the time of eating usually, the time of going to bed is the time of sleeping usually, and the predetermined time offset range can be a time range determined according to actual conditions. For example, if the meal point is twelve am and the predetermined time offset range is half an hour before and after, the location of the user from eleven am to twelve am may be predicted according to the predetermined departure time and the schedule of the at least one point of interest.
And step S406, acquiring a place of a specified type recommended to the user according to the position, and adding the acquired place into the travel schedule.
In an embodiment of the present invention, the place of the specified type may be a restaurant or a hotel, and the restaurant and/or the hotel recommended to the user may be the restaurant and/or the hotel with the highest score, or may be the restaurant and/or the hotel determined according to the preference of the user.
Referring to fig. 5, on the basis of the above embodiment, the trip planning method according to the embodiment of the present invention further includes the following steps:
step S502, in the user 'S travel process, obtaining the user' S position information and corresponding time information.
It should be noted that, when acquiring the location information of the user and the corresponding time information, the location information may be acquired in real time or may be acquired periodically.
Step S504, according to the planned travel arrangement, the position information and the time information, whether the actual travel progress of the user is normal is judged.
It should be noted that, generally, what sights are visited in what time periods are scheduled in the schedule, so it can be determined whether the actual schedule of the user is normal according to the schedule, the location information of the user and the corresponding time information.
And step S506, executing corresponding operation according to whether the actual travel progress of the user is normal.
In the embodiment of the invention, for example, if the actual travel schedule of the user is earlier than the travel schedule, other nearby interest points are recommended to the user according to the position information; if the actual travel schedule of the user lags behind the travel schedule, adjusting the travel schedule according to the actual travel schedule, or recommending interest points conforming to the normal schedule to the user according to the travel schedule; if the actual travel progress of the user is normal, services such as tour guide and the like can be provided for the user.
According to the technical scheme of the embodiment of the invention, the proper route arrangement can be automatically planned for the user according to the requirement of the user, so that the problem that the user needs to plan the route by himself and much time and energy are spent in the prior art can be solved, and the planned route can meet the personalized requirement of the user.
The following describes the technical solution of the embodiment of the present invention in detail by taking resource constraint conditions as time and cost, and interest constraint conditions as desired destinations and desired scenic spots as examples:
generally, a user trip generally has two major factors: resources and willingness. The resources comprise time and expense of the user; willingness, i.e., interest, includes the destination the user wants to go to and the sights the user wants to play with. Therefore, the planning algorithm of the embodiment of the invention needs to do: under the constraints of user cost and time, the value of user intention is maximized as much as possible. Thus, referring to fig. 6, a trip planning method according to an embodiment of the present invention includes:
step S602, receiving the time, the location, the necessary scenic spots and the cost requirement input by the user.
And step S604, calculating a travel list meeting the requirements of the user by using a path planning algorithm.
In step S606, a trip list is output.
In the three steps, focusing on step S604, in the embodiment of the present invention, the process of calculating the itinerary meeting the user' S needs by the path planning algorithm may be as follows:
assuming that the destination attraction list array is a, each attraction in a satisfies the requirement of being at least accessible within the user's time cost requirements.
In one embodiment of the invention, the sights in A are sorted in descending order of priority, and the path planning algorithm begins to traverse A: and putting a C list from A to the view point one by one, and then executing a string algorithm on the C list. Wherein, every time an element is taken from A and put into C, the element in C is executed with a series algorithm once to calculate the minimum time and cost for confirming whether the time and cost constraint of the user is satisfied. If yes, continuing to fetch elements from the A; if not, the fetched sight is discarded, and then the fetching of elements from A continues until the elements in A are traversed all over.
The above algorithm may enable as many attractions as possible to be scheduled into the user's itinerary with a temporal complexity of O (N ^ 3).
The flow of the path planning algorithm is shown in fig. 7, and includes:
and step S701, the priority of the scenic spots needing to be visited is promoted.
Step S702, the scenic spots are sorted according to the priority to obtain a list A.
And step S703, selecting one scenic spot from the list A in sequence and placing the scenic spot into the C.
Step S704, execute a string algorithm on the elements in C.
Step S705, judging whether the time and cost constraint is met after the elements in the step C are subjected to wire connection, if so, executing step S707; otherwise, step S706 is performed.
And step S706, deleting the sight points added last from the C.
Step S707, judging whether the element in A is completely taken, if yes, executing step S708; otherwise, return to step S703.
In step S708, the optimal trip list C is output.
In another embodiment of the present invention, the strategy of the path planning algorithm may be: and if the (N + 1) th sight spot in the A array is not satisfied, interrupting the traversal. Thus, A can be traversed by bisection until the maximum accessible array subscript is found, that is, the target sight in array A is found, and the minimum time and cost spent by all sights (which may include the target sight) before the target sight (sorted from high to low by priority) satisfy the event and cost constraints of the user, and the complexity of the algorithm is O (N2 LogN).
It should be noted that, when processing the priority, in addition to calculating the priority of the scenery spot according to the user portrait and the public comment, the priority of the scenery spot input by the user and the priority of the deleted scenery spot can be processed. Such as: the user's destination is Beijing, and he must input that the scenic spots are the great wall and the Imperial palace, and then can refer the priority of the two scenic spots to the highest, and then proceed with path planning. If the scenic spots are planned for the user, the user has disliked scenic spots, and the corresponding priority is reduced and then the path planning is carried out.
In addition, in the embodiment of the invention, when processing other non-scenic spots such as having to eat a restaurant or having to live a hotel and shopping, the non-scenic spot types can be temporarily converted into scenic spot types and added into the scenic spot planning list for processing. When the inter-city planning or the inter-country planning is processed, the country and the city can be used as a scenic spot and added into the scenic spot list for planning. Similarly, the path planning scheme of the embodiment of the invention is also suitable for planning the peripheral trip, and can select any time granularity for calculation and planning.
It should be noted that in the embodiment of the present invention, the scenic spots are generally considered as tour time, tour cost, location, etc., so when converting a non-scenic spot into a scenic spot, the non-scenic spot can be converted into a scenic spot according to the time and cost spent on going to the non-scenic spot and the location where the non-scenic spot is located.
In an embodiment of the invention, the crosshairs are traveler problems, and in an embodiment of the invention, a dynamic canonicalization algorithm is used to solve. The specific execution steps are as follows:
1. input set C, for example: the set C includes sights 1, 2, 3, 4, and 5.
2. And calculating and marking a route sequence according to the dynamic programming transfer equation of the following formula. Assume the route sequence is: 2. 1, 4, 5 and 3.
Let j > -
In the formula, the scenic spots in the set C are sorted (specifically, the scenic spots can be sorted from small to large according to the x coordinate of the position of the scenic spot), so that a scene sequence from left to right is obtained, wherein i represents the ith scenic spot; j represents the jth sight; k represents the kth sight; c [ i, j ] represents the time consumption of traversing all the scenic spots on the left of the scenic spot j from the scenic spot i to the scenic spot 1 and then from the scenic spot 1 to the scenic spot j; w (i, j) represents the time consumption of sight i directly to sight j.
3. If the starting point is 1, then the sequence also needs to be circularly shifted to: 1. 4, 5, 3 and 2.
4. The final string result D sequence is 1, 4, 5, 3, 2.
As shown in fig. 8, the process includes:
in step S801, a set C is input.
And S802, solving a dynamic programming algorithm of the double-tone Euclidean problem.
In step S803, the calculated route is recorded.
In step S804, a path sequence D is recursively obtained.
In step S805, the start point is cyclically shifted to the first position for the sequence D.
Step S806, the optimal path D is output.
In practical application scenarios, users need to eat, shop, and other consuming and entertaining behaviors besides playing. If the total number of days requested by the user is d, the play time in one day is T1, the eating time is T2, and the others are T3, the total time T is (T1+ T2+ T3) d, and the time constraint used in constructing the aforementioned attraction sequence C is T1 d.
In an embodiment of the invention, after constructing a tour containing sights, the stuttering may also be integrated in the tour, as follows:
1. traversing the sequence D, and sequentially adding the scenery spots X in the sequence D into the sequence array E.
2. And accumulating the activity time in the E according to the arrangement of the scenic spots in the E, and simultaneously obtaining the time of visiting the scenic spot X in one day according to the departure time.
3. The actual time is compared to the meal time, and the best restaurant that meets the time T2 and is near the current or next attraction is selected by the offset and added to the E array.
4. And calculating whether the night comes or not by the same method, and then taking nearby hotels to add into the E array until the D sequence is traversed.
The specific flow of integrated eating is shown in fig. 9, and includes the following steps:
step S901, traverse the sight spot trip sequence D.
And step S902, taking one scenic spot X from the D and placing the scenic spot X into the E.
Step S903, judging whether the element in D is completely taken out, if yes, executing step S909; otherwise, step S904 is executed.
In step S904, the current time T is obtained by accumulation as the distance plus the sight spot playing time.
Step S905, judging whether T is at a rice point, if so, executing step S906; otherwise, step S907 is performed.
In step S906, the optimal restaurant near the finder point X joins E, and then returns to step S902.
Step 907, if T is the bedtime, go to step 908; otherwise, return to step S902.
Step S908, the optimal hotel near the finder point X joins E, and then returns to step S902.
In step S909, the integrated stroke E is output.
It should be noted that, in fig. 9, it is determined whether T is at a meal point first, and then it is determined whether T is at bedtime, and those skilled in the art should understand that this is merely an example, and in other embodiments of the present invention, it may be determined whether T is at the bedtime first, and then it is determined whether T is at the meal point; or whether T is at a meal point or at bedtime can be judged at the same time.
The technical scheme shown in fig. 9 realizes the intelligent travel planning of integrated eating and staying, and greatly improves the use experience of the user.
When a user goes out according to a planned trip, the embodiment of the invention can also perform real-time planning and adjustment according to the actual progress of the user trip, and the specific idea is as follows: whether the user deviates from the route is determined according to the current position and the current time of the user, so that real-time travel planning is performed, and high-quality travel can be provided by combining with guide services in scenic spots. The specific process is as follows:
1. the location and current time returned by the user terminal are compared to the planned itinerary list E.
2. And judging whether the current progress is normal, if so, providing the guide service, and certainly providing other services, or recommending a next scenic spot and a traffic mode for reaching the next scenic spot to the user.
3. If the current progress is advanced, performing operation a, such as: recommending other nearby sights, shopping malls, etc.
4. If the current progress is behind, operation B is performed, such as: giving a route scheme for reaching the next reachable scenic spot, or adjusting the travel list, and the like.
The corresponding flow chart is shown in fig. 10, and includes:
in step S1001, the user position P and the current time T are acquired.
In step S1002, P, T is compared with the trip list E.
Step S1003, determining whether the travel progress is normal, if so, executing step S1004; otherwise, step S1005 is performed.
In step S1004, the next attraction and/or the transportation mode to the next attraction are recommended, and a guide service and the like may be provided.
Step S1005, judging whether the travel progress is advanced, if so, executing step S1006; otherwise, step S1007 is executed.
In step S1006, nearby entertainment venues or other attractions of recommended accessories are recommended, and the process returns to step S1002 to continue the comparison.
Step 1007, a route scheme to the next reachable sight is given, and the step returns to step 1002 to continue comparison.
The technical scheme shown in fig. 10 can dynamically guide the user to go out in real time, and thus a high-quality going-out scheme can be provided for the user.
In addition, a technical solution of an embodiment of the present invention further provides a trip planning apparatus, specifically referring to fig. 11, where the trip planning apparatus 1100 includes: a determination unit 1102, a first acquisition unit 1103, and a processing unit 1104.
Specifically, the determining unit 1102 is configured to determine a resource constraint condition and an interest constraint condition for route planning according to a route planning request input by a user; the first obtaining unit 1103 is configured to obtain information of each interest point matching the interest constraint condition; the processing unit 1104 is configured to perform route planning based on the resource constraint conditions and the information of the respective points of interest.
In some embodiments of the present invention, based on the foregoing solution, the processing unit 1104 includes: a selection unit and a planning unit. Specifically, the selecting unit is configured to select, based on the resource constraint condition and the information of each interest point, at least one interest point from the interest points, where a total resource consumption sum of the interest points satisfies the resource constraint condition; the planning unit is used for planning a journey according to the information of the at least one interest point.
In some embodiments of the present invention, based on the foregoing solution, the selecting unit is configured to: selecting the interest points one by one according to the sequence of the priority from high to low; after any interest point is selected, judging whether the resource constraint condition is met or not according to the sum of the resource consumption of all the selected interest points; if the resource constraint condition is determined to be met, taking any interest point as one of the at least one interest point, and continuously selecting the next interest point for judgment; and if the resource constraint condition is not satisfied, removing any interest point, and continuously selecting the next interest point until all the interest points are traversed.
In some embodiments of the present invention, based on the foregoing solution, the selecting unit is configured to: performing line-crossing processing on all the selected interest points to determine the minimum resource consumption of all the selected interest points; and judging whether the resource consumption sum of all the selected interest points meets the resource constraint condition or not according to the minimum resource consumption and the resource constraint condition.
In some embodiments of the present invention, based on the foregoing solution, the selecting unit is configured to: determining the travel sequence of all the selected interest points based on a solution of a traveler problem; and determining the minimum resource consumption of all the selected interest points according to the travel sequence of all the selected interest points, the resource consumption of each interest point in all the selected interest points and the resource consumption of going to each interest point.
In some embodiments of the present invention, based on the foregoing solution, the selecting unit is configured to: sequencing the interest points according to the sequence of the priority from high to low; searching target interest points in the sorted interest points based on a dichotomy, wherein the resource consumption sum of an interest point set of which the priority is higher than the target interest point in the interest points meets the resource constraint condition, and the resource consumption sum of the interest point set and the target interest point does not meet the resource constraint condition; taking the interest point set as the at least one interest point.
In some embodiments of the present invention, based on the foregoing solution, the method further includes: a second acquisition unit and a prediction unit. Specifically, the second obtaining unit is configured to obtain a schedule including at least one point of interest, which is planned based on the resource constraint condition and the information of each point of interest; the prediction unit is used for predicting the position of the user in a preset time offset range at a preset time according to the schedule and the preset departure time; the processing unit 1104 is further configured to obtain a location of a specified type recommended to the user according to the position, and add the obtained location to the schedule.
In some embodiments of the present invention, based on the foregoing solution, the method further includes: the device comprises a third acquisition unit, a judgment unit and an execution unit. Specifically, the third obtaining unit is configured to obtain location information and corresponding time information of the user during a trip process of the user; the judging unit is used for judging whether the actual travel progress of the user is normal or not according to the travel arrangement planned for the user, the position information and the time information; and the execution unit is used for executing corresponding operation according to whether the actual travel progress of the user is normal.
In some embodiments of the present invention, based on the foregoing solution, the execution unit is configured to recommend other points of interest to the user according to the location information when the actual travel schedule of the user is earlier than the travel schedule.
In some embodiments of the present invention, based on the foregoing solution, the execution unit is configured to, when the actual schedule of the user lags behind the schedule, adjust the schedule according to the actual schedule, or recommend an interest point meeting a normal schedule to the user according to the schedule.
In some embodiments of the present invention, based on the foregoing scheme, the resource constraint condition includes duration constraint information and/or cost constraint information; the interest constraints include: a destination and/or a specified point of interest of a destination; the information of each interest point comprises time length consumption and/or expense consumption of each interest point and position information of each interest point.
Referring now to FIG. 12, shown is a block diagram of a computer system 1200 suitable for use with the electronic device implementing an embodiment of the present invention. The computer system 1200 of the electronic device shown in fig. 12 is only an example, and should not bring any limitation to the function and the scope of use of the embodiments of the present invention.
As shown in fig. 12, the computer system 1200 includes a Central Processing Unit (CPU)1201, which can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)1202 or a program loaded from a storage section 1208 into a Random Access Memory (RAM) 1203. In the RAM 1203, various programs and data necessary for system operation are also stored. The CPU 1201, ROM 1202, and RAM 1203 are connected to each other by a bus 1204. An input/output (I/O) interface 1205 is also connected to bus 1204.
The following components are connected to the I/O interface 1205: an input section 1206 including a keyboard, a mouse, and the like; an output portion 1207 including a display device such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 1208 including a hard disk and the like; and a communication section 1209 including a network interface card such as a LAN card, a modem, or the like. The communication section 1209 performs communication processing via a network such as the internet. A driver 1210 is also connected to the I/O interface 1205 as needed. A removable medium 1211, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like, is mounted on the drive 1210 as necessary, so that a computer program read out therefrom is mounted into the storage section 1208 as necessary.
In particular, according to an embodiment of the present invention, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the invention include a computer program product comprising a computer program embodied on a computer-readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 1209, and/or installed from the removable medium 1211. The computer program performs the above-described functions defined in the system of the present application when executed by the Central Processing Unit (CPU) 1201.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in the embodiments of the present invention may be implemented by software, or may be implemented by hardware, and the described units may also be disposed in a processor. Wherein the names of the elements do not in some way constitute a limitation on the elements themselves.
As another aspect, the present application also provides a computer-readable medium, which may be contained in the electronic device described in the above embodiments; or may exist separately without being assembled into the electronic device. The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to implement the trip planning method as described in the above embodiments.
For example, the electronic device may implement the following as shown in fig. 1: step S12, according to the travel planning request input by the user, determining the resource constraint condition and the interest constraint condition for the travel planning; step S14, obtaining the information of each interest point matched with the interest constraint condition; and step S16, planning the journey based on the resource constraint condition and the information of each interest point.
As another example, the electronic device may implement the various steps shown in fig. 2-10.
It should be noted that although in the above detailed description several modules or units of the device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit, according to embodiments of the invention. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiment of the present invention can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which can be a personal computer, a server, a touch terminal, or a network device, etc.) to execute the method according to the embodiment of the present invention.
Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the invention and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.
It will be understood that the invention is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the invention is limited only by the appended claims.
Claims (10)
1. A method of trip planning, comprising:
determining a resource constraint condition and an interest constraint condition for route planning according to a route planning request input by a user, and if the route planning request input by the user does not contain the resource constraint condition and the interest constraint condition, determining the resource constraint condition and the interest constraint condition according to a user portrait of the user;
acquiring information of each interest point matched with the interest constraint condition;
based on the resource constraint condition and the information of each interest point, selecting at least one interest point from each interest point, wherein the total resource consumption sum of the interest points meets the resource constraint condition, and performing route planning according to the information of the at least one interest point;
wherein the selecting, based on the resource constraint condition and the information of each interest point, at least one interest point from the interest points whose resource consumption sum satisfies the resource constraint condition includes:
determining the priority of each interest point according to the user portrait, the interest constraint conditions and the good evaluation rate of each interest point, and selecting each interest point one by one according to the sequence of the priority from high to low;
performing line-crossing processing on all selected interest points, and determining the travel sequence of all the selected interest points based on a solution of a traveler problem, wherein the traveler problem is solved by using a double-tone Euclidean problem dynamic programming algorithm;
determining the minimum resource consumption of all the selected interest points according to the travel sequence of all the selected interest points, the resource consumption of each interest point in all the selected interest points and the resource consumption of going to each interest point;
judging whether the resource consumption sum of all the selected interest points meets the resource constraint condition or not according to the minimum resource consumption and the resource constraint condition;
if the resource constraint condition is determined to be met, taking any interest point as one of the at least one interest point, and continuously selecting the next interest point for judgment;
and if the resource constraint condition is not satisfied, removing any interest point, and continuously selecting the next interest point until all the interest points are traversed.
2. The trip planning method according to claim 1, wherein selecting at least one point of interest from the points of interest whose resource consumption sum satisfies the resource constraint condition based on the resource constraint condition and the information of the points of interest comprises:
sequencing the interest points according to the sequence of the priority from high to low;
searching target interest points in the sorted interest points based on a dichotomy, wherein the resource consumption sum of an interest point set of which the priority is higher than the target interest point in the interest points meets the resource constraint condition, and the resource consumption sum of the interest point set and the target interest point does not meet the resource constraint condition;
taking the interest point set as the at least one interest point.
3. The trip planning method according to claim 1, further comprising:
acquiring a schedule which is planned based on the resource constraint condition and the information of each interest point and contains at least one interest point;
predicting the position of the user in a preset time offset range at a preset time according to the schedule and the preset departure time;
and acquiring the places of the specified types recommended to the user according to the positions, and adding the acquired places into the travel schedule.
4. The trip planning method according to claim 1, further comprising:
in the travel process of the user, acquiring the position information and the corresponding time information of the user;
judging whether the actual travel progress of the user is normal or not according to the travel arrangement planned for the user, the position information and the time information;
and executing corresponding operation according to whether the actual travel progress of the user is normal or not.
5. The trip planning method according to claim 4, wherein the corresponding operation is executed according to whether the actual trip progress of the user is normal, and includes:
and if the actual travel progress of the user is earlier than the travel arrangement, recommending other interest points to the user according to the position information.
6. The trip planning method according to claim 4, wherein the corresponding operation is executed according to whether the actual trip progress of the user is normal, and includes:
and if the actual travel schedule of the user is behind the travel schedule, adjusting the travel schedule according to the actual travel schedule, or recommending interest points conforming to the normal schedule to the user according to the travel schedule.
7. The trip planning method according to any one of claims 1 to 6, characterized in that:
the resource constraint condition comprises duration constraint information and/or cost constraint information;
the interest constraints include: a destination and/or a specified point of interest of a destination;
the information of each interest point comprises time length consumption and/or expense consumption of each interest point and position information of each interest point.
8. A trip planning apparatus, comprising:
the system comprises a determining unit, a processing unit and a processing unit, wherein the determining unit is used for determining a resource constraint condition and an interest constraint condition for route planning according to a route planning request input by a user, and if the route planning request input by the user does not contain the resource constraint condition and the interest constraint condition, the resource constraint condition and the interest constraint condition are determined according to a user portrait;
the first acquisition unit is used for acquiring the information of each interest point matched with the interest constraint condition;
the processing unit is used for selecting at least one interest point with the resource consumption sum meeting the resource constraint condition from the interest points based on the resource constraint condition and the information of the interest points, and planning a route according to the information of the interest points;
wherein the processing unit comprises:
the interest point sorting unit is used for determining the priority of each interest point according to the user portrait, the interest constraint condition and the good rating of each interest point and selecting each interest point one by one according to the sequence of the priority from high to low;
the route-crossing processing unit is used for carrying out route-crossing processing on all the selected interest points and determining the route sequence of all the selected interest points based on a solution of a traveler problem, wherein the traveler problem is solved by using a double-tone Euclidean problem dynamic programming algorithm;
a minimum resource consumption determining unit, configured to determine minimum resource consumption of all the selected interest points according to the travel sequence of all the selected interest points, resource consumption of each of the selected interest points, and resource consumption of going to each of the selected interest points;
a constraint condition judging unit, configured to judge whether the sum of resource consumption of all the selected interest points satisfies the resource constraint condition according to the minimum resource consumption and the resource constraint condition;
the interest point determining unit is used for taking any interest point as one of the at least one interest point and continuously selecting the next interest point for judgment if the resource constraint condition is determined to be met;
and the interest point traversing unit is used for eliminating any interest point and continuously selecting the next interest point if the resource constraint condition is not met, until all the interest points are traversed.
9. A computer-readable medium, on which a computer program is stored which, when being executed by a processor, carries out a trip planning method according to any one of claims 1 to 7.
10. An electronic device, comprising:
one or more processors;
storage means for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to carry out a trip planning method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711195036.XA CN109839120B (en) | 2017-11-24 | 2017-11-24 | Route planning method, device, medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711195036.XA CN109839120B (en) | 2017-11-24 | 2017-11-24 | Route planning method, device, medium and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109839120A CN109839120A (en) | 2019-06-04 |
| CN109839120B true CN109839120B (en) | 2021-05-18 |
Family
ID=66878032
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711195036.XA Active CN109839120B (en) | 2017-11-24 | 2017-11-24 | Route planning method, device, medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109839120B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110657818B (en) * | 2019-10-17 | 2024-04-09 | 北京百度网讯科技有限公司 | Method, device, equipment and storage medium for planning path of automatic driving vehicle |
| CN113124889A (en) * | 2020-01-15 | 2021-07-16 | 阿里巴巴集团控股有限公司 | Path planning method and device and electronic equipment |
| CN111721295A (en) * | 2020-05-23 | 2020-09-29 | 芜湖扬宇机电技术开发有限公司 | Planning method and system for sightseeing route of scenic spot in zoo |
| CN112902964B (en) * | 2021-01-22 | 2024-02-23 | 南京邮电大学 | Path recommendation method and device based on interest points |
| CN114279457B (en) * | 2021-12-23 | 2023-10-03 | 中南民族大学 | Path planning method, device, equipment and readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104677367A (en) * | 2013-11-26 | 2015-06-03 | 大陆汽车投资（上海）有限公司 | Path predication-based interest point searching method |
| CN104931064A (en) * | 2015-04-30 | 2015-09-23 | 百度在线网络技术（北京）有限公司 | Navigation method, navigation terminal, server and navigation system |
| CN105138608A (en) * | 2015-08-07 | 2015-12-09 | 百度在线网络技术（北京）有限公司 | Electronic map-based activity presentation system and method |
| CN107092629A (en) * | 2017-01-18 | 2017-08-25 | 北京小度信息科技有限公司 | Recommend method and device |
Family Cites Families (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20120007220A (en) * | 2010-07-14 | 2012-01-20 | 엔에이치엔(주) | Method and system for determining interest contents based on routing information |
| US20120036467A1 (en) * | 2010-08-05 | 2012-02-09 | General Motors Llc | System and method for producing a tour |
| US8818715B2 (en) * | 2012-03-29 | 2014-08-26 | Yahoo! Inc. | Systems and methods to suggest travel itineraries based on users' current location |
| CN104036441A (en) * | 2013-03-06 | 2014-09-10 | 中兴通讯股份有限公司 | Tourist guide system and tourist guide method |
| CN104634343B (en) * | 2015-01-27 | 2017-09-26 | 杭州格文数字技术有限公司 | A kind of scenic spot route automatic planning based on multiple-objection optimization |
| CN104794662A (en) * | 2015-05-07 | 2015-07-22 | 杨菊 | Scenic region visiting scheme planning method |
| CN104794663A (en) * | 2015-05-15 | 2015-07-22 | 北京景行技术有限公司 | Automatic itinerary generation system and method |
| CN105955981B (en) * | 2016-04-15 | 2019-04-23 | 清华大学 | A kind of personalized traveling bag recommended method based on demand classification and subject analysis |
| CN106197444B (en) * | 2016-06-29 | 2020-01-10 | 厦门趣处网络科技有限公司 | Route planning method and system |
| CN106408097A (en) * | 2016-08-31 | 2017-02-15 | 浪潮软件集团有限公司 | Travel journey planning system based on genetic algorithm |
| CN106779204B (en) * | 2016-12-08 | 2021-02-09 | 电子科技大学 | Personalized path recommendation method and device |
| CN107218950A (en) * | 2017-05-31 | 2017-09-29 | 北京小米移动软件有限公司 | A kind of method and apparatus for carrying out navigation processing |
-
2017
- 2017-11-24 CN CN201711195036.XA patent/CN109839120B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104677367A (en) * | 2013-11-26 | 2015-06-03 | 大陆汽车投资（上海）有限公司 | Path predication-based interest point searching method |
| CN104931064A (en) * | 2015-04-30 | 2015-09-23 | 百度在线网络技术（北京）有限公司 | Navigation method, navigation terminal, server and navigation system |
| CN105138608A (en) * | 2015-08-07 | 2015-12-09 | 百度在线网络技术（北京）有限公司 | Electronic map-based activity presentation system and method |
| CN107092629A (en) * | 2017-01-18 | 2017-08-25 | 北京小度信息科技有限公司 | Recommend method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109839120A (en) | 2019-06-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109839120B (en) | Route planning method, device, medium and electronic equipment | |
| US10782139B2 (en) | Method of planning travel route, planning server, and storage medium | |
| JP6340866B2 (en) | Carpool request method, carpool request apparatus and program | |
| CN105191357B (en) | Service Notification of taking part in person based on time and spatial proximity | |
| JP2005283575A (en) | Movement destination prediction device and movement destination prediction method | |
| CN110222277B (en) | Big data analysis-based travel information recommendation method and device | |
| CN110119822B (en) | Scenic spot management, journey planning method, client and server | |
| US9273970B2 (en) | Systems and methods for generating a plurality of trip patterns | |
| KR101799973B1 (en) | Apparatus and method for recommending meeting place | |
| CN111699362B (en) | Route guidance device, route guidance method, and storage medium | |
| TW202143162A (en) | Method for predicting the destination location of a vehicle | |
| CN113160607A (en) | Parking space navigation method and device, electronic equipment, storage medium and product | |
| CN109883430A (en) | Navigation routine recommended method, device, storage medium and computer equipment | |
| CN113780613A (en) | Path recommendation method and device | |
| Sarkar et al. | gTour: Multiple itinerary recommendation engine for group of tourists | |
| JP2011158950A (en) | Accommodation reservation server guiding sightseeing spot, sightseeing spot guide method and program for the same | |
| Garcia et al. | Hybrid approach for the public transportation time dependent orienteering problem with time windows | |
| US20190340315A1 (en) | Method and device for providing vehicle navigation simulation environment | |
| Deeshma et al. | Travel time modeling for bus transport system in Bangalore city | |
| KR102169109B1 (en) | System and method for providing lodging recommendation services based on estimation of schedule | |
| CN115759491A (en) | Scenic spot travel planning method and device, electronic equipment and computer medium | |
| US20150170063A1 (en) | Pattern Based Transit Routing | |
| CN110274605A (en) | Information providing method and information provider unit | |
| KR20150117209A (en) | Travel planning system | |
| JP7295057B2 (en) | Information processing device, information processing method, and information processing system |
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 |