CN111191150A - Tour route recommendation method and device and storage medium - Google Patents
Tour route recommendation method and device and storage medium Download PDFInfo
- Publication number
- CN111191150A CN111191150A CN201911219719.3A CN201911219719A CN111191150A CN 111191150 A CN111191150 A CN 111191150A CN 201911219719 A CN201911219719 A CN 201911219719A CN 111191150 A CN111191150 A CN 111191150A
- Authority
- CN
- China
- Prior art keywords
- scenic
- playing
- tourists
- time
- spot
- 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 43
- 238000004590 computer program Methods 0.000 claims description 17
- 238000004364 calculation method Methods 0.000 claims description 4
- 238000004422 calculation algorithm 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
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/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
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Tourism & Hospitality (AREA)
- Databases & Information Systems (AREA)
- Economics (AREA)
- General Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Primary Health Care (AREA)
- General Health & Medical Sciences (AREA)
- Health & Medical Sciences (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Development Economics (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a tour route recommendation method, which comprises the following steps: calculating the playing time currently required by the tourists for playing the scenic spots according to the number of queuing people at the current time of each scenic spot, the playing time of each scenic spot and the distance from each scenic spot to the tourists, and exhaustively arranging all routes from the tourists to each scenic spot; and calculating the playing time of each sight spot route according to the playing time length currently required by the tourists for playing each sight spot, and taking the shortest time-consuming sight spot route as a recommended route. Through the steps, the tourism efficiency can be improved, the shunting can be assisted, the queuing pressure of the scenic spots for tourism is reduced, and the aim that tourists expect to reduce the queuing time and complete the tourism is fulfilled. In addition, the invention also discloses a tour route recommendation method, a tour route recommendation device and a storage medium.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a tour route recommendation method, device and storage medium.
Background
The comprehensive amusement park is always one of popular choices for leisure, entertainment and vacation of people, and no matter which city the large-scale comprehensive amusement park is full of people when the day of holiday comes, a playing facility is often queued for waiting for a large half hour or even an hour. Therefore, the method brings inconvenience to people in playing, often consumes a lot of time in queuing, and cannot play the items which the people want to play.
At present, most of common park guides aim at the geographical position of a map and display a route. Considering single element, no matter the existing electronic map or scenic spot service, the aim that passengers hope to play as soon as possible within a limited time cannot be met.
Disclosure of Invention
The invention aims to provide a tour route recommendation method, a tour route recommendation device and a storage medium for completing tour of each sight spot in minimum time.
In order to achieve the above object, the present invention provides a tour route recommendation method, which includes the steps of:
acquiring the positions of all scenic spots and the geographic positions of tourists, and calculating the distance from each scenic spot to the tourists according to the positions of all the scenic spots and the positions of the tourists; calculating the time length required by the tourist to each scenic spot according to the distance from each scenic spot to the tourist;
acquiring the number of queuing people at the front time of each scenic spot, and calculating the current queuing time required for the tourists to play each scenic spot according to the number of queuing people at the current time of each scenic spot;
acquiring the playing time of each scenic spot;
calculating the playing time length currently required by the tourists for playing the scenic spots according to the number of queuing people at the current time of each scenic spot, the playing time length of each scenic spot and the distance between each scenic spot and the tourists,
exhaustively arranging all routes of the tourists to the scenic spots;
and calculating the playing time of each sight spot route according to the playing time length currently required by the tourists for playing each sight spot, and taking the shortest time-consuming sight spot route as a recommended route.
Further, the calculating the playing time length currently required for the guest to play the scenic spots according to the number of queuing people at the current time of each scenic spot, the playing time length of each scenic spot and the distance from each scenic spot to the guest comprises:
obtaining the times of the tourists playing the scenic spots similar to the scenic spots, calculating the probability of the tourists playing the scenic spots again according to the times of the tourists playing the scenic spots similar to the scenic spots,
and calculating the playing time length currently required by the tourist for playing the scenic spots according to the probability of the tourist playing the scenic spots again, the number of queuing people at the current time of the scenic spots, the playing time length of the scenic spots and the distance from the scenic spots to the tourist.
Further, the calculating the playing time length currently required for the guest to play the scenic spots according to the number of queuing people at the current time of each scenic spot, the playing time length of each scenic spot and the distance from each scenic spot to the guest comprises:
acquiring the age of the tourist, and calculating the probability of the tourist playing each scenic spot according to the age of the tourist;
and calculating the playing time length currently required by the tourist for playing the scenic spots according to the probability of the tourist for playing the scenic spots, the number of queuing people at the current time of the scenic spots, the playing time length of the scenic spots and the distance from the scenic spots to the tourist.
Further, the method comprises the following steps: the formula for calculating the queuing time currently required by each scenic spot is as follows:
Na(S, i) representing the probability of whether the tourist playing the scenic spot plays again or not, wherein S is the scenic spot, and i is the played times;
Nb(S, Age) represents the probability of whether the tourists in a certain Age group play, wherein S is the scenic spot, and Age is the Age group of the tourists;
m (S) represents the maximum number of persons allowed by one amusement time of the attraction;
t (S) the time length required by the attraction for one-time amusement;
and P (t) represents the total number of people in the park at the time t obtained by historical curve regression.
Further, the calculation formula for calculating the playing time of each sight spot route is as follows:
Further, the calculating the time length required by the tourist to the each scenic spot according to the distance from the each scenic spot to the tourist comprises:
and calculating the time required by walking among the scenic spots according to the positions of the scenic spots, the road conditions of the position routes of the tourists and the walking speed of the tourists.
Further, the obtaining of the number of queuing people at the current time of each position of the scenic spot in the scenic spot comprises:
acquiring a scene image of the current time of each sight spot;
and identifying the current number of people of each scenic spot according to the scene image.
Further, the calculating the currently required queuing time of each scenic spot according to the number of queuing people of the current time of each scenic spot comprises:
obtaining historical play data of the tourists of each attraction,
and calculating the currently required queuing time of each scenic spot according to the historical play data of the tourists of each scenic spot and the current number of the tourists of each scenic spot.
Further, the obtaining of the historical play data of the tourists of each scenic spot, and the calculating of the currently required queuing time of each scenic spot according to the historical play data of the tourists of each scenic spot and the current number of people of each scenic spot comprises:
acquiring historical play data of each scenic spot according with current weather and holidays;
and calculating the currently required queuing time of each scenic spot according to the historical play data of each scenic spot, which accords with the current weather and holidays, and the current number of people of each scenic spot.
In another aspect, the present invention further relates to a tour route recommendation apparatus, which includes a processor and a memory connected to each other, wherein the memory is used for storing a computer program, the computer program includes program instructions, and the processor is configured to call the program instructions to execute the tour route recommendation method.
In another aspect, the present invention also relates to a storage medium storing a computer program comprising program instructions which, when executed by a processor, cause the processor to perform the tour route recommendation method described above.
Through the steps, the tourism efficiency can be improved, the shunting can be assisted, the queuing pressure of the scenic spots for tourism is reduced, and the aim that tourists expect to reduce the queuing time and complete the tourism is fulfilled.
Drawings
Fig. 1 is a schematic flow chart of a first embodiment of a tour route recommendation method provided by the present invention;
FIG. 2 is a flow chart of a second embodiment of a tour route recommendation method provided by the present invention;
fig. 3 is a flowchart illustrating a third embodiment of a tour route recommendation method according to 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 tour route recommendation method according to a first embodiment of the present invention. As shown in fig. 1, the tour route recommendation method according to the present embodiment at least includes the following steps:
s1, acquiring the positions of the scenic spots and the geographic positions of the tourist, and calculating the distance between each scenic spot and the tourist according to the positions of the scenic spots and the position of the tourist; calculating the time length required by the tourist to each scenic spot according to the distance from each scenic spot to the tourist;
specifically, the time required for walking between the scenic spots is calculated according to the positions of the scenic spots, the road conditions of the position route of the tourist and the walking speed of the tourist.
Furthermore, the camera arranged in the scenic spot can be used for shooting the road condition image from the current position of the tourist to the recommended scenic spot, and the pedestrian flow information in the road condition image is identified through the image identification technology, so that the road condition information is obtained.
S2, obtaining the number of queuing people at the time before each scenic spot, and calculating the current queuing time required for the tourists to play each scenic spot according to the number of queuing people at the current time of each scenic spot;
further, the obtaining of the number of queuing people at the current time of each position of the scenic spot in the scenic spot comprises:
s21, obtaining the scene image of each sight spot at the current time;
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 S22, identifying the current number of people of each sight spot according to the scene image.
S3, obtaining the playing time length of each scenic spot;
and searching the historical database for the playing time of a plurality of tourists in each scenic spot, and rounding.
And S4, calculating the playing time length required by the tourist to play the scenic spots according to the number of queuing people at the current time of each scenic spot, the playing time length of each scenic spot and the distance between each scenic spot and the tourist.
S5, exhaustively arranging all routes of the tourists to the scenic spots;
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! And then calculating according to the waiting time of the scenic spots corresponding to the sequence.
And S6, calculating the playing time of each sight spot route according to the playing time length currently required by the tourists for playing each sight spot, and taking the shortest time-consuming sight spot route as a recommended route.
Referring to fig. 2, fig. 2 is a flowchart illustrating a tour route recommendation method according to a second embodiment of the present invention. As shown in fig. 2, the tour route recommendation method according to the present embodiment at least includes the following steps:
s1, acquiring the positions of the scenic spots and the geographic positions of the tourist, and calculating the distance between each scenic spot and the tourist according to the positions of the scenic spots and the position of the tourist; calculating the time length required by the tourist to each scenic spot according to the distance from each scenic spot to the tourist;
specifically, the time required for walking between the scenic spots is calculated according to the positions of the scenic spots, the road conditions of the position route of the tourist and the walking speed of the tourist.
Furthermore, the camera arranged in the scenic spot can be used for shooting the road condition image from the current position of the tourist to the recommended scenic spot, and the pedestrian flow information in the road condition image is identified through the image identification technology, so that the road condition information is obtained.
S2, obtaining the number of queuing people at the time before each scenic spot, and calculating the current queuing time required for the tourists to play each scenic spot according to the number of queuing people at the current time of each scenic spot;
further, the obtaining of the number of queuing people at the current time of each position of the scenic spot in the scenic spot comprises:
s21, obtaining the scene image of each sight spot at the current time;
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 S22, identifying the current number of people of each sight spot according to the scene image.
S3, obtaining the playing time length of each scenic spot;
and searching the historical database for the playing time of a plurality of tourists in each scenic spot, and rounding.
S4, obtaining the times of the tourists playing the scenic spots similar to the scenic spots, calculating the probability of the tourists playing the scenic spots again according to the times of the tourists playing the scenic spots similar to the scenic spots,
s5, obtaining the age of the tourist, calculating the probability of the tourist playing each scenic spot according to the age of the tourist,
specifically, the age of the guest and the attributes of whether the guest has played are analyzed, and the probability N of whether the guest who has played the scenic spot plays again is calculateda(S, i), and a probability N representing whether a guest of a certain age group playsb(S,Age)。
S6, calculating the playing time length required by the visitor to play the scenic spots at present according to the probability of playing the scenic spots again, the probability of playing the scenic spots, the number of queuing people at the current time of the scenic spots, the playing time length of the scenic spots and the distance between the scenic spots and the visitor.
S7, exhaustively arranging all routes of the tourists to the scenic spots;
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! And then calculating according to the waiting time of the scenic spots corresponding to the sequence.
Specifically, the method comprises the following steps: the formula for calculating the queuing time currently required by each scenic spot is as follows:
Na(S, i) representing the probability of whether the tourist playing the scenic spot plays again or not, wherein S is the scenic spot, and i is the played times;
Nb(S, Age) represents the probability of whether the tourists in a certain Age group play, wherein S is the scenic spot, and Age is the Age group of the tourists;
m (S) represents the maximum number of persons allowed by one amusement time of the attraction;
t (S) the time length required by the attraction for one-time amusement;
and P (t) represents the total number of people in the park at the time t obtained by historical curve regression.
And S8, calculating the playing time of each sight spot route according to the playing time length currently required by the tourists for playing each sight spot, and taking the shortest time-consuming sight spot route as a recommended route.
Specifically, the calculation formula for calculating the playing time of each sight spot route is as follows:
Referring to fig. 3, fig. 3 is a flowchart illustrating a tour route recommendation method according to a first embodiment of the present invention. As shown in fig. 3, the tour route recommendation method according to the present embodiment at least includes the following steps:
s1, acquiring the positions of the scenic spots and the geographic positions of the tourist, and calculating the distance between each scenic spot and the tourist according to the positions of the scenic spots and the position of the tourist; calculating the time length required by the tourist to each scenic spot according to the distance from each scenic spot to the tourist;
specifically, the time required for walking between the scenic spots is calculated according to the positions of the scenic spots, the road conditions of the position route of the tourist and the walking speed of the tourist.
Furthermore, the camera arranged in the scenic spot can be used for shooting the road condition image from the current position of the tourist to the recommended scenic spot, and the pedestrian flow information in the road condition image is identified through the image identification technology, so that the road condition information is obtained.
S2, obtaining the historical play data of each sight spot tourist, calculating the queuing time length required by each sight spot according to the historical play data of each sight spot tourist and the current number of the sightseeing spot tourist,
the method comprises the following steps of obtaining historical playing big data of a search scenic spot, wherein when the search condition comprises weather, the search of historical scenic spot data which accord with the condition comprises: retrieving historical data corresponding to similar seasons, temperatures and weather conditions; specifically, historical playing data of each scenic spot according with current weather and holidays is obtained; and calculating the currently required queuing time of each scenic spot according to the historical play data of each scenic spot, which accords with the current weather and holidays, and the current number of people of each scenic spot. Specifically, the retrieving condition includes that, when the day is holiday, the historical scenic spot data meeting the condition is retrieved, and the retrieving condition includes: historical data for the same holidays is retrieved.
S3, obtaining the playing time length of each scenic spot;
and searching the historical database for the playing time of a plurality of tourists in each scenic spot, and rounding.
S4, obtaining the times of the tourists playing the scenic spots similar to the scenic spots, calculating the probability of the tourists playing the scenic spots again according to the times of the tourists playing the scenic spots similar to the scenic spots,
s5, obtaining the age of the tourist, calculating the probability of the tourist playing each scenic spot according to the age of the tourist,
specifically, the age of the guest and the attributes of whether the guest has played are analyzed, and the probability N of whether the guest who has played the scenic spot plays again is calculateda(S, i), and a probability N representing whether a guest of a certain age group playsb(S,Age)。
S6, calculating the playing time length required by the visitor to play the scenic spots at present according to the probability of playing the scenic spots again, the probability of playing the scenic spots, the number of queuing people at the current time of the scenic spots, the playing time length of the scenic spots and the distance between the scenic spots and the visitor.
S7, exhaustively arranging all routes of the tourists to the scenic spots;
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! And then calculating according to the waiting time of the scenic spots corresponding to the sequence.
Specifically, the method comprises the following steps: the formula for calculating the queuing time currently required by each scenic spot is as follows:
Na(S, i) representing the probability of whether the tourist playing the scenic spot plays again or not, wherein S is the scenic spot, and i is the played times;
Nb(S, Age) represents the probability of whether the tourists in a certain Age group play, wherein S is the scenic spot, and Age is the Age group of the tourists;
m (S) represents the maximum number of persons allowed by one amusement time of the attraction;
t (S) the time length required by the attraction for one-time amusement;
and P (t) represents the total number of people in the park at the time t obtained by historical curve regression.
And S8, calculating the playing time of each sight spot route according to the playing time length currently required by the tourists for playing each sight spot, and taking the shortest time-consuming sight spot route as a recommended route.
Specifically, the calculation formula for calculating the playing time of each sight spot route is as follows:
A tour route recommendation apparatus according to a first embodiment of the present invention. The tour route recommendation 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 to execute the tour route recommendation method described in steps S1-S6.
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 execute the tour route recommendation method of steps S1-S6.
A tour route recommendation apparatus according to the second embodiment described above. The tour route recommendation 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 high-speed Random Access Memory (RAM) and may also include a non-volatile Memory (non-volatile Memory), such as at least one disk Memory. The processor is configured to call the program instructions to execute the tour route recommendation method described in steps S1-S8.
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 execute the tour route recommendation method of steps S1-S8.
A tour route recommendation apparatus according to the third embodiment described above. The tour route recommendation 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 high-speed Random Access Memory (RAM) and may also include a non-volatile Memory (non-volatile Memory), such as at least one disk Memory. The processor is configured to call the program instructions to execute the tour route recommendation method described in steps S1-S8.
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 execute the tour route recommendation method of steps S1-S8.
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 (11)
1. A tour route recommendation method, comprising the steps of:
acquiring the positions of all scenic spots and the geographic positions of tourists, and calculating the distance from each scenic spot to the tourists according to the positions of all the scenic spots and the positions of the tourists; calculating the time length required by the tourist to each scenic spot according to the distance from each scenic spot to the tourist;
acquiring the number of queuing people at the front time of each scenic spot, and calculating the current queuing time required for the tourists to play each scenic spot according to the number of queuing people at the current time of each scenic spot;
acquiring the playing time of each scenic spot;
calculating the playing time length currently required by the tourists for playing the scenic spots according to the number of queuing people at the current time of each scenic spot, the playing time length of each scenic spot and the distance between each scenic spot and the tourists,
exhaustively arranging all routes of the tourists to the scenic spots;
and calculating the playing time of each sight spot route according to the playing time length currently required by the tourists for playing each sight spot, and taking the shortest time-consuming sight spot route as a recommended route.
2. The tour route recommendation method according to claim 1,
calculating the playing time length currently required for the tourist to play the scenic spots according to the number of queuing people at the current time of each scenic spot, the playing time length of each scenic spot and the distance from each scenic spot to the tourist, wherein the calculating comprises the following steps:
obtaining the times of the tourists playing the scenic spots similar to the scenic spots, calculating the probability of the tourists playing the scenic spots again according to the times of the tourists playing the scenic spots similar to the scenic spots,
and calculating the playing time length currently required by the tourist for playing the scenic spots according to the probability of the tourist playing the scenic spots again, the number of queuing people at the current time of the scenic spots, the playing time length of the scenic spots and the distance from the scenic spots to the tourist.
3. The tour route recommendation method according to claim 2,
calculating the playing time length currently required for the tourist to play the scenic spots according to the number of queuing people at the current time of each scenic spot, the playing time length of each scenic spot and the distance from each scenic spot to the tourist, wherein the calculating comprises the following steps:
acquiring the age of the tourist, and calculating the probability of the tourist playing each scenic spot according to the age of the tourist;
and calculating the playing time length currently required by the tourist for playing the scenic spots according to the probability of the tourist for playing the scenic spots, the number of queuing people at the current time of the scenic spots, the playing time length of the scenic spots and the distance from the scenic spots to the tourist.
4. The tour route recommendation method according to claim 3, comprising: the formula for calculating the queuing time currently required by each scenic spot is as follows:
Na(S, i) representing the probability of whether the tourist playing the scenic spot plays again or not, wherein S is the scenic spot, and i is the played times;
Nb(S, Age) represents the probability of whether the tourists in a certain Age group play, wherein S is the scenic spot, and Age is the Age group of the tourists;
m (S) represents the maximum number of persons allowed by one amusement time of the attraction;
t (S) the time length required by the attraction for one-time amusement;
and P (t) represents the total number of people in the park at the time t obtained by historical curve regression.
5. The tour route recommendation method of claim 4, wherein the calculation formula for calculating the play time of each sight spot route is as follows:
6. The tour route recommendation method according to claims 1 to 5, wherein said calculating the time period required for the tourist to reach each attraction according to the distance of each attraction to the tourist comprises:
and calculating the time required by walking among the scenic spots according to the positions of the scenic spots, the road conditions of the position routes of the tourists and the walking speed of the tourists.
7. The tour route recommendation method of claim 6, wherein the obtaining of the number of people in line at the current time of the sight positions of the scenic spot comprises:
acquiring a scene image of the current time of each sight spot;
and identifying the current number of people of each scenic spot according to the scene image.
8. The tour route recommendation method of claim 7, wherein the calculating the currently required queuing time of each sight spot according to the number of people in queue at the current time of each sight spot comprises:
obtaining historical play data of the tourists of each attraction,
and calculating the currently required queuing time of each scenic spot according to the historical play data of the tourists of each scenic spot and the current number of the tourists of each scenic spot.
9. The tour route recommendation method of claim 8, wherein the obtaining of the historical play data of the tourists of each attraction and the calculating of the currently required queuing time of each attraction according to the historical play data of the tourists of each attraction and the current number of people of each attraction comprise:
acquiring historical play data of each scenic spot according with current weather and holidays;
and calculating the currently required queuing time of each scenic spot according to the historical play data of each scenic spot, which accords with the current weather and holidays, and the current number of people of each scenic spot.
10. A tour route recommendation device comprising a processor and a memory interconnected, wherein the memory is configured to store a computer program comprising program instructions, and wherein the processor is configured to invoke the program instructions to perform the tour route recommendation method according to any one of claims 1 to 9.
11. A storage medium characterized in that the storage medium stores a computer program comprising program instructions that, when executed by a processor, cause the processor to perform the tour route recommendation method according to any one of claims 1 to 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911219719.3A CN111191150A (en) | 2019-12-03 | 2019-12-03 | Tour route recommendation method and device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911219719.3A CN111191150A (en) | 2019-12-03 | 2019-12-03 | Tour route recommendation method and device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111191150A true CN111191150A (en) | 2020-05-22 |
Family
ID=70707252
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911219719.3A Pending CN111191150A (en) | 2019-12-03 | 2019-12-03 | Tour route recommendation method and device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111191150A (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111721295A (en) * | 2020-05-23 | 2020-09-29 | 芜湖扬宇机电技术开发有限公司 | Planning method and system for sightseeing route of scenic spot in zoo |
| CN111888774A (en) * | 2020-07-03 | 2020-11-06 | 深圳怡丰自动化科技有限公司 | Cabin control method and device and storage medium |
| CN111914183A (en) * | 2020-09-29 | 2020-11-10 | 江西省气象信息中心(江西省气象培训中心、江西省农村经济信息中心) | Travel plan recommendation method and device, readable storage medium and computer equipment |
| CN111967664A (en) * | 2020-08-14 | 2020-11-20 | 中国工商银行股份有限公司 | Tour route planning method, device and equipment |
| CN112070251A (en) * | 2020-08-24 | 2020-12-11 | 马上游科技股份有限公司 | Method and system for realizing reservation and route planning of scenic spot project |
| CN112132709A (en) * | 2020-09-24 | 2020-12-25 | 苏州七采蜂数据应用有限公司 | Method and system for improving playing efficiency of playground facility |
| CN112148978A (en) * | 2020-09-24 | 2020-12-29 | 苏州七采蜂数据应用有限公司 | Internet-based amusement park project recommendation method and system |
| CN112419567A (en) * | 2020-11-09 | 2021-02-26 | 成都中科大旗软件股份有限公司 | Comprehensive management system based on text and travel fusion |
| CN113159367A (en) * | 2021-01-04 | 2021-07-23 | 重庆周游科技有限公司 | Tour route planning method and device |
| CN113837456A (en) * | 2021-09-13 | 2021-12-24 | 珠海格力电器股份有限公司 | Route recommendation method, device, equipment, storage medium and processor |
| CN114742579A (en) * | 2022-03-25 | 2022-07-12 | 广西师范大学 | Tourism plus industry integration technology platform system |
| CN114997736A (en) * | 2022-07-13 | 2022-09-02 | 北京拙河科技有限公司 | Scenic spot passenger flow volume control method and system |
| CN114997531A (en) * | 2022-07-20 | 2022-09-02 | 枣庄山好科技有限公司 | Real-time transport capacity intelligent recommendation method and system |
Citations (3)
| 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 |
| CN109948843A (en) * | 2019-03-12 | 2019-06-28 | 黑龙江世纪精彩科技有限公司 | A kind of system and method for project number of playing in dynamic prediction tourism garden |
| CN110427571A (en) * | 2019-07-13 | 2019-11-08 | 恒大智慧科技有限公司 | A kind of recommending scenery spot method, computer equipment and readable storage medium storing program for executing |
-
2019
- 2019-12-03 CN CN201911219719.3A patent/CN111191150A/en active Pending
Patent Citations (3)
| 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 |
| CN109948843A (en) * | 2019-03-12 | 2019-06-28 | 黑龙江世纪精彩科技有限公司 | A kind of system and method for project number of playing in dynamic prediction tourism garden |
| CN110427571A (en) * | 2019-07-13 | 2019-11-08 | 恒大智慧科技有限公司 | A kind of recommending scenery spot method, computer equipment and readable storage medium storing program for executing |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111721295A (en) * | 2020-05-23 | 2020-09-29 | 芜湖扬宇机电技术开发有限公司 | Planning method and system for sightseeing route of scenic spot in zoo |
| CN111888774A (en) * | 2020-07-03 | 2020-11-06 | 深圳怡丰自动化科技有限公司 | Cabin control method and device and storage medium |
| CN111888774B (en) * | 2020-07-03 | 2021-11-30 | 深圳怡丰自动化科技有限公司 | Cabin control method and device and storage medium |
| CN111967664A (en) * | 2020-08-14 | 2020-11-20 | 中国工商银行股份有限公司 | Tour route planning method, device and equipment |
| CN112070251A (en) * | 2020-08-24 | 2020-12-11 | 马上游科技股份有限公司 | Method and system for realizing reservation and route planning of scenic spot project |
| CN112132709A (en) * | 2020-09-24 | 2020-12-25 | 苏州七采蜂数据应用有限公司 | Method and system for improving playing efficiency of playground facility |
| CN112148978A (en) * | 2020-09-24 | 2020-12-29 | 苏州七采蜂数据应用有限公司 | Internet-based amusement park project recommendation method and system |
| CN111914183A (en) * | 2020-09-29 | 2020-11-10 | 江西省气象信息中心(江西省气象培训中心、江西省农村经济信息中心) | Travel plan recommendation method and device, readable storage medium and computer equipment |
| CN112419567A (en) * | 2020-11-09 | 2021-02-26 | 成都中科大旗软件股份有限公司 | Comprehensive management system based on text and travel fusion |
| CN113159367A (en) * | 2021-01-04 | 2021-07-23 | 重庆周游科技有限公司 | Tour route planning method and device |
| CN113837456A (en) * | 2021-09-13 | 2021-12-24 | 珠海格力电器股份有限公司 | Route recommendation method, device, equipment, storage medium and processor |
| CN114742579A (en) * | 2022-03-25 | 2022-07-12 | 广西师范大学 | Tourism plus industry integration technology platform system |
| CN114997736A (en) * | 2022-07-13 | 2022-09-02 | 北京拙河科技有限公司 | Scenic spot passenger flow volume control method and system |
| CN114997531A (en) * | 2022-07-20 | 2022-09-02 | 枣庄山好科技有限公司 | Real-time transport capacity intelligent recommendation method and system |
| CN114997531B (en) * | 2022-07-20 | 2022-10-25 | 枣庄山好科技有限公司 | Real-time transportation capacity intelligent recommendation method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111191150A (en) | Tour route recommendation method and device and storage medium | |
| CN111143680B (en) | Route recommendation method, system, electronic equipment and computer storage medium | |
| CN110765361A (en) | Scenic spot recommendation method and device based on user information and storage medium | |
| JP6365602B2 (en) | Schedule management device | |
| CN111191149A (en) | Shortest time-based travel route recommendation method and device and storage medium | |
| US20060241862A1 (en) | Navigation device, navigation method, route data generation program, recording medium containing route data generation program, and server device in navigation system | |
| US20240280367A1 (en) | Systems and methods for generating scenic routes | |
| CN104850563B (en) | Destination image compare retrieval device, destination image compares searching system and destination image compares search method | |
| JP2010019641A (en) | Information providing device, method and program, and album producing device, method and program | |
| CN104794171B (en) | Mark the method and device of picture geographical location information | |
| CN111177572A (en) | Personalized tour route recommendation method based on dynamic interest of user | |
| CN111326147B (en) | Speech recognition method, device, electronic equipment and storage medium | |
| JP2008033399A (en) | Information providing system | |
| CN110119822A (en) | Scenic spot management, stroke planning method, client and server | |
| JP4913232B2 (en) | Image selection apparatus and image selection method | |
| JP7139904B2 (en) | Information processing device and information processing program | |
| CN116628335B (en) | Personalized travel route customization method and device | |
| US9870595B2 (en) | Method for proposing landmark | |
| JP2017157036A (en) | Parking guidance system and parking guidance method | |
| JP7426176B2 (en) | Information processing system, information processing method, information processing program, and server | |
| CN110750737A (en) | Scenic spot recommendation method and device and storage medium | |
| CN111694906A (en) | Method, device and equipment for displaying POI in map | |
| CN110832476A (en) | System and method for providing information for on-demand services | |
| CN110955844A (en) | Method and system for guiding tourists in amusement park | |
| CN106323306B (en) | Navigation information processing method and electronic equipment |
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 |
Application publication date: 20200522 |
|
| WD01 | Invention patent application deemed withdrawn after publication |