CN104572873A - Information processing method and device - Google Patents
Information processing method and device Download PDFInfo
- Publication number
- CN104572873A CN104572873A CN201410804393.1A CN201410804393A CN104572873A CN 104572873 A CN104572873 A CN 104572873A CN 201410804393 A CN201410804393 A CN 201410804393A CN 104572873 A CN104572873 A CN 104572873A
- Authority
- CN
- China
- Prior art keywords
- sight spot
- subsequence
- information
- sequence
- complete sequence
- 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.)
- Granted
Links
- 230000010365 information processing Effects 0.000 title claims abstract description 35
- 238000003672 processing method Methods 0.000 title claims abstract description 26
- 238000000034 method Methods 0.000 claims abstract description 17
- 235000012054 meals Nutrition 0.000 claims description 16
- 230000003750 conditioning effect Effects 0.000 claims description 8
- 230000011218 segmentation Effects 0.000 claims description 8
- 238000005457 optimization Methods 0.000 claims description 7
- 230000002045 lasting effect Effects 0.000 abstract 1
- 238000012163 sequencing technique Methods 0.000 abstract 1
- 238000000638 solvent extraction Methods 0.000 abstract 1
- 230000002354 daily effect Effects 0.000 description 6
- 230000003203 everyday effect Effects 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/14—Travel agencies
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Theoretical Computer Science (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Game Theory and Decision Science (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Navigation (AREA)
Abstract
The invention discloses an information processing method and device. The method comprises the following steps: receiving input scenic spot information; sequencing scenic spots according to the scenic spot information to obtain a scenic spot complete sequence, wherein the scenic spot complete sequence comprises all scenic spots in the scenic spot information; partitioning the scenic spot complete sequence into scenic spot sub-sequences; returning a processing result according to the scenic spot sub-sequences, wherein the processing result comprises time allocation information of all scenic spots in the scenic spot information, and planning of a touring route lasting for over one day is realized.
Description
Technical field
The embodiment of the present invention relates to areas of information technology, particularly relates to a kind of information processing method and device.
Background technology
Along with the raising of people's living standard, people more and more favor in tourist activity.Conveniently user's trip, all big enterprises are proposed some tour schedule suggested designs successively, are implemented by website, software or device.
In prior art, these websites of recommending for tour schedule, software or device, be that user cooks up the best tourism route being suitable at most completing in a day according to tourist attractions, the terminal being then supplied to user used shows.
But, along with the variation of tourism demand, more than one day of more people's tourism demand duration, and prior art is only limitted to as user provides the tourism route on the same day, function ratio is more single, cannot meet this demand.
Summary of the invention
The embodiment of the present invention provides a kind of information processing method and device, to realize planning the travelling route more than a day consuming time.
On the one hand, embodiments provide a kind of information processing method, comprising:
Receive the sight spot information of input;
According to described sight spot information to sights, obtain sight spot complete sequence, described sight spot complete sequence contains all sight spots in described sight spot information;
Described sight spot complete sequence is divided into sight spot subsequence;
According to described sight spot subsequence, return result, wherein, described result comprises the time devided modulation information at all sight spots in described sight spot information.
Further, according to described sight spot information to before sights, also comprise:
Receive at least one information in the traffic time of input, dining place and lodging Locale information.
Further, according to described sight spot information to before sights, also comprise:
Tourism scheme in described sight spot information and user's original content UGC is matched;
When it fails to match, trigger perform described according to described sight spot information to sights.
Further, when the match is successful, return the tourism scheme in the UGC matched with described sight spot information.
Further, according to described sight spot information to sights, obtain sight spot complete sequence, comprising:
From described sight spot information, head sight spot and tail sight spot is selected according to described traffic time information;
To the sight spot in described all sight spots except described head sight spot and tail sight spot, adopt traveling salesman problem TSP algorithm to sort, obtain sight spot sequence;
Before described head sight spot is placed on described sight spot sequence, after described tail sight spot is placed on described sight spot sequence, obtain described sight spot complete sequence.
Further, according to described sight spot information to sights, obtain sight spot complete sequence, comprising:
Adopt traveling salesman problem TSP algorithm to sort to all sight spots that described sight spot information provides, obtain described sight spot complete sequence.
Further, described sight spot complete sequence is divided into sight spot subsequence, comprises:
Travel through the sight spot in the complete sequence of described sight spot, mate with sky, sight spot sequence, wherein, sky, described sight spot sequence is the sight spot being in line or forming a line, and the duration that sky, described sight spot sequence pair is answered is one day;
Using with sky, the sight spot sequence that the match is successful of the sight spot in the complete sequence of sight spot as described sight spot subsequence;
Or, comprising:
According to the time, described sight spot complete sequence is divided into sight spot subsequence.
Further, according to the time, described sight spot complete sequence is divided into sight spot subsequence, comprises:
According to the traffic duration between the consuming time and adjacent sight spot that each sight spot in the complete sequence of described sight spot is corresponding, daily by the complete sequence segmentation of described sight spot, obtain described sight spot subsequence.
Further, according to described sight spot subsequence, return result, comprising:
Return described sight spot subsequence and corresponding time devided modulation information;
Or, comprising:
Adopt at least one mode in traveling salesman problem TSP algorithm and access index, adjust the sight spot order in the subsequence of described sight spot, be optimized sight spot subsequence;
Return described optimization sight spot subsequence and corresponding time devided modulation information;
Or, comprising:
Adjust the order between the subsequence of described sight spot;
Return the described sight spot subsequence after adjustment order and corresponding time devided modulation information.
Further, according to described sight spot subsequence, return result, comprising:
From the lodging place that described lodging Locale information provides, the nearest place in first sight spot or last sight spot in sight spot subsequence described in chosen distance, as the lodging place distributing to described sight spot subsequence;
Return described sight spot subsequence, the lodging place of distribution and time assignment information.
Further, according to described sight spot subsequence, return result, comprising:
From the dining place that described dining Locale information provides, select the dining place nearest with the sight spot in the subsequence of described sight spot, as the dining place distributing to described sight spot subsequence according to the meal time;
Return described sight spot subsequence, the dining place of distribution and time assignment information.
On the other hand, the embodiment of the present invention additionally provides a kind of signal conditioning package, comprising:
Receiver module, for receiving the sight spot information of input;
Order module, for according to described sight spot information to sights, obtain sight spot complete sequence, described sight spot complete sequence contains all sight spots in described sight spot information;
Divide module, for described sight spot complete sequence is divided into sight spot subsequence;
Return module, for according to described sight spot subsequence, return result, wherein, described result comprises the time devided modulation information at all sight spots in described sight spot information.
Further, described receiver module also for: described order module according to described sight spot information to sights before, receive input traffic time, dining place and lodging Locale information at least one information.
Further, described device also comprises:
Matching module, for described order module according to described sight spot information to sights before, the tourism scheme in described sight spot information and user's original content UGC is matched;
Trigger module, for when it fails to match for described matching module, triggers described order module and performs according to described sight spot information sights.
Further, return described in module specifically for: when the match is successful for described matching module, return the tourism scheme in the UGC matched with described sight spot information.
Further, described order module specifically for:
From described sight spot information, head sight spot and tail sight spot is selected according to described traffic time information;
To the sight spot in described all sight spots except described head sight spot and tail sight spot, adopt traveling salesman problem TSP algorithm to sort, obtain sight spot sequence;
Before described head sight spot is placed on described sight spot sequence, after described tail sight spot is placed on described sight spot sequence, obtain described sight spot complete sequence.
Further, described order module specifically for:
Adopt traveling salesman problem TSP algorithm to sort to all sight spots that described sight spot information provides, obtain described sight spot complete sequence.
Further, described division module, comprising:
Traversal submodule, for traveling through the sight spot in the complete sequence of described sight spot, mate with sky, sight spot sequence, wherein, sky, described sight spot sequence is the sight spot being in line or forming a line, and the duration that sky, described sight spot sequence pair is answered is one day;
Divide submodule, for using with sky, the sight spot sequence that the match is successful of the sight spot in the complete sequence of sight spot as described sight spot subsequence; Or, according to the time, described sight spot complete sequence is divided into sight spot subsequence.
Further, described division submodule specifically for:
According to the traffic duration between the consuming time and adjacent sight spot that each sight spot in the complete sequence of described sight spot is corresponding, daily by the complete sequence segmentation of described sight spot, obtain described sight spot subsequence.
Further, return described in module specifically for:
Return described sight spot subsequence and corresponding time devided modulation information;
Or, specifically for:
Adopt at least one mode in traveling salesman problem TSP algorithm and access index, adjust the sight spot order in the subsequence of described sight spot, be optimized sight spot subsequence;
Return described optimization sight spot subsequence and corresponding time devided modulation information;
Or, specifically for:
Adjust the order between the subsequence of described sight spot; Return the described sight spot subsequence after adjustment order and corresponding time devided modulation information.
Further, return described in module specifically for:
From the lodging place that described lodging Locale information provides, the nearest place in first sight spot or last sight spot in sight spot subsequence described in chosen distance, as the lodging place distributing to described sight spot subsequence;
Return described sight spot subsequence, the lodging place of distribution and time assignment information.
Further, return described in module specifically for:
From the dining place that described dining Locale information provides, select the dining place nearest with the sight spot in the subsequence of described sight spot, as the dining place distributing to described sight spot subsequence according to the meal time;
Return described sight spot subsequence, the dining place of distribution and time assignment information.
The information processing method that the embodiment of the present invention provides and device, by receiving the sight spot information of user's input, according to described sight spot information, sorted in all sight spots, obtain sight spot complete sequence, then described sight spot complete sequence is divided into sight spot subsequence, according to described sight spot subsequence, the result of the time devided modulation information at all sight spots comprised in described sight spot information is returned for user, make no matter user needs the sight spot quantity of accessing to have how many, sequence process can be carried out and obtain sight spot complete sequence, then sight spot subsequence is divided into, this sight spot subsequence can be altogether consuming time is the travelling route of a day, thus achieve the planning travelling route more than a day consuming time, the sight spot that can be about to travel according to user is the Best Times assignment information that user cooks up tourist attractions, improve information processing dirigibility, add the diversity of tourism planning.
Accompanying drawing explanation
The schematic flow sheet of the information processing method that Fig. 1 provides for the embodiment of the present invention one;
The schematic flow sheet of the information processing method that Fig. 2 provides for the embodiment of the present invention two;
The schematic flow sheet of the information processing method that Fig. 3 provides for the embodiment of the present invention three;
The schematic flow sheet of the information processing method that Fig. 4 provides for the embodiment of the present invention four;
The schematic flow sheet of the information processing method that Fig. 5 provides for the embodiment of the present invention five;
The schematic flow sheet of the information processing method that Fig. 6 provides for the embodiment of the present invention six;
The structural representation of the signal conditioning package that Fig. 7 provides for the embodiment of the present invention seven.
Embodiment
Below in conjunction with drawings and Examples, the present invention is described in further detail.Be understandable that, specific embodiment described herein is only for explaining the present invention, but not limitation of the invention.It also should be noted that, for convenience of description, illustrate only part related to the present invention in accompanying drawing but not entire infrastructure.
The executive agent of the information processing method that the embodiment of the present invention provides can be signal conditioning package, this signal conditioning package can be there is communication function and the information processing function electronic equipment as server etc., also can be a functional module of this electronic equipment.
Embodiment one
See Fig. 1, the information processing method that the present embodiment provides specifically comprises: operation 11-operation 14.
In operation 11, receive the sight spot information of input.
Wherein, sight spot information can comprise the title of tourist attractions, also can comprise the title of multiple tourist attractions.Can be the sight spot in same area (such as same country, same province, same urban district, same county town, same village) in multiple tourist attractions, also can be the sight spot in multiple different regions (such as country variant, different province, different urban district, different county town, different village).
In operation 12, according to described sight spot information to sights, obtain sight spot complete sequence, described sight spot complete sequence contains all sight spots in described sight spot information.
Concrete, can sort out in the geographic position first residing for each sight spot, the sight spot in same area (such as same urban district) is classified as a class, and sorting in each sight spot of geographic position to different regions residing for user, obtains sight spot complete sequence.Such as, following sight spot is comprised: Jiu Zhaigou, Gulang Island, Shangri-la, Xishuangbanna, Yang Shuo, Thousand-Island Lake, the Summer Palace and the Forbidden City in described sight spot information, user is at present in Beijing, then sort according to distance Pekinese, present position, each sight spot distance, then the sight spot total order obtained is classified as the Summer Palace, the Forbidden City, Thousand-Island Lake, Gulang Island, Yang Shuo, Shangri-la, Xishuangbanna, Jiu Zhaigou.
Wherein, the geographic position residing for user can judge to obtain according to the IP address of user's used terminal or ownership place.
In operation 13, described sight spot complete sequence is divided into sight spot subsequence.
The all sight spots in described sight spot information are contained due to described sight spot complete sequence, and the geographic position residing for each sight spot is also not quite similar, user will spend the time of one day or several days, just can go over all sight spots, therefore need to divide sight spot complete sequence, position residing for user divides the sight spot in the complete sequence of sight spot, obtains sight spot subsequence.Such as, according to the complete sequence Summer Palace, sight spot, the Forbidden City, Thousand-Island Lake, Gulang Island, Yang Shuo, Shangri-la, Xishuangbanna, Jiu Zhaigou, following sight spot subsequence can be obtained:
Sight spot subsequence 1: the Summer Palace, the Forbidden City;
Sight spot subsequence 2: Thousand-Island Lake, Gulang Island;
Sight spot subsequence 3: Yang Shuo, Shangri-la, Xishuangbanna;
Sight spot subsequence 4: Jiu Zhaigou.
In operation 14, according to described sight spot subsequence, return result, wherein, described result comprises the time devided modulation information at all sight spots in described sight spot information.
Such as, according to the sight spot subsequence divided in operation 13, following result can be obtained:
First day best tourist attractions in the morning are the Summer Palace, first day best tourist attractions in afternoon are the Forbidden City; The next morning, best tourist attractions were Thousand-Island Lake, the best Gulang Island, tourist attractions of the second afternoon; The best in 3rd day morning tourist attractions are Yang Shuo, the best at the 3rd day noon tourist attractions are Shangri-la, the best tourist attractions of the 3rd afternoon are Xishuangbanna; 4th day best tourist attractions: Jiu Zhaigou.
The information processing method that the present embodiment provides, by receiving the sight spot information of user's input, according to described sight spot information, sorted in all sight spots, obtain sight spot complete sequence, then described sight spot complete sequence is being divided into sight spot subsequence, according to described sight spot subsequence, the result of the time devided modulation information at all sight spots comprised in described sight spot information is returned for user, make no matter user needs the sight spot quantity of accessing to have how many, sequence process can be carried out and obtain sight spot complete sequence, then sight spot subsequence is divided into, this sight spot subsequence can be altogether consuming time is the travelling route of a day, thus achieve the planning travelling route more than a day consuming time, the sight spot that can be about to travel according to user is the Best Times assignment information that user cooks up tourist attractions, and be not only confined to the plan of the tourist attractions that some day is provided, improve information processing dirigibility, add the diversity of tourism planning.
Exemplary, above-mentioned according to described sight spot information to before sights, also comprise:
Receive at least one information in the traffic time of input, dining place and lodging Locale information.
Exemplary, above-mentioned according to described sight spot information to before sights, also comprise:
Tourism scheme in described sight spot information and user's original content UGC is matched;
When it fails to match, trigger perform described according to described sight spot information to sights.
Exemplary, above-mentioned when the match is successful, return the tourism scheme in the UGC matched with described sight spot information.
Exemplary, above-mentioned according to described sight spot information to sights, obtain sight spot complete sequence, comprising:
From described sight spot information, head sight spot and tail sight spot is selected according to described traffic time information;
To the sight spot in described all sight spots except described head sight spot and tail sight spot, adopt traveling salesman problem TSP algorithm to sort, obtain sight spot sequence;
Before described head sight spot is placed on described sight spot sequence, after described tail sight spot is placed on described sight spot sequence, obtain described sight spot complete sequence.
Exemplary, above-mentioned according to described sight spot information to sights, obtain sight spot complete sequence, comprising:
Adopt traveling salesman problem TSP algorithm to sort to all sight spots that described sight spot information provides, obtain described sight spot complete sequence.
Exemplary, above-mentioned described sight spot complete sequence is divided into sight spot subsequence, comprises:
Travel through the sight spot in the complete sequence of described sight spot, mate with sky, sight spot sequence, wherein, sky, described sight spot sequence is the sight spot being in line or forming a line, and the duration that sky, described sight spot sequence pair is answered is one day;
Using with sky, the sight spot sequence that the match is successful of the sight spot in the complete sequence of sight spot as described sight spot subsequence;
Or, comprising:
According to the time, described sight spot complete sequence is divided into sight spot subsequence.
Exemplary, above-mentionedly according to the time, described sight spot complete sequence is divided into sight spot subsequence, comprises:
According to the traffic duration between the consuming time and adjacent sight spot that each sight spot in the complete sequence of described sight spot is corresponding, daily by the complete sequence segmentation of described sight spot, obtain described sight spot subsequence.
Exemplary, above-mentioned according to described sight spot subsequence, return result, comprising:
Return described sight spot subsequence and corresponding time devided modulation information;
Or, comprising:
Adopt at least one mode in traveling salesman problem TSP algorithm and access index, adjust the sight spot order in the subsequence of described sight spot, be optimized sight spot subsequence, wherein, access index comprises accesses exponential sum the morning and accesses index afternoon, access index and equal this sight spot in history is accessed in the morning at a certain sight spot, the morning, accessed number of times was divided by accessed number of times in afternoon, access index and equal this sight spot in history is accessed in the afternoon at this sight spot, and afternoon, accessed number of times was divided by accessed number of times in the morning;
Return described optimization sight spot subsequence and corresponding time devided modulation information;
Or, comprising:
Adjust the order between the subsequence of described sight spot;
Return the described sight spot subsequence after adjustment order and corresponding time devided modulation information.
Exemplary, above-mentioned according to described sight spot subsequence, return result, comprising:
From the lodging place that described lodging Locale information provides, the nearest place in first sight spot or last sight spot in sight spot subsequence described in chosen distance, as the lodging place distributing to described sight spot subsequence;
Return described sight spot subsequence, the lodging place of distribution and time assignment information.
Exemplary, above-mentioned according to described sight spot subsequence, return result, comprising:
From the dining place that described dining Locale information provides, select the dining place nearest with the sight spot in the subsequence of described sight spot, as the dining place distributing to described sight spot subsequence according to the meal time;
Return described sight spot subsequence, the dining place of distribution and time assignment information.
Embodiment two
See Fig. 2, the information processing method that the present embodiment two provides specifically comprises: operation 21-operation 26.
In operation 21, receive the sight spot information of input, refer to the explanation in above-described embodiment one, repeat no more here.
In operation 22, the tourism scheme in described sight spot information and user's original content (User Generated Content, UGC) is matched.When it fails to match, executable operations 23; When the match is successful, executable operations 26.
Such as, when the travelling route of in UGC contains all sight spots that described sight spot information provides, then judge that the match is successful, otherwise it fails to match.
In operation 23, according to described sight spot information to sights, obtain sight spot complete sequence, then executable operations 24.Sequence and sight spot complete sequence refer to the explanation in above-described embodiment one, repeat no more here.
In operation 24, described sight spot complete sequence is divided into sight spot subsequence, then executable operations 25.Wherein, division and sight spot subsequence refer to the explanation in above-described embodiment one, repeat no more here.
In operation 25, according to described sight spot subsequence, return result, wherein, described result comprises the time devided modulation information at all sight spots in described sight spot information.
For following sight spot subsequence:
Sight spot subsequence 1: the Summer Palace, the Forbidden City;
Sight spot subsequence 2: Thousand-Island Lake, Gulang Island;
Sight spot subsequence 3: Yang Shuo, Shangri-la, Xishuangbanna;
Sight spot subsequence 4: Jiu Zhaigou.
At least one mode in traveling salesman problem (TSP) algorithm and access index can be adopted, adjust the sight spot order in the subsequence of described sight spot, be optimized sight spot subsequence, then returns described optimization sight spot subsequence and corresponding time devided modulation information.Such as, calling traveling salesman problem (Traveling SalesmanProblem, TSP) while algorithm adjusts the sight spot of every day, make to access the morning index high be placed on before the sequence of sight spot as far as possible, access afternoon index high be placed on after sequence as far as possible, obtain the adjustment result as following table one, and return.
Table one
Or, the order between the subsequence of described sight spot can also be adjusted, return the described sight spot subsequence after adjustment order and corresponding time devided modulation information.As shown in following table two:
Table two
In operation 26, return the tourism scheme in the UGC matched with described sight spot information.
The information processing method that the present embodiment provides, by receive user input sight spot information, the tourism scheme in described sight spot information and user's original content UGC is matched, when it fails to match, then trigger execution described according to described sight spot information to sights.When the match is successful, then directly return the tourism scheme in the UGC matched with described sight spot information, improve the efficiency of information processing, and make no matter user needs the sight spot quantity of accessing to have how many, sequence process can be carried out and obtain sight spot complete sequence, then sight spot subsequence is divided into, this sight spot subsequence can be altogether consuming time is the travelling route of a day, thus achieve the planning travelling route more than a day consuming time, the sight spot that can be about to travel according to user is the Best Times assignment information that user cooks up tourist attractions, and be not only confined to the plan of the tourist attractions that some day is provided, improve information processing dirigibility, add the diversity of tourism planning.
Embodiment three
See Fig. 3, the information processing method that the present embodiment three provides specifically comprises: operation 31-operation 36.
In operation 31, receive the sight spot information of input, traffic time, dining place and lodging Locale information.
Wherein, traffic time is the journey time come and gone of user, can arrive the sight spot on-site time, or return the time in residence from sight spot for vehicle.
In operation 32, from described sight spot information, select head sight spot and tail sight spot according to described traffic time information.
Wherein, head sight spot and tail sight spot are chosen according to described traffic time information.Such as, user reaches a certain sight spot noon, then choose the sight spot of object for appreciation in applicable afternoon as head sight spot, i.e. the sight spot of first day object for appreciation.When user needs to return to residence by bus the noon of in the end one day, then choose sight spot near station as tail sight spot, the sight spot of playing when being namely applicable to returning last day.
In operation 33, to the sight spot in described all sight spots except described head sight spot and tail sight spot, adopt traveling salesman problem TSP algorithm to sort, obtain sight spot sequence.
In operation 34, before described head sight spot is placed on described sight spot sequence, after described tail sight spot is placed on described sight spot sequence, obtain described sight spot complete sequence.
In operation 35, described sight spot complete sequence is divided into sight spot subsequence, refers to the explanation in above-described embodiment one, repeat no more here.
In operation 36, according to described sight spot subsequence and have dinner place and lodging Locale information, return result.
Concrete, the lodging place that can provide from described lodging Locale information, the nearest place in first sight spot or last sight spot in sight spot subsequence described in chosen distance, as the lodging place distributing to described sight spot subsequence, return described sight spot subsequence, the lodging place of distribution and time assignment information.Such as, user-selected hotel is placed into respectively in the suitable period and distributes to corresponding sight spot subsequence in other words, the foundation of placing is hotel and first of every day, the distance at last sight spot, select nearest hotel as the hotel moved in the same day, finally return the result as shown in following table three:
Table three
The dining place that can also provide from described dining Locale information, select the dining place nearest with the sight spot in the subsequence of described sight spot, as the dining place distributing to described sight spot subsequence according to the meal time.Such as, user-selected restaurant distance is inserted between nearest sight spot, make route optimum, judge that the restaurant of put position is whether near meal point again, not meal point words then corresponding reach or after move, until be just in time meal point, if same meal point arranges multiple restaurant, then only associate the restaurant of one of them optimum, finally return the result as shown in following table four:
Table four
The information processing method that the present embodiment provides, by receiving the sight spot information of user's input, according to described sight spot information, sorted in all sight spots, obtain sight spot complete sequence, then described sight spot complete sequence is being divided into sight spot subsequence, according to described sight spot subsequence and have dinner place and lodging Locale information, return result, make result more meet the demand of user, improve Consumer's Experience, add diversity and the dirigibility of result.Further, the present embodiment can be that user distributes best tourist attractions according to the traffic time information of user, improves QoS of customer.
Embodiment four
See Fig. 4, the information processing method that the present embodiment four provides specifically comprises: operation 41-operation 46.
In operation 41, receive the sight spot information of input, refer to the explanation in above-described embodiment one, repeat no more here.
In operation 42, adopt traveling salesman problem TSP algorithm to sort to all sight spots that described sight spot information provides, obtain described sight spot complete sequence.
In operation 43, travel through the sight spot in the complete sequence of described sight spot, mate with sky, sight spot sequence, when it fails to match, executable operations 44; Otherwise, executable operations 45.Wherein, sky, described sight spot sequence is the sight spot being in line or forming a line, and the duration that sky, described sight spot sequence pair is answered is one day.
Wherein, sky, sight spot sequence is extracted from the tourism scheme UGC.Such as, from UGC database, extract a whole set of tourism scheme (comprising sight spot and point sky information), delete number of travels too low, or the irrational tourism scheme of arrangement of time.According to the tourism scheme filtered out, extract the sight spot sequence of every day, sort according to the tourism number of times at sight spot, arrangement of time and user comment, and delete the too low sight spot of user comment, preserve these sight spot sequences, as sky, sight spot sequence.
In operation 44, adopt the order at all sight spots of TSP algorithmic rule.Travel through the sight spot in the complete sequence of described sight spot, according to the geographic position of play total number of days and the distribution of all sight spots, distribute the sight spot be applicable to every day.Such as, for a certain sight spot, if geographic position and be suitable for the time of playing and all match with the geographic position on user same day and time, then this sight spot is about to the sight spot of playing as user, for unappropriated sight spot, this sight spot of playing can be continued according to consuming time judging whether on road between the sight spot time of having played and sight spot, until reach the upper limit of one day time of playing, sight spot of being played as the same day in traveled through sight spot.For the sight spot of residue number of days, then adopt similar method traversal residue sight spot, until all traveled through.
In addition, for first day and last day, if user arrives the time inadequate a whole day in city, place, sight spot, such as, when arriving sight spot noon, then the sight spot that first day is played arranges separately, select the sight spot that applicable afternoon or evening play as far as possible, or select from the sight spot close to railway station/airport, last day is similar, if user is the ticket in afternoon or evening, then select the sight spot that applicable morning or the morning play, or select from the sight spot close to railway station/airport.
Afterwards, executable operations 46.
Operation 45 in, using with sky, the sight spot sequence that the match is successful of the sight spot in the complete sequence of sight spot as described sight spot subsequence, then executable operations 46.
In operation 46, according to the sight spot subsequence that 44 or 45 obtain, return result.Refer to the explanation in above-described embodiment, repeat no more here.
The present embodiment is by receiving the sight spot information of user's input, traveling salesman problem TSP algorithm is adopted to sort to all sight spots that described sight spot information provides, obtain described sight spot complete sequence, then travel through the sight spot in the complete sequence of described sight spot, mate with sky, sight spot sequence, according to sky, described sight spot sequence, return result, improve the efficiency of information processing, optimize sight spot subsequence further, improve the rationality of result.And make no matter user needs the sight spot quantity of accessing to have how many, sequence process can be carried out and obtain sight spot complete sequence, then sight spot subsequence is divided into, this sight spot subsequence can be altogether consuming time is the travelling route of a day, thus achieve the planning travelling route more than a day consuming time, the sight spot that can be about to travel according to user is the Best Times assignment information that user cooks up tourist attractions, and be not only confined to the plan of the tourist attractions that some day is provided, improve information processing dirigibility, add the diversity of tourism planning.
Embodiment five
See Fig. 5, the information processing method that the present embodiment five provides specifically comprises: operation 51-operation 54.
In operation 51, receive the sight spot information of input, refer to the explanation in above-described embodiment one, repeat no more here.
In operation 52, according to described sight spot information to sights, obtain sight spot complete sequence, described sight spot complete sequence contains all sight spots in described sight spot information, refers to the explanation in above-described embodiment one, repeats no more here.
In operation 53, according to the time, described sight spot complete sequence is divided into sight spot subsequence.
Concrete, according to the traffic duration between consuming time and adjacent sight spot corresponding to each sight spot in the complete sequence of described sight spot, daily by the complete sequence segmentation of described sight spot, described sight spot subsequence can be obtained.
Such as, in described sight spot information, comprise following sight spot: Jiu Zhaigou, Gulang Island, Shangri-la, Xishuangbanna, Yang Shuo, Thousand-Island Lake, the Summer Palace and the Forbidden City, corresponding consuming time as shown in following table five in each sight spot:
Table five
| Sight spot | Jiu Zhaigou | Gulang Island | Shangri-la | Xishuangbanna | Yang Shuo | Thousand-Island Lake | The Summer Palace | The Forbidden City |
| Consuming time | 5 | 3 | 3 | 4 | 2 | 3 | 3 | 3 |
Traffic duration between adjacent sight spot is as shown in following table six:
Table six
Then according to the traffic duration in consuming time and upper table six corresponding to each sight spot in described upper table five between adjacent sight spot, daily by the complete sequence segmentation of described sight spot, the sight spot subsequence obtained is as shown in following table seven:
Table seven
| First day | The Summer Palace, the Forbidden City |
| Second day | Thousand-Island Lake, Gulang Island |
| 3rd day | Yang Shuo, Shangri-la |
| 4th day | Xishuangbanna |
| 5th day | Jiu Zhaigou |
In operation 54, return result according to described sight spot subsequence, refer to the explanation in above-described embodiment, repeat no more here.
The present embodiment is by receiving the sight spot information of user's input, according to described sight spot information, sorted in all sight spots, obtain sight spot complete sequence, then described sight spot complete sequence is being divided into sight spot subsequence, according to described sight spot subsequence, the result of the time devided modulation information at all sight spots comprised in described sight spot information is returned for user, make no matter user needs the sight spot quantity of accessing to have how many, sequence process can be carried out and obtain sight spot complete sequence, then sight spot subsequence is divided into, this sight spot subsequence can be altogether consuming time is the travelling route of a day, thus achieve the planning travelling route more than a day consuming time, the sight spot that can be about to travel according to user is the Best Times assignment information that user cooks up tourist attractions, and be not only confined to the plan of the tourist attractions that some day is provided, improve information processing dirigibility, add the diversity of tourism planning.
Embodiment six
See Fig. 6, the information processing method that the present embodiment six provides specifically comprises: operation 61-operation 68.
Operation 61 in, receive input sight spot information and traffic time, dining place, lodging place.
In operation 62, mate with the tourism scheme in UGC.Such as, signal conditioning package can carry out data encasement under the state of off-line.As from a whole set of tourism scheme of UGC extracting data (containing sight spot and a point sky information), from the whole series tourism scheme extracted, then filter occurrence number in UGC data too low, or time too irrational scheme.For another example the sight spot sequence of every day in UGC data extracted, according to occurrence number, time rationality sequence, filter the sight spot sequence that comprehensive grading is too low, preserving these sight spot sequences is sky, sight spot sequence.And for example from UGC extracting data go out sight spot be suitable for traffic plan between the time of playing, sight spot, access index in the morning at sight spot and/or access index in the afternoon, etc.
Mate with the whole series scheme of tourism extracted in UGC according to the sight spot information inputted and traffic time, if it fails to match, then executable operations 63.If the match is successful, then executable operations 67.
In operation 63, obtain sight spot complete sequence, executable operations 64.
Refer to the explanation in above-described embodiment, repeat no more here.
In operation 64, obtain sky, sight spot sequence, executable operations 65.
Refer to the explanation in above-described embodiment, repeat no more here.
In operation 65, optimize sights in sky, sight spot sequence, executable operations 606.
Such as, adopt at least one mode in traveling salesman problem algorithm and access index, adjust the sight spot order in sky, described sight spot sequence, be optimized sky, sight spot sequence.
In operation 66, the sequence between adjustment sky, sight spot sequence, executable operations 67.
Refer to the explanation in above-described embodiment, repeat no more here.
In operation 67, lodging place associates, executable operations 68.
Such as, the lodging place that can provide from described lodging Locale information, the nearest place in first sight spot or last sight spot in sight spot subsequence described in chosen distance, as the lodging place distributing to described sight spot subsequence, return described sight spot subsequence, the lodging place of distribution and time assignment information.Such as, user-selected hotel is placed into respectively in the suitable period and distributes to corresponding sight spot subsequence in other words, the foundation of placing is hotel and first of every day, the distance at last sight spot, select nearest hotel as the hotel moved in the same day, finally return the result as above shown in table three.
In operation 68, the association of dining place.
Such as, the dining place that can provide from described dining Locale information, the dining place nearest with the sight spot in the subsequence of described sight spot is selected according to the meal time, as the dining place distributing to described sight spot subsequence, return described sight spot subsequence, distribution and time assignment information.Such as, user-selected restaurant distance is inserted between nearest sight spot, make route optimum, judge that the restaurant of put position is whether near meal point again, not meal point words then corresponding reach or after move, until be just in time meal point, if same meal point arranges multiple restaurant, then only associate the restaurant of one of them optimum, finally return the time devided modulation information processing result at all sight spots as above shown in table four.
Embodiment seven
See Fig. 7, the signal conditioning package that the present embodiment seven provides specifically comprises: receiver module 71, order module 72, divide module 73 and return module 74.
Receiver module 71 is for receiving the sight spot information of input;
Order module 72 for according to described sight spot information to sights, obtain sight spot complete sequence, described sight spot complete sequence contains all sight spots in described sight spot information;
Divide module 73 for described sight spot complete sequence is divided into sight spot subsequence;
Return module 74 for according to described sight spot subsequence, return result, wherein, described result comprises the time devided modulation information at all sight spots in described sight spot information.
Exemplary, above-mentioned receiver module 71 also for described order module 72 according to described sight spot information to sights before, receive at least one information in the traffic time of input, dining place and lodging Locale information.
Exemplary, said apparatus also comprises: matching module 75 and trigger module 76.
Matching module 75 for described order module 72 according to described sight spot information to sights before, the tourism scheme in described sight spot information and user's original content UGC is matched;
Trigger module 76, for when it fails to match for described matching module 75, triggers described order module 72 and performs according to described sight spot information sights.
Exemplary, above-mentioned return module 74 specifically for:
When the match is successful for described matching module 75, return the tourism scheme in the UGC matched with described sight spot information.
Exemplary, above-mentioned order module 72 specifically for:
From described sight spot information, head sight spot and tail sight spot is selected according to described traffic time information;
To the sight spot in described all sight spots except described head sight spot and tail sight spot, adopt traveling salesman problem TSP algorithm to sort, obtain sight spot sequence;
Before described head sight spot is placed on described sight spot sequence, after described tail sight spot is placed on described sight spot sequence, obtain described sight spot complete sequence.
Exemplary, above-mentioned order module 72 specifically for: adopt traveling salesman problem TSP algorithm to sort to all sight spots that described sight spot information provides, obtain described sight spot complete sequence.
Exemplary, above-mentioned division module 73 comprises: traversal submodule 731 and division submodule 732.
Traversal submodule 731 is for traveling through the sight spot in the complete sequence of described sight spot, and mate with sky, sight spot sequence, wherein, sky, described sight spot sequence is the sight spot being in line or forming a line, and the duration that sky, described sight spot sequence pair is answered is one day.
Divide submodule 732 for using with sky, the sight spot sequence that the match is successful of the sight spot in the complete sequence of sight spot as described sight spot subsequence; Or, according to the time, described sight spot complete sequence is divided into sight spot subsequence.
Exemplary, above-mentioned division submodule 732 specifically for:
According to the traffic duration between the consuming time and adjacent sight spot that each sight spot in the complete sequence of described sight spot is corresponding;
Daily by the complete sequence segmentation of described sight spot, obtain described sight spot subsequence.
Exemplary, above-mentioned return module 74 specifically for:
Return described sight spot subsequence and corresponding time devided modulation information;
Or, specifically for:
Adopt at least one mode in traveling salesman problem algorithm and access index, adjust the sight spot order in the subsequence of described sight spot, be optimized sight spot subsequence;
Return described optimization sight spot subsequence and corresponding time devided modulation information;
Or, specifically for:
Adjust the order between the subsequence of described sight spot;
Return the described sight spot subsequence after adjustment order and corresponding time devided modulation information.
Exemplary, above-mentioned return module 74 specifically for:
From the lodging place that described lodging Locale information provides, the nearest place in first sight spot or last sight spot in sight spot subsequence described in chosen distance, as the lodging place distributing to described sight spot subsequence; Return described sight spot subsequence, the lodging place of distribution and time assignment information.
Exemplary, above-mentioned return module 74 specifically for:
From the dining place that described dining Locale information provides, select the dining place nearest with the sight spot in the subsequence of described sight spot, as the dining place distributing to described sight spot subsequence according to the meal time; Return described sight spot subsequence, the dining place of distribution and time assignment information.
Above-mentioned signal conditioning package can perform the information processing method that any embodiment of the present invention provides, and possesses and respectively operates corresponding functional module and beneficial effect with information processing method.
Note, above are only preferred embodiment of the present invention and institute's application technology principle.Skilled person in the art will appreciate that and the invention is not restricted to specific embodiment described here, various obvious change can be carried out for a person skilled in the art, readjust and substitute and can not protection scope of the present invention be departed from.Therefore, although be described in further detail invention has been by above embodiment, the present invention is not limited only to above embodiment, when not departing from the present invention's design, can also comprise other Equivalent embodiments more, and scope of the present invention is determined by appended right.
Claims (22)
1. an information processing method, is characterized in that, comprising:
Receive the sight spot information of input;
According to described sight spot information to sights, obtain sight spot complete sequence, described sight spot complete sequence contains all sight spots in described sight spot information;
Described sight spot complete sequence is divided into sight spot subsequence;
According to described sight spot subsequence, return result, wherein, described result comprises the time devided modulation information at all sight spots in described sight spot information.
2. method according to claim 1, is characterized in that, according to described sight spot information to before sights, also comprises:
Receive at least one information in the traffic time of input, dining place and lodging Locale information.
3. method according to claim 1, is characterized in that, according to described sight spot information to before sights, also comprises:
Tourism scheme in described sight spot information and user's original content UGC is matched;
When it fails to match, trigger perform described according to described sight spot information to sights.
4. method according to claim 3, is characterized in that, when the match is successful, returns the tourism scheme in the UGC matched with described sight spot information.
5. method according to claim 2, is characterized in that, according to described sight spot information to sights, obtains sight spot complete sequence, comprising:
From described sight spot information, head sight spot and tail sight spot is selected according to described traffic time information;
To the sight spot in described all sight spots except described head sight spot and tail sight spot, adopt traveling salesman problem TSP algorithm to sort, obtain sight spot sequence;
Before described head sight spot is placed on described sight spot sequence, after described tail sight spot is placed on described sight spot sequence, obtain described sight spot complete sequence.
6. method according to claim 1, is characterized in that, according to described sight spot information to sights, obtains sight spot complete sequence, comprising:
Adopt traveling salesman problem TSP algorithm to sort to all sight spots that described sight spot information provides, obtain described sight spot complete sequence.
7. the method according to any one of claim 1-6, is characterized in that, described sight spot complete sequence is divided into sight spot subsequence, comprises:
Travel through the sight spot in the complete sequence of described sight spot, mate with sky, sight spot sequence, wherein, sky, described sight spot sequence is the sight spot being in line or forming a line, and the duration that sky, described sight spot sequence pair is answered is one day;
Using with sky, the sight spot sequence that the match is successful of the sight spot in the complete sequence of sight spot as described sight spot subsequence;
Or, comprising:
According to the time, described sight spot complete sequence is divided into sight spot subsequence.
8. method according to claim 7, is characterized in that, according to the time, described sight spot complete sequence is divided into sight spot subsequence, comprises:
According to the traffic duration between the consuming time and adjacent sight spot that each sight spot in the complete sequence of described sight spot is corresponding, daily by the complete sequence segmentation of described sight spot, obtain described sight spot subsequence.
9. the method according to any one of claim 1-6, is characterized in that, according to described sight spot subsequence, returns result, comprising:
Return described sight spot subsequence and corresponding time devided modulation information;
Or, comprising:
Adopt at least one mode in traveling salesman problem TSP algorithm and access index, adjust the sight spot order in the subsequence of described sight spot, be optimized sight spot subsequence;
Return described optimization sight spot subsequence and corresponding time devided modulation information;
Or, comprising:
Adjust the order between the subsequence of described sight spot;
Return the described sight spot subsequence after adjustment order and corresponding time devided modulation information.
10. the method according to any one of claim 2-6, is characterized in that, according to described sight spot subsequence, returns result, comprising:
From the lodging place that described lodging Locale information provides, the nearest place in first sight spot or last sight spot in sight spot subsequence described in chosen distance, as the lodging place distributing to described sight spot subsequence;
Return described sight spot subsequence, the lodging place of distribution and time assignment information.
11. methods according to any one of claim 2-6, is characterized in that, according to described sight spot subsequence, return result, comprising:
From the dining place that described dining Locale information provides, select the dining place nearest with the sight spot in the subsequence of described sight spot, as the dining place distributing to described sight spot subsequence according to the meal time;
Return described sight spot subsequence, the dining place of distribution and time assignment information.
12. 1 kinds of signal conditioning packages, is characterized in that, comprising:
Receiver module, for receiving the sight spot information of input;
Order module, for according to described sight spot information to sights, obtain sight spot complete sequence, described sight spot complete sequence contains all sight spots in described sight spot information;
Divide module, for described sight spot complete sequence is divided into sight spot subsequence;
Return module, for according to described sight spot subsequence, return result, wherein, described result comprises the time devided modulation information at all sight spots in described sight spot information.
13. devices according to claim 12, it is characterized in that, described receiver module also for: described order module according to described sight spot information to sights before, receive input traffic time, dining place and lodging Locale information at least one information.
14. devices according to claim 12, is characterized in that, described device also comprises:
Matching module, for described order module according to described sight spot information to sights before, the tourism scheme in described sight spot information and user's original content UGC is matched;
Trigger module, for when it fails to match for described matching module, triggers described order module and performs according to described sight spot information sights.
15. devices according to claim 14, is characterized in that, described in return module specifically for: when the match is successful for described matching module, return the tourism scheme in the UGC matched with described sight spot information.
16. devices according to claim 13, is characterized in that, described order module specifically for:
From described sight spot information, head sight spot and tail sight spot is selected according to described traffic time information;
To the sight spot in described all sight spots except described head sight spot and tail sight spot, adopt traveling salesman problem TSP algorithm to sort, obtain sight spot sequence;
Before described head sight spot is placed on described sight spot sequence, after described tail sight spot is placed on described sight spot sequence, obtain described sight spot complete sequence.
17. devices according to claim 12, is characterized in that, described order module specifically for:
Adopt traveling salesman problem TSP algorithm to sort to all sight spots that described sight spot information provides, obtain described sight spot complete sequence.
18. devices according to any one of claim 12-17, it is characterized in that, described division module comprises:
Traversal submodule, for traveling through the sight spot in the complete sequence of described sight spot, mate with sky, sight spot sequence, wherein, sky, described sight spot sequence is the sight spot being in line or forming a line, and the duration that sky, described sight spot sequence pair is answered is one day;
Divide submodule, for using with sky, the sight spot sequence that the match is successful of the sight spot in the complete sequence of sight spot as described sight spot subsequence; Or, according to the time, described sight spot complete sequence is divided into sight spot subsequence.
19. devices according to claim 18, is characterized in that, described division submodule specifically for:
According to the traffic duration between the consuming time and adjacent sight spot that each sight spot in the complete sequence of described sight spot is corresponding, daily by the complete sequence segmentation of described sight spot, obtain described sight spot subsequence.
20. devices according to any one of claim 12-17, is characterized in that, described in return module specifically for:
Return described sight spot subsequence and corresponding time devided modulation information;
Or, specifically for:
Adopt at least one mode in traveling salesman problem TSP algorithm and access index, adjust the sight spot order in the subsequence of described sight spot, be optimized sight spot subsequence;
Return described optimization sight spot subsequence and corresponding time devided modulation information;
Or, specifically for:
Adjust the order between the subsequence of described sight spot; Return the described sight spot subsequence after adjustment order and corresponding time devided modulation information.
21. devices according to any one of claim 13-17, is characterized in that, described in return module specifically for:
From the lodging place that described lodging Locale information provides, the nearest place in first sight spot or last sight spot in sight spot subsequence described in chosen distance, as the lodging place distributing to described sight spot subsequence;
Return described sight spot subsequence, the lodging place of distribution and time assignment information.
22. devices according to any one of claim 13-17, is characterized in that, described in return module specifically for:
From the dining place that described dining Locale information provides, select the dining place nearest with the sight spot in the subsequence of described sight spot, as the dining place distributing to described sight spot subsequence according to the meal time;
Return described sight spot subsequence, the dining place of distribution and time assignment information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410804393.1A CN104572873B (en) | 2014-12-19 | 2014-12-19 | Information processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410804393.1A CN104572873B (en) | 2014-12-19 | 2014-12-19 | Information processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104572873A true CN104572873A (en) | 2015-04-29 |
| CN104572873B CN104572873B (en) | 2019-04-09 |
Family
ID=53088935
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410804393.1A Active CN104572873B (en) | 2014-12-19 | 2014-12-19 | Information processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104572873B (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106874455A (en) * | 2017-02-13 | 2017-06-20 | 北京奇虎科技有限公司 | Task scheduling recommends method, device and server |
| CN107481164A (en) * | 2017-08-18 | 2017-12-15 | 四川融慧文创旅游资源开发有限公司 | Tourist resources differentiated control platform and service terminal |
| WO2018018199A1 (en) * | 2016-07-24 | 2018-02-01 | 严映军 | Shortest distance-based hotel reservation method and room reservation system |
| WO2018018201A1 (en) * | 2016-07-24 | 2018-02-01 | 严映军 | Method for information presentation during hotel recommendation and room reservation system |
| WO2018018208A1 (en) * | 2016-07-24 | 2018-02-01 | 严映军 | Method for collecting usage statistics of hotel-based scenic spot recommendation technology, and search system |
| WO2018018200A1 (en) * | 2016-07-24 | 2018-02-01 | 严映军 | Data acquisition method for scenic spot-based hotel recommendation technology and room reservation system |
| CN108171354A (en) * | 2016-12-07 | 2018-06-15 | 奇点无限有限公司 | Service uses the planing method of sequence |
| US10686835B2 (en) | 2014-12-10 | 2020-06-16 | Baidu Online Network Technology (Beijing) Co., Ltd. | Method and device for providing authentication information on web page |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002197150A (en) * | 2000-10-18 | 2002-07-12 | Seiko Epson Corp | Travel schedule providing system |
| CN101738188A (en) * | 2008-11-27 | 2010-06-16 | 财团法人资讯工业策进会 | Device and method for recommending scenery spot |
| TW201040498A (en) * | 2009-05-15 | 2010-11-16 | Kitravel | Travel planning system and the method thereof |
| CN101963960A (en) * | 2009-07-22 | 2011-02-02 | 刘旸 | Travel route and scheduling generation method and server |
| CN103020308A (en) * | 2013-01-07 | 2013-04-03 | 北京趣拿软件科技有限公司 | Method and device for recommending travel strategy project |
| CN103402173A (en) * | 2013-07-18 | 2013-11-20 | 合肥工业大学 | Touring time optimization method for tourist attractions |
| CN103678429A (en) * | 2012-09-26 | 2014-03-26 | 阿里巴巴集团控股有限公司 | Recommendation method and device of tour routes |
| CN103885983A (en) * | 2012-12-21 | 2014-06-25 | 阿里巴巴集团控股有限公司 | Travelling route determining method, and optimizing method and device |
-
2014
- 2014-12-19 CN CN201410804393.1A patent/CN104572873B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002197150A (en) * | 2000-10-18 | 2002-07-12 | Seiko Epson Corp | Travel schedule providing system |
| CN101738188A (en) * | 2008-11-27 | 2010-06-16 | 财团法人资讯工业策进会 | Device and method for recommending scenery spot |
| TW201040498A (en) * | 2009-05-15 | 2010-11-16 | Kitravel | Travel planning system and the method thereof |
| CN101963960A (en) * | 2009-07-22 | 2011-02-02 | 刘旸 | Travel route and scheduling generation method and server |
| CN103678429A (en) * | 2012-09-26 | 2014-03-26 | 阿里巴巴集团控股有限公司 | Recommendation method and device of tour routes |
| CN103885983A (en) * | 2012-12-21 | 2014-06-25 | 阿里巴巴集团控股有限公司 | Travelling route determining method, and optimizing method and device |
| CN103020308A (en) * | 2013-01-07 | 2013-04-03 | 北京趣拿软件科技有限公司 | Method and device for recommending travel strategy project |
| CN103402173A (en) * | 2013-07-18 | 2013-11-20 | 合肥工业大学 | Touring time optimization method for tourist attractions |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10686835B2 (en) | 2014-12-10 | 2020-06-16 | Baidu Online Network Technology (Beijing) Co., Ltd. | Method and device for providing authentication information on web page |
| WO2018018199A1 (en) * | 2016-07-24 | 2018-02-01 | 严映军 | Shortest distance-based hotel reservation method and room reservation system |
| WO2018018201A1 (en) * | 2016-07-24 | 2018-02-01 | 严映军 | Method for information presentation during hotel recommendation and room reservation system |
| WO2018018208A1 (en) * | 2016-07-24 | 2018-02-01 | 严映军 | Method for collecting usage statistics of hotel-based scenic spot recommendation technology, and search system |
| WO2018018200A1 (en) * | 2016-07-24 | 2018-02-01 | 严映军 | Data acquisition method for scenic spot-based hotel recommendation technology and room reservation system |
| CN108171354A (en) * | 2016-12-07 | 2018-06-15 | 奇点无限有限公司 | Service uses the planing method of sequence |
| CN106874455A (en) * | 2017-02-13 | 2017-06-20 | 北京奇虎科技有限公司 | Task scheduling recommends method, device and server |
| CN106874455B (en) * | 2017-02-13 | 2021-02-19 | 北京奇虎科技有限公司 | Task plan recommendation method and device and server |
| CN107481164A (en) * | 2017-08-18 | 2017-12-15 | 四川融慧文创旅游资源开发有限公司 | Tourist resources differentiated control platform and service terminal |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104572873B (en) | 2019-04-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104572873A (en) | Information processing method and device | |
| Ellegood et al. | School bus routing problem: Contemporary trends and research directions | |
| Hesse | The city as a terminal: The urban context of logistics and freight transport | |
| González-González et al. | Parking futures: Preparing European cities for the advent of automated vehicles | |
| Lang et al. | The new metropolis: Rethinking megalopolis | |
| CN103885983B (en) | Determination method, optimization method and the device of a kind of travelling route | |
| CN106254525A (en) | A kind of information-pushing method and system | |
| CN104794663A (en) | Automatic itinerary generation system and method | |
| CN105159933A (en) | Tourism information recommendation method and apparatus | |
| KR101741942B1 (en) | Apparatus and method for providing smart sightseeing information based on big data | |
| Murel et al. | Potential for Abu Dhabi, Doha and Dubai Airports to reach their traffic objectives | |
| CN103294708A (en) | Route planning method and device based on public traffic system | |
| Kiilerich et al. | New large-scale data instances for CARP and new variations of CARP | |
| CN110544157A (en) | riding position recommendation method and device, electronic equipment and storage medium | |
| CN109724619A (en) | Information-pushing method, device and server | |
| CN104636457A (en) | Method and device for location search cognition | |
| Gore et al. | Assessment of technology strategies for sustainable tourism planning | |
| Kusnadi | Tourism destination development strategy ready-to-visit post pandemi Covid-19 in Sariater Subang Jawa Barat | |
| CN103617252A (en) | Retrieving and displaying method based on road names | |
| CN107133339A (en) | Circuit query method and apparatus and storage medium, processor | |
| Murgante et al. | Crowd-cloud tourism, new approaches to territorial marketing | |
| CN104331424B (en) | The purification method of sensitive trajectory model in a kind of user's motion track | |
| CN108717640B (en) | Data processing method of travel information and electronic equipment | |
| CN108121725A (en) | A kind of searching method and device | |
| CN109756887A (en) | High-speed rail is with mobile terminal recognition methods, device and computer readable 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |