CN105956167A - Dinner party place intelligent recommendation method and system - Google Patents
Dinner party place intelligent recommendation method and system Download PDFInfo
- Publication number
- CN105956167A CN105956167A CN201610339107.8A CN201610339107A CN105956167A CN 105956167 A CN105956167 A CN 105956167A CN 201610339107 A CN201610339107 A CN 201610339107A CN 105956167 A CN105956167 A CN 105956167A
- Authority
- CN
- China
- Prior art keywords
- dinner party
- person
- place
- intelligent recommendation
- road shape
- 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.)
- Pending
Links
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
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Game Theory and Decision Science (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Operations Research (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Navigation (AREA)
Abstract
The invention discloses a dinner party place intelligent recommendation method (a method for short) and a dinner party place intelligent recommendation system (a system for short). The system mainly comprises a module for locating geographic positions of persons joining a dinner party, a module for intelligently recommending a dinner party place of the persons joining the dinner party, and a module for intelligently planning paths from the persons joining the dinner party to the dinner party place. The method comprises the steps of 1) locating and inputting the position of each person joining the dinner party; 2) calculating a shortest path from each person joining the dinner party to each restaurant in a round region range of the person joining the dinner party in combination with historical road condition information by taking the position of each person joining the dinner party as a starting point and taking the position of each restaurant in the round region range of each person joining the dinner party as a stop point; 3) calculating the sum of the shortest paths from all the persons joining the dinner party to the restaurants in the round region ranges of the persons joining the dinner party in combination with the historical road condition information; and 4) recommending the restaurant with the minimum path length sum. According to the method and system, the optimal restaurant and the optimal path are quickly recommended to the persons joining the dinner party in combination with the historical road conditions.
Description
Technical field
The present invention relates to one have a dinner party place intelligent recommendation method and system, belong to the path planning of computer science and intelligent search and
Intellectual Analysis Technology field.
Background technology
At present, the system of having a dinner party of the intelligence under mobile platform is the most ripe, and the path planning in restaurant optimizes not enough.For people have a dinner party to
The intelligence gone out systems soft ware of having a dinner party is not met by people and has a dinner party for intelligence the requirement of restaurant recommendation and path planning.This intelligence system of having a dinner party is
By the main tissue of the group that has a dinner party, the person of having a dinner party can unrestricted choice 1. subway or public transport, 2. self-driving or take taxi, 3. three kinds of trip sides such as walking
Formula, gives different weights in conjunction with different trip modes, history traffic information and weather forecast information to trip route, believes based on cum rights path
Breath realize respectively the not having a dinner party restaurant recommendation being given of person's shortest path is not respectively had a dinner party person's path planning to recommendation restaurant.
Shortest path is to find a nodes class problem to direct shortest path, it is common that use the method for graph theory and Mathematical Planning to enter
The row search to path.Native system proposes the path planning algorithm of oneself for the intelligence system of having a dinner party of mobile platform: first gets together and is led by group
Tissue, the person of having a dinner party can unrestricted choice 1. subway or public transport, 2. self-driving or take taxi, 3. three kinds of trip modes such as walking, then by
Baidu's Orientation on map goes out the position of friends, different positions of having a dinner party, and cooks up a border circular areas and includes respectively not having a dinner party the position of person, so
After each location point in border circular areas, all combine trip mode, history road transfering the letter breath and weather forecast information in addition different weights, if
Mode of transportation is self-driving or takes taxi, and the most further the historical data of combining road condition information, arranges weight, and when history road, shape is unimpeded
Time path length be multiplied by weights M, when history road shape compares obstruction when, the length in path is multiplied by weights N, and when history road, shape hinders very much
The when of plug, the length in path is multiplied by weights K, the most first changes space with the time, and the most again with space for time, the path finally cooked up is not only
It is the path of shortest path, the most necessarily path of shortest time used.Calculate the person position to each restaurant in each border circular areas of respectively not having a dinner party
Put the distance of weighted value a little, select the person that respectively do not has a dinner party to the shortest that restaurant of the location point summation in restaurant.The person that now respectively do not has a dinner party arrives restaurant
Even if the restaurant that the shortest that restaurant of location point summation is to be recommended, finally cook up the person that respectively do not has a dinner party to the path recommending restaurant.Described weights
The span of M is 1-1.2, and the span of weights N is 1.3-1.8, and the span of weights K is 2.0-2.5.
From the fifties in last century, optimal path problem is conducted in-depth research by the scholar in each field.Optimize former based on Bellman
Reason, in solution node network, node is to the dijkstra's algorithm of every other node optimal path, arbitrary node in solution node network
Between the Floyd algorithm of shortest path, and the classic algorithm that intelligent search A* algorithm etc. is representative established meshed network optimal path and calculated
The basis of method.
In numerous best path algorithm, A* algorithm is the searching algorithm of the most popular a kind of optimal path, with Dijkstra etc.
Algorithm is compared, and A* algorithm have employed heuristic search strategy, during search, each node searched for is estimated and is calculated,
Avoid the blindness of route searching, the node of traversal in search procedure can be reduced to a great extent, thus improve the execution speed of algorithm.
By to the comparison of current best path algorithm performance it is found that when applying in large complicated meshed network when, A* algorithm
Performance comparision is outstanding.But when having a dinner party in system for the intelligence under complicated map environment, it is impossible to meet intelligence system of having a dinner party well real to road conditions
The requirement of time property, is therefore necessary that proposing modified hydrothermal process solves the problem of intelligent system path planning of having a dinner party under complicated map environment in fact.
First, for the research aspect of place intelligent recommendation method and system of having a dinner party, all occur in that multiple method and system, through data-searching,
Substantially there is following a few class:
(a) application number: CN201410379405.0, the patent of invention of entitled " movable food and beverage point list and intelligent recommendation system ", including:
Make things convenient for customers and browse menu, and utilize data mining and situational analysis, carry out feature extraction by situation that client was ordered dishes in the past, and call
After correlation rule in model library is analyzed, carries out, to client, the table number recommendation with menu of having dinner intelligently, solve asking in background technology
Topic..Above-mentioned movable food and beverage point list and intelligent recommendation system, merely provide the have dinner table number recommendation with menu, not intelligence when ordering
Recommendation have dinner restaurant and have dinner restaurant path planning.
(b) application number: CN200910219167.6, the patent of invention of entitled " shortest path planning method of a kind of dynamic origins ", bag
Include: with current vehicle position as starting point, in conjunction with traffic flow and road shape information, solve shortest path according to path planning algorithm.But this is special
Profit only only accounts for traffic flow and the road shape information that vehicle travels, and does not combine other modes of transportation such as subway, and the most intelligent pushes away
Recommend out have a dinner party restaurant and intelligence path planning.
For above-mentioned each open method or the technological deficiency of system, the application is devoted to overcome said method and system cannot solve to have a dinner party ground
The problem of some intelligent recommendation, it is intended to propose one and have a dinner party place intelligent recommendation method and system.
Summary of the invention
It is an object of the invention to solve existing place intelligent recommendation system of having a dinner party and cannot solve the technical problem of combining road condition information, propose
One is had a dinner party place intelligent recommendation method and system.
One of the present invention place intelligent recommendation method and system of having a dinner party includes that one is had a dinner party place intelligent recommendation method (be called for short " method ")
And one has a dinner party place intelligent recommendation system (be called for short " system ") two parts；
Described system specifically includes that the locating module in the person of having a dinner party geographical position, and the person of having a dinner party has a dinner party the intelligent recommendation module in place, has a dinner party
Person is to the intelligent path planning module in place of having a dinner party；
One each functions of modules in the intelligent recommendation system of place of having a dinner party is:
The locating module in the person of having a dinner party geographical position for the person of having a dinner party have a dinner party place intelligent recommendation module provide geographical location information, longitude and latitude
Degree, is that the person of having a dinner party has a dinner party the premise of intelligent recommendation module in place；The person of having a dinner party have a dinner party place intelligent recommendation functions of modules for use algorithm
The restaurant locations information of planning department's optimal path, is the person of the having a dinner party basis to the intelligent path planning module in place of having a dinner party, for the person's of having a dinner party intelligence
Can have a dinner party and the restaurant destination eventually arrived at is provided, provide endpoint information for intelligence restaurant path planning；The person of having a dinner party is to the intelligence in place of having a dinner party
Can path planning module function be to cook up the person of having a dinner party to the routing information recommended between restaurant；
A kind of each module annexation having a dinner party in the intelligent recommendation system of place is as follows:
Have a dinner party with the person of the having a dinner party intelligent recommendation module in place of the locating module in the person of having a dinner party geographical position is connected；The person of having a dinner party has a dinner party the intelligence in place
Recommending module is connected with the intelligent path planning module of the person of having a dinner party to place of having a dinner party；
One is had a dinner party place intelligent recommendation method, comprises the steps of:
Step one, person's location positioning of respectively not having a dinner party, input the position of each person of having a dinner party；
Step 2, with the position of each person of having a dinner party as starting point, in the range of each person's of having a dinner party border circular areas, the position in each restaurant is as terminal, in conjunction with
History road shape information, calculates each person of having a dinner party shortest path to each restaurant in the range of the person's of having a dinner party border circular areas；
Wherein, step 2 comprises the following steps again:
It is M that step 2.1 arranges road shape weights Q when history road shape is unimpeded when, arranges road shape power when history road shape compares obstruction when
Value Q is N, and arranging road shape weights Q when history road shape blocks very much when is K；
Within 1 year, the time road shape more than 50% is unobstructed, and vehicle can pass through smoothly, and then to define the history road conditions of these road conditions unimpeded, when one
Within Nian, the time road shape of more than 60% blocks, but vehicle slowly passes through, then the history road conditions defining these road conditions compare obstruction；When 1 year
Within more than 60% time road shape block, vehicle cannot pass through smoothly, causes vehicle to block for a long time, then define the history road of these road conditions
Condition is blocked very much；
Wherein, described weights M, N, K, meet M < N < K；
The span of described weights M is 1 to 1.2, and the span of weights N is 1.3 to 1.8, and the span of weights K is
2.0 to 2.5；
Step 2.2 sets weighted graph G=(V, E), Vo ε V, and time initial, U only comprises starting point Vo；V-U comprises other in addition to Vo
In summit, and V-U, the distance value on summit is " distance of starting point Vo to this summit is multiplied by routine weight value Q " [distance of summit Vi in V-U
Value for the length of (Vo, Vi) be multiplied by routine weight value Q (i=1,2,3 ..., n-1), if Vo and Vi is non-conterminous, then Vo to Vi
Distance value is ∞]；
Wherein V is vertex set, and E is limit set, and Vo is starting point, and it is vertex set that the Vo i.e. Vo of ε V belongs to set V, set U,
Depositing to obtain and combine all summits of the shortest path of history road shape information from Vo to it, V-U is not yet to determine to combine history road shape letter
The vertex set of breath shortest path；
Step 2.3 summit that chosen distance value is minimum in set V-U, is designated as this summit: Vmin, and Vmin is added set
U；
Step 2.4 is to each summit in set V-U, if after addition summit Vmin is intermediate vertex, making the distance value ratio of Vo to Vi
Distance value originally is less, then revise the distance value of Vi；It is refined as: if dist [i] .length > dist [min] .length+
G.arcs [min] [i] * Q, then change by the distance value of summit Vi as dist [min] .length+G.arcs [min] [i] * Q into, and revise road
The previous summit of Vi: dist [i] .prevex=min on footpath；
Wherein array dist, dist [i] combines the shortest path of history road shape information eventually for depositing Vo to summit Vi and combines history
The shortest path length (i.e. distance value) of road shape information；
Step 2.5 repeats step 2.4 and operates, until from all summits that Vo can arrive all among set U；
Step 3, combine history road shape information, calculate all persons of having a dinner party shortest path to each restaurant in the range of the person's of having a dinner party border circular areas
Summation；
The restaurant that step 4, outbound path length summation of recommending are the shortest；
So far, have passed through step one to step 4, complete one and have a dinner party place intelligent recommendation method.
Beneficial effect
One of the present invention place intelligent recommendation method and system of having a dinner party, compared with other existing method and system, has the advantages that
One the most of the present invention have a dinner party place intelligent recommendation method perform during combine history road shape information, consider history road
Cook up optimal path while shape information, and be not only shortest path and when many people have a dinner party, the person of having a dinner party can well be gone out
Walking along the street footpath is planned, recommends optimal restaurant for the person of having a dinner party rapidly and recommends optimal path；
One the most of the present invention place intelligent recommendation method of having a dinner party combines historical traffic road shape information and trip mode sets to greatest extent
Put weights, facilitate the restaurant having a dinner party and select and the optimization of time of having a dinner party.
Accompanying drawing explanation
Fig. 1 is the enforcement schematic diagram of a kind of place intelligent recommendation method and system embodiment 1 of having a dinner party of the present invention；
Fig. 2 is to select the person of having a dinner party to have a dinner party the schematic diagram in restaurant in a kind of place intelligent recommendation method and system embodiment 2 of having a dinner party of the present invention；
Fig. 3 is the algorithm flow chart of a kind of place intelligent recommendation method and system of having a dinner party of the present invention；
Fig. 4 is that the shortest path combination cooked up for difference in a kind of place intelligent recommendation method and system embodiment 4 of having a dinner party of the present invention is worked as
Time road shape information give the optimal path schematic diagram that weights are planned out.
Detailed description of the invention
In order to further illustrate the feature of the present invention and beneficial effect, below in conjunction with the accompanying drawings and embodiment carries out in-depth explanation and explanation.
Embodiment 1
Fig. 1 be a kind of place intelligent recommendation method and system of having a dinner party of the present invention be embodied as schematic diagram；First, the person of having a dinner party select to have a dinner party friendship
Logical mode, if mode of transportation is self-driving or takes taxi, the most further the historical data of combining road condition information, arranges weight, when going through
Weights M is multiplied by the path that history road shape is cooked up the when of unimpeded, and the path cooked up when history road shape compares obstruction when is multiplied by power
Value N, the path planning out when history road shape blocks very much when is multiplied by weights K, the most finally chooses the path cooked up
Short path, first changes space with the time, and the most again with space for time, the path finally cooked up is not only the path of shortest path, also must
It it is so the path of shortest time used.Finally recommend the restaurant of shortest path, the intelligent recommendation in the place that completes to have a dinner party.
Being specific to the present embodiment, " carrying out path planning in conjunction with history road shape information " in accompanying drawing 1 correspond to one of the present invention and have a dinner party ground
The step one of some intelligent recommendation method is to step 5；Parameter M value is 1, and parameter N value is 1.5, and parameter K value is 2.
Embodiment 2
Fig. 2 is to select the person of having a dinner party to have a dinner party the schematic diagram in restaurant in a kind of place intelligent recommendation method and system the present embodiment of having a dinner party of the present invention；Fig. 3
It it is the flow chart that in a kind of place intelligent recommendation method and system of having a dinner party of the present invention, specific algorithm realizes；Specific algorithm figure is described as follows:
If the person of having a dinner party has three people, being A, B and C respectively, the person of having a dinner party A is positioned at heaven-made mansion, and the person of having a dinner party B is positioned at Peking University oral cavity
Hospital, the person of having a dinner party C centrally located finance and economics university.Then a virtual circle on map, this circle includes A just, B, C 3 point, then
Cook up a border circular areas to include respectively not having a dinner party the position of person, the then location point of each in border circular areas, all combine trip mode, history
Road transfering the letter breath and Weather information in addition weights, if mode of transportation is self-driving or taxi, the most further historical data of combining road condition information,
Weight is set, finally cooks up the restaurant of optimal path, it is recommended that to everybody.When history road shape is unimpeded when, the length in path is multiplied by weights M,
When history road shape compares obstruction when, the length in path is multiplied by weights N, and when history road shape blocks very much when, the length in path is multiplied by weights
K, the most first changes space with the time, and the most again with space for time, the path of shortest path is not only, the most necessarily in the path finally cooked up
The path of shortest time used.Calculate person's distance to the weighted value of the location point in each restaurant in each border circular areas of respectively not having a dinner party, select
Respectively do not have a dinner party person to the shortest that restaurant of the location point summation in restaurant.The person that now respectively do not has a dinner party to that restaurant that the location point summation in restaurant is the shortest is
Make restaurant to be recommended, finally cook up the person that respectively do not has a dinner party to the path recommending restaurant.The span of described weights M is 1-1.2, weights
The span of N is 1.3-1.8, and the span of weights K is 2.0-2.5.
A, B, C are the position of three persons of having a dinner party, and a circle is cooked up in simulation, then finds the location point O that most preferably has a dinner party.
The traffic behavior that red representative is blocked up very much, the traffic behavior that the representative of yellow is typically blocked up, the traffic behavior that green representative is unimpeded.
If the shortest path cooked up has above-mentioned three, then green path weights to be multiplied by M, the path power to be multiplied by of yellow
Value N, red weights K to be multiplied by.In the path of last three equal length, optimal path is green path.Described weights M
Span be 1-1.2, the span of weights N is 1.3-1.8, and the span of weights K is 2.0-2.5.
Embodiment 3
The present invention can also realize the non-person of having a dinner party and have a dinner party restaurant, such as realizes party singing KTV intelligent recommendation, and the one that the present invention is carried is gathered
Meal place intelligent recommendation method can also be applied to this scene.
Embodiment 4
Fig. 4 is that the shortest path that a kind of place intelligent recommendation method and system of having a dinner party of the present invention is cooked up for difference for the present embodiment combines
Road shape information at that time gives the optimal path schematic diagram that weights are planned out.Give weights in conjunction with history road shape information, can be given and have a dinner party ground
Point intelligent recommendation, in order to have a dinner party, trip provides quality services.
In sum, these are only the preferred embodiments of the present invention, be not intended to limit protection scope of the present invention.All essences in the present invention
Within god and principle, any modification, equivalent substitution and improvement etc. made, should be included within the scope of the present invention.
Claims (5)
1. a place intelligent recommendation method and system of having a dinner party, it is characterised in that:
Have a dinner party place intelligent recommendation method (be called for short " method ") including one and one is had a dinner party place intelligent recommendation
System (is called for short " system ")；
Described system specifically includes that the locating module in the person of having a dinner party geographical position, and the have a dinner party intelligence in place of the person of having a dinner party pushes away
Recommend module, the intelligent path planning module of the person of having a dinner party to place of having a dinner party；
One each functions of modules in the intelligent recommendation system of place of having a dinner party is:
The locating module in the person of having a dinner party geographical position for the person of having a dinner party have a dinner party place intelligent recommendation module provide geographical position
Information, longitude and latitude, be that the person of having a dinner party has a dinner party the premise of intelligent recommendation module in place；The person of having a dinner party has a dinner party the intelligence in place
Can recommending module function be to use the restaurant locations information of optimal path at algorithmic rule, be that the person of having a dinner party is to place of having a dinner party
The basis of intelligent path planning module, have a dinner party for the person's of having a dinner party intelligence and provide the restaurant destination eventually arrived at, for intelligence
Endpoint information can be provided by restaurant path planning；The person of having a dinner party is planning to the intelligent path planning module function in place of having a dinner party
Go out the person of having a dinner party to the routing information recommended between restaurant；
A kind of each module annexation having a dinner party in the intelligent recommendation system of place is as follows:
Have a dinner party with the person of the having a dinner party intelligent recommendation module in place of the locating module in the person of having a dinner party geographical position is connected；The person of having a dinner party gathers
The intelligent recommendation module in meal place is connected with the intelligent path planning module of the person of having a dinner party to place of having a dinner party.
2. one as claimed in claim 1 is had a dinner party place intelligent recommendation method and system, is further characterized in that:
Described one is had a dinner party place intelligent recommendation method, comprises the steps of:
Step one, person's location positioning of respectively not having a dinner party, input the position of each person of having a dinner party；
Step 2, with the position of each person of having a dinner party as starting point, with the position in each restaurant in the range of each person's of having a dinner party border circular areas
For terminal, in conjunction with history road shape information, calculate each person of having a dinner party to each restaurant in the range of the person's of having a dinner party border circular areas
Shortest path；
Step 3, combine history road shape information, calculate all persons of having a dinner party to each meal in the range of the person's of having a dinner party border circular areas
The summation of the shortest path in shop；
The restaurant that step 4, outbound path length summation of recommending are the shortest；
So far, have passed through step one to step 4, complete one and have a dinner party place intelligent recommendation method.
3. one as claimed in claim 2 is had a dinner party place intelligent recommendation method, is further characterized in that:
Wherein, step 2 comprises the following steps again:
It is M that step 2.1 arranges road shape weights Q when history road shape is unimpeded when, when history road shape compares obstruction
It is N that time arranges road shape weights Q, and arranging road shape weights Q when history road shape blocks very much when is K；
Step 2.2 sets weighted graph G=(V, E), Vo ε V, and time initial, U only comprises starting point Vo；V-U comprises and removes
In other summits, and V-U outside Vo, the distance value on summit is that " starting point Vo is multiplied by routine weight value to the distance on this summit
Q " [in V-U the distance value of summit Vi be the length of (Vo, Vi) be multiplied by routine weight value Q (i=1,2,3 ..., n-1),
If Vo and Vi is non-conterminous, then the distance value of Vo to Vi is ∞]；
Wherein V is vertex set, and E is limit set, and Vo is starting point, and the Vo i.e. Vo of ε V belongs to set V, set
U is vertex set, deposits to obtain and combines all summits of the shortest path of history road shape information, V-U from Vo to it
It it is the vertex set not yet determining and combining history road shape information shortest path；
Step 2.3 summit that chosen distance value is minimum in set V-U, is designated as this summit: Vmin, and by Vmin
Add set U；
Step 2.4 is to each summit in set V-U, if after addition summit Vmin is intermediate vertex, making Vo arrive
The distance value of Vi is less than original distance value, then revise the distance value of Vi；It is refined as: if dist [i] .length >
Dist [min] .length+G.arcs [min] [i] * Q, then change into the distance value of summit Vi
Dist [min] .length+G.arcs [min] [i] * Q, and revise the previous summit of Vi on path:
Dist [i] .prevex=min；
Wherein array dist, dist [i] combines the shortest path of history road shape information eventually for depositing Vo to summit Vi
And combine the shortest path length (i.e. distance value) of history road shape information；
Step 2.5 repeats step 2.4 and operates, until from all summits that Vo can arrive all among set U
Till.
4. one as claimed in claim 3 is had a dinner party place intelligent recommendation method, is further characterized in that:
The definition that in step 2.1, history road shape is unimpeded, history road shape compares obstruction and history road conditions are blocked very much is the most such as
Under:
Within 1 year, the time road shape more than 50% is unobstructed, and vehicle can pass through smoothly and then define the history road of these road conditions
Condition is unimpeded；
Within 1 year, the time road shape of more than 60% blocks, but vehicle slowly passes through, then define the history of these road conditions
Road conditions compare obstruction；
Within 1 year, the time road shape of more than 60% blocks, and vehicle cannot pass through smoothly, causes vehicle to block for a long time,
The history road conditions then defining these road conditions are blocked very much.
5. one as claimed in claim 3 is had a dinner party place intelligent recommendation method, is further characterized in that:
In step 2.1, described weights M, N, K, meet M < N < K；
The span of described weights M is 1 to 1.2, and the span of weights N is 1.3 to 1.8, weights K
Span be 2.0 to 2.5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610339107.8A CN105956167A (en) | 2016-05-19 | 2016-05-19 | Dinner party place intelligent recommendation method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610339107.8A CN105956167A (en) | 2016-05-19 | 2016-05-19 | Dinner party place intelligent recommendation method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105956167A true CN105956167A (en) | 2016-09-21 |
Family
ID=56909259
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610339107.8A Pending CN105956167A (en) | 2016-05-19 | 2016-05-19 | Dinner party place intelligent recommendation method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105956167A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107562902A (en) * | 2017-09-07 | 2018-01-09 | 如皋福大工程技术研究院有限公司 | For recommending the method and system of assembly place in social networks |
| CN109962939A (en) * | 2017-12-14 | 2019-07-02 | 腾讯科技（深圳）有限公司 | Position recommended method, device, server, terminal and storage medium |
| CN110750729A (en) * | 2018-07-06 | 2020-02-04 | 上海博泰悦臻网络技术服务有限公司 | Method/system for recommending appointment places, computer-readable storage medium and terminal |
| CN110826761A (en) * | 2019-09-19 | 2020-02-21 | 中山大学 | Optimal group order path query method based on meeting points |
| CN111932300A (en) * | 2020-07-29 | 2020-11-13 | 上海博泰悦臻电子设备制造有限公司 | Activity planning method and related equipment |
| CN112488342A (en) * | 2019-09-12 | 2021-03-12 | 富士施乐株式会社 | Reservation processing device, recording medium, and reservation processing method |
| CN114964294A (en) * | 2022-06-02 | 2022-08-30 | 小米汽车科技有限公司 | Navigation method, navigation device, storage medium, electronic equipment, chip and vehicle |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101216913A (en) * | 2008-01-11 | 2008-07-09 | 北京工业大学 | Multistage screening method of carpool dynamic matching |
| CN102110362A (en) * | 2011-02-01 | 2011-06-29 | 世纪战斧节能环保技术（北京）有限公司 | Method and system for processing travel route planning |
| CN103824450A (en) * | 2014-03-20 | 2014-05-28 | 福州市规划设计研究院 | Special vehicle route planning method based on traffic state rule for large-scale activities |
| CN104236569A (en) * | 2013-06-21 | 2014-12-24 | 株式会社日立制作所 | Method and device for determining optimal meeting point |
| CN105184615A (en) * | 2015-09-29 | 2015-12-23 | 袁汉宁 | Restaurant recommendation method |
-
2016
- 2016-05-19 CN CN201610339107.8A patent/CN105956167A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101216913A (en) * | 2008-01-11 | 2008-07-09 | 北京工业大学 | Multistage screening method of carpool dynamic matching |
| CN102110362A (en) * | 2011-02-01 | 2011-06-29 | 世纪战斧节能环保技术（北京）有限公司 | Method and system for processing travel route planning |
| CN104236569A (en) * | 2013-06-21 | 2014-12-24 | 株式会社日立制作所 | Method and device for determining optimal meeting point |
| CN103824450A (en) * | 2014-03-20 | 2014-05-28 | 福州市规划设计研究院 | Special vehicle route planning method based on traffic state rule for large-scale activities |
| CN105184615A (en) * | 2015-09-29 | 2015-12-23 | 袁汉宁 | Restaurant recommendation method |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107562902A (en) * | 2017-09-07 | 2018-01-09 | 如皋福大工程技术研究院有限公司 | For recommending the method and system of assembly place in social networks |
| CN109962939A (en) * | 2017-12-14 | 2019-07-02 | 腾讯科技（深圳）有限公司 | Position recommended method, device, server, terminal and storage medium |
| CN109962939B (en) * | 2017-12-14 | 2021-05-04 | 腾讯科技（深圳）有限公司 | Position recommendation method, device, server, terminal and storage medium |
| CN110750729A (en) * | 2018-07-06 | 2020-02-04 | 上海博泰悦臻网络技术服务有限公司 | Method/system for recommending appointment places, computer-readable storage medium and terminal |
| CN112488342A (en) * | 2019-09-12 | 2021-03-12 | 富士施乐株式会社 | Reservation processing device, recording medium, and reservation processing method |
| CN110826761A (en) * | 2019-09-19 | 2020-02-21 | 中山大学 | Optimal group order path query method based on meeting points |
| CN110826761B (en) * | 2019-09-19 | 2023-04-07 | 中山大学 | Optimal group order path query method based on meeting points |
| CN111932300A (en) * | 2020-07-29 | 2020-11-13 | 上海博泰悦臻电子设备制造有限公司 | Activity planning method and related equipment |
| CN114964294A (en) * | 2022-06-02 | 2022-08-30 | 小米汽车科技有限公司 | Navigation method, navigation device, storage medium, electronic equipment, chip and vehicle |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105956167A (en) | Dinner party place intelligent recommendation method and system | |
| Zheng et al. | Using a heuristic approach to design personalized tour routes for heterogeneous tourist groups | |
| CN106254219B (en) | Intelligent travel method and system based on route planning | |
| Mirri et al. | On combining crowdsourcing, sensing and open data for an accessible smart city | |
| US8924147B2 (en) | Method for constructing geo-fences for a spatial recommendation and discovery system | |
| CN106886837A (en) | Free walker stroke based on time planning recommends method | |
| CN104537029B (en) | Inquiry processing method and device | |
| US20130238658A1 (en) | Methods and Systems of Aggregating Information of Social Networks Based on Changing Geographical Locations of a Computing Device Via a Network | |
| US20140358603A1 (en) | Iterative public transit scoring | |
| CN102762955A (en) | Location aware recommendation engine | |
| US20120179671A1 (en) | Method and system for generating compound suggestions using entity eligibility models | |
| CN106289260A (en) | A kind of algorithm and its implementation realizing the cross-domain navigation feature of indoor and outdoor based on indoor electronic map | |
| CN109978723A (en) | Tourism planning method, apparatus, computer equipment and storage medium | |
| Komatsu et al. | Automatic evacuation guiding scheme based on implicit interactions between evacuees and their mobile nodes | |
| Roberts et al. | GPT4GEO: How a Language Model Sees the World's Geography | |
| CN104848849A (en) | Target aggregation site planning method and target aggregation site planning device based on positioning technology | |
| CN108304951A (en) | Acquisition methods, device and the non-transient computer readable storage medium of traffic information | |
| Bucher et al. | A heuristic for multi-modal route planning | |
| Li et al. | A dynamic and scalable user-centric route planning algorithm based on polychromatic sets theory | |
| CN107883976A (en) | City tour's route planning method and device based on cloud computing | |
| Khanfor et al. | A social IoT-driven pedestrian routing approach during epidemic time | |
| Kaikara | Tourism development strategy | |
| CN106931978A (en) | The method of the automatic indoor map generation for building road network | |
| CN107677277A (en) | A kind of determining method of path based on dijkstra's algorithm | |
| CN109726868A (en) | Paths planning method, device and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20160921 |