CN111198903A - Poor trip route recommendation method and device and storage medium - Google Patents
Poor trip route recommendation method and device and storage medium Download PDFInfo
- Publication number
- CN111198903A CN111198903A CN201911173073.XA CN201911173073A CN111198903A CN 111198903 A CN111198903 A CN 111198903A CN 201911173073 A CN201911173073 A CN 201911173073A CN 111198903 A CN111198903 A CN 111198903A
- Authority
- CN
- China
- Prior art keywords
- persons
- poor
- route
- scenic spot
- tourists
- 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
- 238000000034 method Methods 0.000 title claims abstract description 32
- 230000004308 accommodation Effects 0.000 claims abstract description 16
- 238000004364 calculation method Methods 0.000 claims abstract description 15
- 238000012216 screening Methods 0.000 claims abstract description 5
- 238000003491 array Methods 0.000 claims abstract description 4
- 238000004590 computer program Methods 0.000 claims description 8
- 230000002093 peripheral effect Effects 0.000 claims description 8
- 230000009286 beneficial effect Effects 0.000 abstract description 3
- 238000011161 development Methods 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000009182 swimming Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2457—Query processing with adaptation to user needs
-
- 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)
- Tourism & Hospitality (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Health & Medical Sciences (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method for recommending a poor tour route, which comprises the following steps: receiving a poor trip route recommendation request sent by a user, wherein the recommendation request comprises travel time, travel traffic types, accommodation types and destination areas; screening out the sight spot arrays meeting the conditions according to the recommendation request; establishing a calculation model of the estimated number of people in the scenic spot; calculating the estimated number of the persons in the scenic spot by the calculation model; and calculating the playing time of all the routes of each scenic spot, solving the route with the shortest playing time, taking the route with the shortest playing time as a poor-tour route, and recommending the poor-tour route to the user. The invention carries out condition constraint through searching conditions such as planned travel time, accommodation preference, traffic preference, destination type and the like set by the user, and comprehensively calculates the poor-swimming recommended route meeting the conditions by combining with the lowest accommodation consumption, thereby being beneficial to helping the modern young people to make the poor-swimming plan. In addition, the invention also discloses a poor trip route recommendation device and a storage medium.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a poor trip route recommendation method, a poor trip route recommendation device and a storage medium.
Background
The comprehensive amusement park is one of popular choices for people to enjoy leisure, entertainment and vacation, and due to the large population base of China, every popular scenic spot and tourist city are full of people every year. Poor swimming is a mode of travel chosen by modern young people, especially many student parties.
However, in many poor tours, a complete route and route recommendation is not provided, the booking can be performed only according to hotels and air tickets searched by the user, and the aim of poor tourism is not achieved due to the fact that expenses such as traffic cost in a journey are not considered.
Disclosure of Invention
The invention aims to provide a method and a device for recommending a poor tour route and a storage medium.
In order to achieve the above object, the present invention provides a method for recommending a poor tour route, the method comprising:
receiving a poor trip route recommendation request sent by a user, wherein the recommendation request comprises travel time, travel traffic types, accommodation types and destination areas;
screening out the sight spot arrays meeting the conditions according to the recommendation request;
establishing a calculation model of the estimated number of people in the scenic spot;
acquiring the number of stations, the number of reserved persons of hotel rooms around, the number of persons playing on holidays and the number of persons travelling at the same period in each scenic spot in the scenic spot array, and substituting the number of persons playing on holidays and the number of persons travelling at the same period into the estimated number calculation model to obtain the estimated number of persons of the scenic spots;
and exhaustively arranging all the routes of each scenic spot, calculating the playing time of each route, solving the route with the shortest playing time, taking the route with the shortest playing time as a poor-tour route, and recommending the poor-tour route to a user.
Further, comprising: the calculation formula of the playing time of each route is as follows:
n denotes the number of said sights, dis [ P [)l(i),Pd(i)]The distance between any two of the attractions, W, is expressed as the user's walking speed.
Further, comprising: the method comprises the steps of obtaining a plurality of tourist walking images of a scenic spot, calculating walking speeds of the plurality of tourists by carrying out image recognition on the walking images, and taking the average value of the walking speeds of the plurality of tourists as the user walking speed.
Further, the calculation model of the number of the expected people in the scenic spot is Xp＝ax1+bx2+cx3+dx4Wherein X ispTo the expected number of people, x1、x2、x3、x4The system comprises a plurality of scenic spot stations, a plurality of hotel room bookings, a plurality of holiday play persons and a plurality of tourism persons, wherein the scenic spot stations, the hotel room bookings, the holiday play persons and the tourism persons are respectively the scenic spot stations, the hotel room bookings, the holiday play persons and the tourism persons in the same period.
Further, the number of the station people who acquire each sight spot in the sight spot array includes: and acquiring the traffic ticket selling data of each scenic spot in the scenic spot array, wherein one ticket is a person.
Further, the acquiring the number of the reserved persons in the peripheral hotel rooms comprises: and acquiring the booking data of the peripheral hotels, wherein 1 person is counted as each room of 1 person, 2 persons are counted as each room of two persons and a large bed room, and 3 persons are counted as each room of a family.
Further, the obtaining the number of people playing on the holidays in the holidays comprises: and acquiring historical data of weekday tourists of the scenic spot, and calculating the number of people playing on the holidays in the week by combining the number of the weekday tourists and the number of the people playing on the holidays in the place.
Further, the acquiring the number of people travelling at the same period comprises the following steps: obtaining the historical data of the number of tourists in the current year of the scenic spot, analyzing the historical data of the number of tourists in the current year to obtain an under-line regression equation of time and the number of tourists, and obtaining the number of tourists in the current year according to a minimum dichotomy.
In another aspect, the present invention further provides a computer device, which includes a processor and a memory, wherein the processor is coupled to the memory, and when in operation, the processor executes instructions to implement the method for poor tour route recommendation described above.
In another aspect, the present invention also provides a computer-readable storage medium, on which a computer program is stored, the computer program being executed by a processor to implement the method for recommending a poor trip route.
The invention carries out condition constraint through searching conditions such as planned travel time, accommodation preference, traffic preference, destination type and the like set by the user, and comprehensively calculates the poor-swimming recommended route meeting the conditions by combining with the lowest accommodation consumption, thereby being beneficial to helping the modern young people to make the poor-swimming plan.
Drawings
FIG. 1 is a schematic flow chart diagram of a first embodiment of a method for recommending a poor tour route provided by the present invention;
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be obtained by a person skilled in the art without inventive work based on the embodiments of the present invention, are within the scope of the present invention.
In order to make the objects, technical solutions and advantageous technical effects of the present invention more clearly and completely apparent, the technical solutions in the embodiments of the present invention will be described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It will be understood that the terms "comprises" and/or "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
Referring to fig. 1, fig. 1 is a flowchart illustrating a first embodiment of a method for recommending a poor tour route according to the present invention. As shown in fig. 1, the method for recommending a poor tour route of the present embodiment at least includes the following steps:
s1, receiving a poor trip route recommendation request sent by a user, wherein the recommendation request comprises travel time, travel traffic types, accommodation types and destination areas;
specifically, the user inputs a poor tour route recommendation request through a mobile phone, the poor tour route recommendation request is sent to a background server, the background server receives the recommendation request,
wherein the travel time comprises the total length of travel planned and expected to travel within a certain time range;
the travel traffic type comprises remote traffic preference, and a travel mode meeting traffic conditions, such as an airplane, a train or an automobile, is preferentially selected for a user;
the accommodation type comprises setting accommodation preference, and preferentially selecting accommodation environment meeting accommodation conditions for a user, such as a hotel or a hostess;
the destination area comprises a travel destination or a destination type with accurate travel, if the accurate destination is set, a recommended route is carried out for the destination for the user, if the accurate destination is set as the destination type, all destinations meeting the destination type are searched according to the set area range and the scenery characteristic, for example, countries, provinces, cities, counties and the like are selected.
S2, screening out the sight spot arrays meeting the conditions according to the recommendation request;
specifically, the background server matches a destination group S which meets the condition { S ═ S ] according to the received travel destination condition set by the user1,S2,……Si}
Collecting the average tourism residence time t of each destination according to the serveri1；
Calculating whether a satisfiable traffic mode exists or not according to the traffic preference; if yes, calculating the long-distance traffic passing time t required by the plane, the train or other traffic in the time rangei2；
According to the average travel detention time and the long-distance traffic passing time of the destination, screening and removing the purpose that the total time length of the sum of the average travel detention time and the long-distance traffic passing time is greater than the set planned travel total time lengthThe ground of (2); i.e. selecting the corresponding satisfying t in the array S0≥ti1+ti2。
S3, establishing a scenic spot predicted people number calculation model;
specifically, the calculation model of the estimated number of people in the scenic spot is Xp＝ax1+bx2+cx3+dx4Wherein X ispTo the expected number of people, x1、x2、x3、x4The number of stations of the scenic spot, the number of reserved rooms of the peripheral hotel, the number of persons playing on holidays in the week festival and the number of persons traveling at the same period are respectively shown as a, b, c and d, and weight coefficients of the number of stations of the scenic spot, the number of reserved rooms of the peripheral hotel, the number of persons playing on holidays in the week festival and the number of persons traveling at the same period are respectively shown as a weight coefficient.
Further, comprising: and calculating the weight coefficients of the number of stations of the scenic spot, the number of reserved persons of the hotel rooms at the periphery, the number of persons playing on holidays and the number of persons travelling at the same period by an optimal comparison method, wherein the importance degrees are divided into five levels of 1,2,3,4 and 5, and the influence weight of each factor is calculated. Factors directly influencing the method include the selling condition of long-distance traffic tickets (such as air tickets and train tickets) currently going to the city and the reservation condition of each hotel in the city; the model indirectly influences the development condition of new scene points around the factors; the model can compare the number of tourists in the same period of the past year with the reference factors, and as shown in the following table, when two targets are compared, if the importance degree of one factor is 5, the importance degree of the other factor is 0; if the degree of importance of one factor is 3, the degree of importance of the other factor is 2.
a. b, c and d respectively represent the weight coefficients of the number of stations of the scenic spot, the number of reserved persons in the hotel rooms around the scenic spot, the number of persons playing on holidays of the week festival and the number of persons traveling at the same period.
S4, acquiring the number of stations, the number of reserved persons in the hotel rooms, the number of persons playing on holidays and the number of persons travelling at the same period in each scenic spot in the scenic spot array, and substituting the number of persons into the estimated number calculation model to obtain the estimated number of persons in the scenic spots;
and acquiring the number of the station people of each scenic spot in the scenic spot array, wherein the number of the station people of each scenic spot comprises: and acquiring the traffic ticket selling data of each scenic spot in the scenic spot array, wherein one ticket is a person.
Further as a preferred embodiment, the acquiring the number of the peripheral hotel room bookings comprises: and acquiring the booking data of the peripheral hotels, wherein 1 person is counted as each room of 1 person, 2 persons are counted as each room of two persons and a large bed room, and 3 persons are counted as each room of a family.
Further preferably, the acquiring the number of people playing on holidays comprises: and acquiring historical data of weekday tourists of the scenic spot, and calculating the number of people playing on the holidays in the week by combining the number of the weekday tourists and the number of the people playing on the holidays in the place.
Wherein obtaining weekday visitor history data for the attraction comprises: the method comprises the steps of shooting a scene image of the current time of each scenic spot through a camera arranged in each scenic spot of a scenic area to obtain the scene image, wherein the scene image can be a scene picture or a scene video. The number information of the people at the current time of each scenic spot in the scenic area can be acquired through other implementation modes, for example, in an actual application scene, the number of people entering or exiting each scenic spot can be detected by respectively arranging infrared sensors at the inlet and the outlet of each scenic spot, so that the number information of the people at the current time of each scenic spot can be acquired, for example, in another actual application scene, a ticket checker can be arranged at the inlet and the outlet of each scenic spot, when a tourist enters or exits each scenic spot, the tourist needs to be checked through the ticket checker, and the number of the people entering or exiting each scenic spot detected by the ticket checker can be acquired. And then recorded on the background server.
Further as a preferred embodiment, the obtaining the number of people traveling in the same period comprises: obtaining the historical data of the number of tourists in the current year of the scenic spot, analyzing the historical data of the number of tourists in the current year to obtain an under-line regression equation of time and the number of tourists, and obtaining the number of tourists in the current year according to a minimum dichotomy.
The selling condition of the long-distance traffic ticket currently going to the city is calculated according to the ticket by one person, so that the selling condition is known to be ended according to the number of the tickets of the station at the total selling terminalPoint is x1A human;
according to the preset conditions of all hotels in the city, x is counted as 1 person/room in a single room, and 2 persons/room in a double room and a large bed room2People, family room count 3 people/room, can calculate the total number of booked people as x2A human;
according to the development condition of the new scene points around, the number of tourists in the weekdays is combined with the number of tourists in the land on the weekdays, and the total x of the tourists in the holidays is calculated according to the number ratio of the tourists in the holidays to the tourists in the land on the weekdays3A human; according to the change of the number of tourists in the same period of the previous year, according to a regression equation X which is aT + b and a minimum dichotomy, combining historical data { (X)1,T1),(X2,T2),……(Xn,Tn) The expected number of tourists in holidays of the current year can be calculated to be x4A human; and performing weighted calculation on all factors according to the weighted average to obtain the predicted number of people as follows:
Xp＝0.3x1+0.37x2+0.2x3+0.13x4
s4, acquiring the number of stations, the number of reserved persons in the hotel rooms, the number of persons playing on holidays and the number of persons travelling at the same period in each scenic spot in the scenic spot array, and substituting the number of persons into the estimated number calculation model to obtain the estimated number of persons in the scenic spots;
s5, exhaustively arranging all the routes of each scenic spot, calculating the playing time of each route, obtaining the route with the shortest playing time, taking the route with the shortest playing time as a poor-tour route, and recommending the poor-tour route to a user.
Specifically, the scenic spots selected by the tourists are arranged, all the combination modes of the scenic spots are exhausted, and if the selected scenic spot is n, the combination possibility is n! The calculation formula of the playing time of each route is as follows:
n denotes the number of said sights, dis [ P [)l(i),Pd(i)]The distance between any two of the attractions, W, is expressed as the user's walking speed.
Further, comprising: the method comprises the steps of obtaining a plurality of tourist walking images of a scenic spot, calculating walking speeds of the plurality of tourists by carrying out image recognition on the walking images, and taking the average value of the walking speeds of the plurality of tourists as the user walking speed.
Further as a preferred embodiment, a camera arranged in a scenic spot can be used for shooting road condition images from the current position of the tourist to the recommended scenic spot, and people stream information in the road condition images is identified through an image identification technology, so that the road condition information is obtained. And adjusting the walking speed of the user according to the road condition information.
Further as a preferred embodiment, the recommending the poor tour route to the user includes:
and calculating the total expense of the route with the shortest play time, wherein the total expense comprises long-distance traffic expense, accommodation expense, airport/railway station to hotel urban traffic expense, hotel to scenic spot traffic expense and scenic spot traffic expense.
Calculating the long-distance traffic fee (airplane or train) M according to the preference of the user1；
Searching for all lodging hotels meeting the preference of lodging, arranging according to low price, and setting the minimum price of the hotel as M2Then, set the selection interval as [ M ]2,M2+M3+M4]N hotels;
calculating the expenses from all destinations meeting the conditions from the airports or railway stations to the lodging hotels; if the airport is the airport, the public transportation cost from the airport to the hotel is estimated, if the railway station is the railway station, the public transportation cost from the railway station to the hotel is estimated, and the cost is M3(ii) a Calculating public transportation fees M from their accommodations to destination scenic spots4(ii) a Calculating the public transportation cost M of each scene interval5(ii) a According to M2、M3、M4The relation between the two groups can be obtained according to different hotels x, and the array Mx { (M)12,M13,M14),(M22,M23,M24),……,(Mx2,Mx3,Mx4)∈[1,n]After calculating all the destinations meeting the conditions, the remote traffic fee, lodging fee and airport of each destination are calculatedThe total of the urban traffic fees from railway station to hotel, the scenic spot traffic fees from hotel, and the scenic spot traffic fees are confirmed, and the total fee F (x) for each destination and each hotel is confirmed1+Mx+M5(ii) a And recommending the first three schemes with the lowest cost in all destinations to the user for selection.
And generating a route walking track on the electronic map, temporarily displaying the nearest hotel position and the total expense on the electronic map through a user mobile phone terminal or screen projection.
The invention carries out condition constraint through searching conditions such as planned travel time, accommodation preference, traffic preference, destination type and the like set by the user, and comprehensively calculates the poor-swimming recommended route meeting the conditions by combining with the lowest accommodation consumption, thereby being beneficial to helping the modern young people to make the poor-swimming plan.
A poor trip route recommending device according to a first embodiment of the present invention. The poor trip route recommending device comprises a controller and a processor which are connected with each other. Wherein a Memory is disposed within the controller, wherein the Memory is configured to store a computer program, and the computer program includes program instructions, and the Memory may include a Random Access Memory (RAM) and may further include a non-volatile Memory (non-volatile Memory), such as at least one disk Memory. The processor is configured to call the program instructions and execute the poor tour route recommendation method described in step S1-step S5.
The storage medium may be an internal storage device of the controller. The storage medium may also be an external storage device, such as a Smart Media Card (SMC) equipped on the wireless switch, a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like. Further, the storage medium may also include both an internal storage unit and an external storage device of the wireless switch. The storage medium is used for storing the computer program and other programs and data required by the terminal. The storage medium may also be used to temporarily store data that has been output or is to be output. The computer program includes program instructions that, when executed by a processor, cause the processor to perform the method for recommending a poor tour route of steps S1-S5.
Those of ordinary skill in the art will appreciate that the elements and algorithm steps of the examples described in connection with the embodiments disclosed herein may be embodied in electronic hardware, computer software, or combinations of both, and that the components and steps of the examples have been described in a functional general in the foregoing description for the purpose of illustrating clearly the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
When implemented in software and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention essentially or partially contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
While the invention has been described with reference to specific embodiments, the invention is not limited thereto, and various equivalent modifications and substitutions can be easily made by those skilled in the art within the technical scope of the invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (10)
1. A method for recommending a poor tour route, the method comprising:
receiving a poor trip route recommendation request sent by a user, wherein the recommendation request comprises travel time, travel traffic types, accommodation types and destination areas;
screening out the sight spot arrays meeting the conditions according to the recommendation request;
establishing a calculation model of the estimated number of people in the scenic spot;
acquiring the number of stations, the number of reserved persons of hotel rooms around, the number of persons playing on holidays and the number of persons travelling at the same period in each scenic spot in the scenic spot array, and substituting the number of persons playing on holidays and the number of persons travelling at the same period into the estimated number calculation model to obtain the estimated number of persons of the scenic spots;
and exhaustively arranging all the routes of each scenic spot, calculating the playing time of each route, solving the route with the shortest playing time, taking the route with the shortest playing time as a poor-tour route, and recommending the poor-tour route to a user.
2. The method of claim 1, comprising: the calculation formula of the playing time of each route is as follows:
n denotes the number of said sights, dis [ P [)l(i),Pd(i)]The distance between any two of the attractions, W, is expressed as the user's walking speed.
3. The method of claim 2, comprising: the method comprises the steps of obtaining a plurality of tourist walking images of a scenic spot, calculating walking speeds of the plurality of tourists by carrying out image recognition on the walking images, and taking the average value of the walking speeds of the plurality of tourists as the user walking speed.
4. The method of claim 1, wherein the number of predicted scenic spots is calculated by using a model Xp＝ax1+bx2+cx3+dx4Wherein X ispTo the expected number of people, x1、x2、x3、x4The system comprises a plurality of scenic spot stations, a plurality of hotel room bookings, a plurality of holiday play persons and a plurality of tourism persons, wherein the scenic spot stations, the hotel room bookings, the holiday play persons and the tourism persons are respectively the scenic spot stations, the hotel room bookings, the holiday play persons and the tourism persons in the same period.
5. The poor tour route recommendation method of claim 4, wherein the obtaining of the number of the station people of each sight spot in the sight spot array comprises: and acquiring the traffic ticket selling data of each scenic spot in the scenic spot array, wherein one ticket is a person.
6. The poor tour route recommendation method of claim 5, wherein the obtaining the number of the peripheral hotel room bookings comprises: and acquiring the booking data of the peripheral hotels, wherein 1 person is counted as each room of 1 person, 2 persons are counted as each room of two persons and a large bed room, and 3 persons are counted as each room of a family.
7. The method of claim 6, wherein the obtaining of the number of people playing on holidays comprises: and acquiring historical data of weekday tourists of the scenic spot, and calculating the number of people playing on the holidays in the week by combining the number of the weekday tourists and the number of the people playing on the holidays in the place.
8. The method of claim 7, wherein the obtaining the number of tourists in the same period comprises: obtaining the historical data of the number of tourists in the current year of the scenic spot, analyzing the historical data of the number of tourists in the current year to obtain an under-line regression equation of time and the number of tourists, and obtaining the number of tourists in the current year according to a minimum dichotomy.
9. A computer device comprising a processor and a memory, the processor coupled to the memory, the processor executing instructions when in operation to implement the method of any one of claims 1-8.
10. A computer-readable storage medium having a computer program stored thereon, wherein the computer program is executed by a processor to implement the method for recommending a poor trip route according to any one of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911173073.XA CN111198903A (en) | 2019-11-26 | 2019-11-26 | Poor trip route recommendation method and device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911173073.XA CN111198903A (en) | 2019-11-26 | 2019-11-26 | Poor trip route recommendation method and device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111198903A true CN111198903A (en) | 2020-05-26 |
Family
ID=70746022
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911173073.XA Pending CN111198903A (en) | 2019-11-26 | 2019-11-26 | Poor trip route recommendation method and device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111198903A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108629323A (en) * | 2018-05-11 | 2018-10-09 | 哈尔滨工业大学 | A kind of integrated providing method of scenic spot tourist chain type trip |
| CN109784536A (en) * | 2018-12-14 | 2019-05-21 | 平安科技（深圳）有限公司 | Recommended method, device, computer equipment and the storage medium of tour schedule |
| CN110110669A (en) * | 2019-05-08 | 2019-08-09 | 广东赛翼智能科技有限公司 | A kind of wisdom scenic spot tourist's localization method and system based on face recognition technology |
| CN110442785A (en) * | 2019-07-13 | 2019-11-12 | 恒大智慧科技有限公司 | A kind of recommending scenery spot method and system, computer readable storage medium |
-
2019
- 2019-11-26 CN CN201911173073.XA patent/CN111198903A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108629323A (en) * | 2018-05-11 | 2018-10-09 | 哈尔滨工业大学 | A kind of integrated providing method of scenic spot tourist chain type trip |
| CN109784536A (en) * | 2018-12-14 | 2019-05-21 | 平安科技（深圳）有限公司 | Recommended method, device, computer equipment and the storage medium of tour schedule |
| CN110110669A (en) * | 2019-05-08 | 2019-08-09 | 广东赛翼智能科技有限公司 | A kind of wisdom scenic spot tourist's localization method and system based on face recognition technology |
| CN110442785A (en) * | 2019-07-13 | 2019-11-12 | 恒大智慧科技有限公司 | A kind of recommending scenery spot method and system, computer readable storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 钟丽燕: "基于多元线性回归分析的在校大学生人数预测", 《经贸实践》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP7294501B2 (en) | Building information retrieval system | |
| JP6365602B2 (en) | Schedule management device | |
| CN111191150A (en) | Tour route recommendation method and device and storage medium | |
| US8432297B2 (en) | Parking information collection system and method | |
| CN1673686B (en) | Navigation systems | |
| JP3125669B2 (en) | Travel planning equipment | |
| US20140132767A1 (en) | Parking Information Collection System and Method | |
| CN110765361A (en) | Scenic spot recommendation method and device based on user information and storage medium | |
| CN112542043B (en) | Method and system for identifying bus net coverage blind area based on mobile phone signaling and big data analysis | |
| WO2004075137A1 (en) | Information providing device | |
| JPWO2016092920A1 (en) | Information processing apparatus, control method, and program | |
| EP2031570A1 (en) | Route search system, route search server, terminal, and route search method | |
| JP2010019641A (en) | Information providing device, method and program, and album producing device, method and program | |
| JP6190627B2 (en) | Information processing system, information processing server, information processing method, and information processing program | |
| WO2018227692A1 (en) | Amusement park management method and device | |
| CN110648027B (en) | Self-driving tour digital line interactive generation system and working method thereof | |
| CN111191149A (en) | Shortest time-based travel route recommendation method and device and storage medium | |
| CN116628335B (en) | Personalized travel route customization method and device | |
| JP6493831B2 (en) | Traffic flow control device, terminal device, traffic flow control system, traffic flow control method and program | |
| JP2003148986A (en) | Device for providing drive information | |
| JP2002350148A (en) | Navigation device and program thereof | |
| CN113159415A (en) | Intelligent tourist attraction route recommendation method based on mobile internet and big data analysis | |
| CN108766026A (en) | A kind of parking navigation method and system based on block chain technology | |
| CN111198903A (en) | Poor trip route recommendation method and device and storage medium | |
| JP2016157372A (en) | Traffic flow control apparatus, traffic flow control system, mobile recording device, traffic flow control method, and program |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20200526 |