CN113837416A - Time-sharing reservation method and system for maintaining maximum garden entry rate by time-span period fusion - Google Patents
Time-sharing reservation method and system for maintaining maximum garden entry rate by time-span period fusion Download PDFInfo
- Publication number
- CN113837416A CN113837416A CN202111390024.9A CN202111390024A CN113837416A CN 113837416 A CN113837416 A CN 113837416A CN 202111390024 A CN202111390024 A CN 202111390024A CN 113837416 A CN113837416 A CN 113837416A
- Authority
- CN
- China
- Prior art keywords
- reservation
- time
- user
- users
- time period
- 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
Images
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/02—Reservations, e.g. for tickets, services or events
-
- 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/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2462—Approximate or statistical 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- 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—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/14—Travel agencies
Abstract
The invention relates to the field of data processing, in particular to a time-sharing reservation method and a time-sharing reservation system for maintaining the maximum garden entry rate by time-span fusion. The method and system perform the steps of: issuing time-sharing reservation information, acquiring reservation information of a user, establishing communication with the user to acquire a user state, marking a state of arrival of reservation of the user according to the user state to an adjacent time period, counting the number of reservations with the state of arrival being not in place, sending secondary reservation information to the arrived user in the next reservation period according to the number, modifying the corresponding reservation period of the arrived user according to secondary reservation feedback data, and leading the part of the next reservation period to be the user to check tickets and enter the park in advance; and sending the booking reservation information to the arrived users of the reservation time period corresponding to the time of arrival at the garden, and modifying the corresponding reservation time period of the arrived users according to the booking reservation feedback information. The invention distributes the limited number to the actual people to keep the upper limit of the effective number of people and improves the efficiency of entering and leaving the garden.
Description
Technical Field
The invention relates to the field of data processing, in particular to a time-sharing reservation method and a time-sharing reservation system for maintaining the maximum garden entry rate by time-span fusion.
Background
The time-sharing reservation is an on-line reservation method in time-sharing periods, the reservation information is distributed according to the different time periods and the set corresponding reserved quantity, the method is widely applied to scenes such as hospital registration, scenic spots, venue tickets and the like, and the quantity of services available in one time period is used as reservation stock for users to perform reservation on line, so that the purposes of dispersing the flow aggregation degree and providing good service experience are achieved.
The main action scene of the time-sharing reservation is that under the condition that the reserved people number exceeds the service capability, the scenic spot is taken as an example, when the number of visitors is less than the maximum accommodation number of the scenic spot, the visitors can follow the scenic spot, only when the number of visitors is more than the maximum capacity of the scenic spot, the number of people entering the garden in a certain or some time periods needs to be controlled by the reservation control in different time periods, which is different from the fast circulating work scenes of hospitals and the like, when people travel in the scenic spot, the stay time of the people in the scenic spot is longer, tourists in different time periods easily form cross accumulation on the garden, the instantaneous overload of the number of the tourists is caused, in order to solve the problem, statistics of the number of people in the garden is introduced into some conventional scenic spots and is used as a basis for entering the garden and letting the people in the garden be limited below a rated number of people, but the number of people outside the garden is obviously increased, and the waiting time is uncontrollable.
The application document with the application number of 201910943030.9 and named as 'time-sharing reservation scheduling method, device, equipment and medium' provides a technical scheme for calculating the receptivity according to time-sharing reservation data, generating a scenic spot scheduling scheme and allocating transportation means, personnel and offline ticket selling. The method achieves the main aim of reasonably distributing the number of the tourists in the garden by adjusting and controlling the throughput of the scenic spot, rapidly circulating the number of the tourists in the garden and releasing the volume in the garden to digest reserved tourists, and still cannot achieve the main aim of reasonably distributing the number of the tourists in the garden through time-sharing reservation. And the tourists are transported through the scenic spot quickly by the vehicle, and the touring time of the tourists in the scenic spot is shortened by closing certain scenic spots or facilities, so that the touring experience of the tourists is remarkably reduced.
Disclosure of Invention
In a first aspect, the invention provides a time-sharing reservation method and a time-sharing reservation system, which can keep the normal visiting duration of tourists, keep the maximum park rate, and realize the cross-time fusion of a large number of tourists.
The method comprises the following steps:
s1, calculating the conventional tour time of the scenic spot, setting a high flow threshold, and issuing time-sharing reservation information, wherein the time-sharing reservation information comprises reservation time periods and reservation upper limit values, the interval of the calculation time of the adjacent reservation time periods is equal to the conventional tour time plus the adjustment time, the reservation time periods take the time required by the number of visitors entering the park in the reservation upper limit number of the scenic spot as a period, and the adjustment time is the time required by the number of visitors in the scenic spot to fall from the upper limit to the high flow threshold;
s2, acquiring reservation information of the user, and counting the reserved ticket number of each time-sharing reservation time period at the reservation deadline; if the number of the reserved tickets reaches the high flow threshold, the following steps S3-S5 or S3-S5' are carried out, and if the number of the reserved tickets does not reach the high flow threshold, the tickets are normally checked according to the time-sharing reservation and enter the park;
s3, when verification of park entering is opened, communication is established with a user to obtain a user state, and a park entering state mark is carried out on a reserved user in the current reserved time period according to the user state, wherein the park entering state mark comprises a arrived state, a late state and a late state;
s4, counting the number of users with the garden status marked as unavailable, sending secondary reservation information to the arrived users in the next reservation time period according to the number of the unavailable users, acquiring secondary reservation feedback data of the arrived users in the next reservation time period, and modifying the corresponding reservation time period of the arrived users according to the secondary reservation feedback data to enable the part of the next reservation time period to be entered into the garden through ticket checking in advance by the users;
s5, acquiring the real-time position of the late arrival user at the current booking time period, loading a map module to estimate the actual arrival time of the late arrival user, sending booking information to the arrived user at the booking time period corresponding to the actual arrival time, acquiring booking reservation feedback information of the arrived user at the corresponding booking time period, modifying the corresponding booking time period of the arrived user according to the booking reservation feedback information, and leading the part of the booking time period corresponding to the actual arrival time period to be the user to check tickets and enter the park in advance; or the like, or, alternatively,
s5', obtaining the number of late users in the current appointment time period, directly issuing the corresponding amount of appointment information to the late users in the next time period, obtaining the appointment feedback information of the late users in the next time period, modifying the corresponding appointment time period of the late users according to the appointment feedback information, and so on, so that the part of the next appointment time period reaches the user to check tickets and enter the park in advance.
Since the rule of setting the reservation time period in step S1 greatly reduces the time limit for guests to enter the park, there is a high possibility that guests who have reserved a certain time period cannot arrive within the specified time period, wherein if the late user passes, the guests who will arrive until the next reservation time period will not complete the play, which affects the entering of the next reservation time period and causes queuing. Also, some users have reserved a certain time period earlier and cannot be present on the day. Both of these visitors occupy the reserved supply amount of the scenic spot, but cannot arrive at the garden on time, and the reservation index is wasted, so that additional processing is required, the scenic spot can keep the maximum garden entry rate in a single reservation time period, and the most amount of visitors is consumed.
In one possible implementation, the reservation cutoff time in step S2 is when the number of reserved persons of the corresponding reservation period reaches the upper limit value or the end time of the reservation period reaches.
In one possible implementation manner, the establishing communication with the user in step S3 to obtain the user status, and the making a home status flag for the subscribed user in the current subscription period according to the user status further includes the steps of:
s31, establishing communication with a user;
s32, sending the garden state confirmation information to the user;
s33, receiving reply information of the user;
and S34, marking the arrival state of the user according to the reply information of the user.
In a possible implementation manner, step S3 further includes:
s35, inquiring the position information of the unanswered user;
s36, calculating the arrival time of the user according to the position information of the user;
and S37, additionally marking the arrival state of the user according to the arrival time of the user.
In one possible implementation, step S4 further includes the steps of:
s41, counting the number of the users with the garden status not marked as the number of the users and the number of the users in each reserved time period;
s42, comparing the number of users with the state of no arrival with the number of users in the next reserved time period, when the number of users with the state of no arrival is larger than the number of users in the next reserved time period, executing the step S43, and when the number of users with the state of no arrival is smaller than or equal to the number of users in the next reserved time period, executing the step S44;
s43, sending secondary reservation information to the arrived users in the next reservation period, and sending the secondary reservation information to the arrived users in the next reservation period in sequence according to the number of the remaining arrived users, so as to obtain secondary reservation feedback data of the arrived users in a plurality of reservation periods; modifying the corresponding reserved time period of the arrived user according to the secondary reservation feedback data;
s44, sending secondary reservation information to the arrived user in the next reservation period, and acquiring secondary reservation feedback data of the arrived user in the next reservation period; and allocating the reservation time period of the current late user according to the sequence of acquiring the secondary reservation feedback data.
In one possible implementation manner, in step S5, when the number of arrived users of the reservation period corresponding to the actual arrival time is less than the number of late users of the current reservation period, allocating the surplus reservation information of the late users to the arrived users of the next reservation period; and when the number of the arrived users in the reservation time period corresponding to the actual arrival time is greater than or equal to the number of the late users in the current reservation time period, allocating the reservation information of the current late users according to the sequence of acquiring the scheduling reservation feedback information.
In one possible implementation, the remaining reservation information that remains unassigned after being distributed via steps S4 and S5 is transmitted to a ticket vending machine on-site.
In a second aspect, the present invention further provides a time sharing reservation system with time-span integration to maintain a maximum garden admission rate, the system comprising:
the user communication module is used for establishing communication with the user side, issuing reservation information and receiving the reservation information of the user;
the reservation information storage module is communicated with the user communication module and used for storing the time-sharing reservation information of the user;
the user analysis module is communicated with the user communication module to acquire a user state and analyze the arrival state of the user according to the user state, wherein the arrival state mark comprises arrival, late arrival and non-arrival;
the reservation information marking module receives the arrival state of the user sent by the user analysis module and writes the arrival state into the time-sharing reservation information of the corresponding user;
the secondary reservation module reads and counts the number of the users with the unavailable status marks, sends secondary reservation information to the arrived users in the next reservation time period according to the number of the users, acquires secondary reservation feedback data of the arrived users in the next reservation time period, and modifies the corresponding reservation time period of the arrived users according to the secondary reservation feedback data;
the map module is used for acquiring the real-time position of the late user and loading the position into the map module to estimate the actual arrival time of the late user;
and the scheduling reservation module is used for sending scheduling reservation information to the arrived users in the reservation time period corresponding to the actual arrival time, acquiring scheduling reservation feedback information of the arrived users in the corresponding reservation time period, and modifying the corresponding reservation time period of the arrived users according to the scheduling reservation feedback information.
Drawings
FIG. 1 is a schematic flow chart of a first embodiment;
FIG. 2 is a detailed flowchart of step S3 of the first embodiment;
fig. 3 is a schematic block diagram of a second embodiment.
Detailed Description
Before the details of the following embodiments are explained in detail, the conventional time-sharing reservation and the disadvantage of using the reserved time-sharing reservation for the scenic region will be briefly described. In the existing time-sharing reservation, a day is divided into a plurality of continuous time periods, and tickets which can be sold are distributed in each time period for a user to select reservation. Taking a scenic spot as an example, dividing the scenic spot by taking two hours as a time period, such as 8-10 points, 10-12 points, 12-14 points and the like, and checking tickets into a garden in the selected time period after the reservation of the user. Firstly, the time-sharing reservation mode has several problems, for example, some users reserve tickets of 8-10 o 'clock, enter the park between 9-10 o' clock, then when entering the next time slot, these users occupy the capacity of the park, and when entering the next time slot, they can not normally enter the park, so when setting the amount of the reserved tickets, the park will keep a certain proportion of the vacant space, for example, throw reservation tickets of 80% of the maximum number of visitors in the scenic spot, so as to ensure that visitors in the next time slot can normally enter the park, but this throwing proportion is not well controlled, often the number of visitors entering the park in the scenic spot can not reach the maximum number of visitors, which causes resource waste and insufficient ticket supply, and at the same time, the reserved proportion is still insufficient to accommodate the visitors across time slots, still resulting in guests queuing outside the park for the next slot. Secondly, the division of the reserved time period does not take into account the requirement of the playing time length, for example, it usually takes three hours to play the whole scenic spot, but the reserved time period is divided by two hours, so that when the next time period comes, the visitors in the previous time period will all play in the scenic spot, and thus the visitors in the next time period cannot enter the park, and a long queue occurs, so that the technical scheme mentioned in the background art can shorten the playing time of the visitors in the park by reducing the playing items and transportation of vehicles, and the description is not repeated here. In addition, the existing queue entry control generally comprises the number of people who are released through an exit gate, and the corresponding number of people who are released through an entrance gate, so that the situation that the queue entry is slow occurs.
A first embodiment of the present invention provides a method for solving the above-mentioned problems in case that the reserved persons are full of the garden at the peak of travel, the method comprising the steps of:
s1, calculating the conventional tour time of the scenic spot, setting a high flow threshold value, and issuing time-sharing reservation information, wherein the time-sharing reservation information comprises reservation time periods and reservation upper limit values, the interval of the calculation time of the adjacent reservation time periods is equal to the conventional tour time plus the adjustment time, the reservation time periods take the time required by the admission of the tourists with the reservation upper limit number of the scenic spot as a period, and the adjustment time is the time required by the number of the tourists in the scenic spot to fall from the upper limit to the high flow threshold value;
the conventional tour time is the time required by a tourist to normally finish the whole-course tour of a scenic spot, and can be measured and calculated according to the scenic spot distribution, the route and the general tour speed of the scenic spot, the high flow threshold is a set value and is used for judging whether to start the subsequent steps of the embodiment and judge whether to adopt a subsequent time-sharing reservation distribution strategy, the reservation time interval is a time interval selected by a user, the user can check tickets and enter the park in the corresponding time interval after reservation, the reservation upper limit value is the maximum number of the tourist bearing the scenic spot, and the adjustment time is the time required by the number of the tourist above the high flow threshold to leave the park and can also be the total time spent by the tourist in the previous time interval to enter the park.
Step S1 is to re-set the rule of the timesharing reservation, and combine the consideration of the tour time of the scenic spot on the time period division, for example, the tour time of the scenic spot usually needs 3 hours, the maximum number of visitors carrying at the same time in the scenic spot is 3000, the scenic spot has 4 entrances, and the time required for 3000 visitors to enter the scenic spot from 4 entrances is twenty minutes, so the time period setting of the timesharing reservation can be set to 8 o 'clock-8 o' clock 20 (3000 people), 11 o 'clock 20-11 o' clock 40 (3000 people), 2 o 'clock 40-3 o' clock (3000 people). After the arrangement, the reserved tourists enter the scenic spot to play in a concentrated mode in the reserved time period, even if routes of the tourists are possibly different according to entrances, the tourists can finish touring and concentrated park exit before the next reserved time period, so that the flow of released people in a large batch is concentrated for the tourists in the next time period, the original scattered continuous small amount of people can enter the scenic spot and enter the scenic spot, the large amount of people can enter the scenic spot and enter the scenic spot in a concentrated mode, the time of queuing in the park is greatly shortened, the states of an entrance gate and an exit gate do not need to be monitored, and the complexity of system data calling is reduced. The regulation time is twenty minutes after entering the park, and in fact the regulation time can be shorter than the regulation time, for example, ten minutes.
S2, acquiring reservation information of the user, and counting the reserved ticket number of each time-sharing reservation time period at the reservation deadline; if the number of the reserved tickets reaches the high flow threshold value, the following steps S3-S5 are carried out, and if the number of the reserved tickets does not reach the high flow threshold value, the tickets are normally checked according to the time-sharing reservation and enter the park;
step S2 is mainly used to determine whether the following steps are executed, when the traffic load is not high, the ordinary time-sharing reservation can be adopted according to the time-sharing reservation rule, and when the traffic load is high and reaches the high traffic threshold, further data processing is needed to keep the reasonable arrangement of the reservation.
S3, when open verification, establishing communication with the user to obtain the user state, and making a park arrival state mark for the reservation of the user according to the user state to an adjacent time slot, wherein the park arrival state mark comprises arrival, late arrival and failure;
since the rule of setting the reservation time period in step S1 in this embodiment greatly reduces the time limit for guests to enter the park, there is a high possibility that guests who have reserved a certain time period cannot arrive within the specified time period, wherein if a late user passes, the people who will arrive at the next reservation time period will not complete their play, which affects the entering of the next reservation time period and causes queuing, and on the other hand, some users reserve a certain time period earlier and cannot arrive at the present day. Both of these visitors occupy the reserved supply amount of the scenic spot, but cannot arrive at the garden on time, and the reservation index is wasted, so that additional processing is required, the scenic spot can keep the maximum garden entry rate in a single reservation time period, and the most amount of visitors is consumed.
S4, counting the number of users with the garden state mark as unavailable, sending secondary reservation information to the arrived users in the next reservation time interval according to the reserved number, acquiring secondary reservation feedback data of the arrived users in the next reservation time interval, and modifying the corresponding reserved time interval of the arrived users according to the secondary reservation feedback data to enable the part of the next reservation time interval to be checked by the users in advance and enter the garden;
the method comprises the steps of processing reservations of users who cannot arrive at the field, directly counting the number, releasing the reserved number of the current reserved time period according to the number to form secondary reserved information, sending the secondary reserved information to the arrived users of the next reserved time period, replying the secondary reserved information as required in the arrived users of the next reserved time period which need to enter the field in advance, and changing the reserved time period of the corresponding user into the current time period from a background after feedback of the secondary reserved information is received.
S5, acquiring the real-time position of the late user in the current reservation time period, loading the map module to estimate the actual arrival time of the late user, sending the reservation allocation information to the arrived user in the reservation time period corresponding to the actual arrival time, acquiring the reservation allocation feedback information of the arrived user in the corresponding reservation time period, and modifying the corresponding reservation time period of the arrived user according to the reservation feedback information so that the part of the reservation time period corresponding to the actual arrival time period is the user who checks tickets and enters the park in advance.
The step further processes the late user, and in order to efficiently process data, the late user firstly confirms when the late user can arrive and then releases the time in the reservation information to the user of the reservation time period corresponding to the arrival time, and the reservation of the late user to the garden user of the reservation time period corresponding to the arrival time period is advanced.
Step S5 is also an alternative method, which includes obtaining the number of late users in the current appointment time period, directly issuing the appointment information of the corresponding number to the late users in the next time period, obtaining the appointment feedback information of the late users in the next time period, modifying the corresponding appointment time period of the late users according to the appointment feedback information, and so on, so that the part of the next appointment time period reaches the user to check tickets and enter the park in advance.
This alternative method does not collect the user's location to calculate the time, but the late user's reservation information, which still cannot arrive at the garden in the next time period, will need to be modified many times and can be selected for use as desired.
After the method of the first embodiment is adopted, the reservation information is verified before entering the garden, the real-time state of the user is obtained, the limited number of the users can be distributed to the actual people who arrive at the garden to keep the upper limit of the effective number of people in each time period, and the tourists can enter and exit the scenic spot in a centralized manner by allocating the sequence of reservation and actual entering the garden, so that the maximum throughput is realized in the conventional visiting time. Meanwhile, the regulation time period is used as a controllable interval for releasing the capacity, so that visitors can keep large flow in and out when going out of the park and going into the park at different reservation time periods, the efficiency of going in and out of the park is improved, and the phenomenon of slow queuing is reduced.
In this embodiment, the reservation deadline in step S2 is when the number of reserved persons in the corresponding reservation period reaches the upper limit value or when the end time of the reservation period reaches. Namely, the reservation is expired when the reservation is full, or when the reservation period actually starts ticket checking.
In this embodiment, the step S3 of establishing communication with the user to obtain the user status, and marking the garden status according to the user status for the reservation of the user in the adjacent time slot further includes the steps of:
s31, establishing communication with a user;
s32, sending the garden state confirmation information to the user;
s33, receiving reply information of the user;
and S34, marking the arrival state of the user according to the reply information of the user.
Since the user may not be able to reply to the message in time, in order to accurately acquire the data for the subsequent steps, step S3 further includes:
s35, inquiring the position information of the unanswered user;
s36, calculating the arrival time of the user according to the position information of the user;
and S37, additionally marking the arrival state of the user according to the arrival time of the user.
Since the reservation information released according to the number of unavailable users often does not match the number of users actually present, in this embodiment, the step S4 further includes the steps of:
s41, counting the number of the users with the garden status not marked as the number of the users and the number of the users in each reserved time period;
s42, comparing the number of users with the state of no arrival with the number of users in the next reserved time period, when the number of users with the state of no arrival is larger than the number of users in the next reserved time period, executing the step S43, and when the number of users with the state of no arrival is smaller than or equal to the number of users in the next reserved time period, executing the step S44;
s43, sending secondary reservation information to the arrived users in the next reservation period, and sending the secondary reservation information to the arrived users in the next reservation period in sequence according to the number of the remaining arrived users, so as to obtain secondary reservation feedback data of the arrived users in a plurality of reservation periods; modifying the corresponding reserved time period of the arrived user according to the secondary reservation feedback data;
s44, sending secondary reservation information to the arrived user in the next reservation period, and acquiring secondary reservation feedback data of the arrived user in the next reservation period; and allocating the reservation time period of the current late user according to the sequence of acquiring the secondary reservation feedback data.
When the number of the users who cannot reach the current reservation time period is larger, the users who have reached the next reservation time period obtain the secondary reservation information released by the users who cannot reach the next reservation time period, and the rest secondary reservation information is continuously issued to the users who have reached the next reservation time period until the users have reached the next reservation time period; and when the number of the users which do not arrive in the current reservation time period is less and is not enough to be issued to all the arrived users in the next reservation time period, issuing the users according to the feedback sequence of the arrived users in the next reservation time period to the secondary reservation information.
Likewise, in order to solve the problem that the number of reservation information of the late users does not match the number of users arriving at the garden, when the number of users arriving at the reservation period of the actual arrival time is less than the current number of users arriving at the garden, the surplus reservation information of the late number is distributed to the rest of the users arriving at the garden in the next reservation period in step S5; when the number of the arrived users of the reservation period of the actual arrival time is larger than or equal to the number of the current late users, the reservation period of the current late users is distributed according to the sequence of obtaining the scheduling reservation feedback information.
That is, after the appointment period of the late user in the current appointment period and the appointment period of the arrival user in the actual arrival period are allocated in step S5, since the arrival users in the corresponding appointment periods may not be as many as there are remaining, the remaining amount is directly issued to the arrival users in the next appointment period; if the number of late users is small and the users are not enough to issue, the issuing is performed according to the feedback sequence, specifically refer to the step in the step S4, and the description is not repeated here.
In this embodiment, the remaining reservation information is not distributed after being distributed in steps S4 and S5, and the remaining reservation information is transmitted to the field ticket vending machine. And the remaining reservation information which cannot be distributed is given to a ticket vending machine at a scenic spot ticket selling department for temporary customers to purchase.
In a second aspect, the present invention further provides a time sharing reservation system with time-span integration to maintain a maximum garden admission rate, the system comprising:
the user communication module 1 is used for establishing communication with a user side, issuing reservation information and receiving the reservation information of a user;
the reservation information storage module 2 is communicated with the user communication module and stores the time-sharing reservation information of the user;
the user analysis module 3 is communicated with the user communication module to acquire the user state, and analyzes the arrival state of the user according to the user state, wherein the arrival state marks comprise arrival, late arrival and non-arrival;
the reservation information marking module 4 is used for receiving the arrival state of the user sent by the user analysis module 3, communicating with the reservation information storage module 2 and writing the arrival state into the time-sharing reservation information of the corresponding user;
the secondary reservation module 5 reads and counts the number of the users with the unavailable status marks, sends secondary reservation information to the arrived users in the next reservation time period according to the number of the users with the unavailable status marks, acquires secondary reservation feedback data of the arrived users in the next reservation time period, and modifies the corresponding reserved time period of the arrived users according to the secondary reservation feedback data;
the map module 6 is used for acquiring the real-time position of the late user and loading the position into the map module to estimate the actual arrival time of the late user;
and the scheduling reservation module 7 is used for sending scheduling reservation information to the arrived users in the reservation time period corresponding to the actual arrival time, acquiring scheduling reservation feedback information of the arrived users in the corresponding reservation time period, and modifying the corresponding reservation time period of the arrived users according to the scheduling reservation feedback information.
The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (8)
1. The time-sharing reservation method for maintaining the maximum garden entry rate by time-span fusion is characterized by comprising the following steps of:
s1, calculating the conventional tour time of the scenic spot, setting a high flow threshold, and issuing time-sharing reservation information, wherein the time-sharing reservation information comprises reservation time periods and reservation upper limit values, the interval of the calculation time of the adjacent reservation time periods is equal to the conventional tour time plus the adjustment time, the reservation time periods take the time required by the number of visitors entering the park in the reservation upper limit number of the scenic spot as a period, and the adjustment time is the time required by the number of visitors in the scenic spot to fall from the upper limit to the high flow threshold;
s2, acquiring reservation information of the user, and counting the reserved ticket number of each time-sharing reservation time period at the reservation deadline; if the number of the reserved tickets reaches the high flow threshold, the following steps S3-S5 or S3-S5' are carried out, and if the number of the reserved tickets does not reach the high flow threshold, the tickets are normally checked according to the time-sharing reservation and enter the park;
s3, when verification of park entering is opened, communication is established with a user to obtain a user state, and a park entering state mark is carried out on a reserved user in the current reserved time period according to the user state, wherein the park entering state mark comprises a arrived state, a late state and a late state;
s4, counting the number of users with the garden status marked as unavailable, sending secondary reservation information to the arrived users in the next reservation time period according to the number of the unavailable users, acquiring secondary reservation feedback data of the arrived users in the next reservation time period, and modifying the corresponding reservation time period of the arrived users according to the secondary reservation feedback data to enable the part of the next reservation time period to be entered into the garden through ticket checking in advance by the users;
s5, acquiring the real-time position of the late arrival user at the current booking time period, loading a map module to estimate the actual arrival time of the late arrival user, sending booking information to the arrived user at the booking time period corresponding to the actual arrival time, acquiring booking reservation feedback information of the arrived user at the corresponding booking time period, modifying the corresponding booking time period of the arrived user according to the booking reservation feedback information, and leading the part of the booking time period corresponding to the actual arrival time period to be the user to check tickets and enter the park in advance; or the like, or, alternatively,
s5', obtaining the number of late users in the current appointment time period, directly issuing the corresponding amount of appointment information to the late users in the next time period, obtaining the appointment feedback information of the late users in the next time period, modifying the corresponding appointment time period of the late users according to the appointment feedback information, and so on, so that the part of the next appointment time period reaches the user to check tickets and enter the park in advance.
2. The time-sharing reservation method for the cross-period fusion to maintain the maximum park admission rate according to claim 1, wherein the reservation deadline in step S2 is when the number of reserved persons in the corresponding reservation period reaches an upper limit value or when the end time of the reservation period reaches.
3. The time-sharing reservation method of time-sharing convergence to maintain the maximum garden admission rate according to claim 1, wherein the establishing of communication with the user in step S3 to obtain the user status, and the marking of the park status of the reserved user in the current reserved time period according to the user status further comprises the steps of:
s31, establishing communication with a user;
s32, sending the garden state confirmation information to the user;
s33, receiving reply information of the user;
and S34, marking the arrival state of the user according to the reply information of the user.
4. The time-share reservation method for time-share fusion across time periods to maintain a maximum admission rate according to claim 3, wherein the step S3 further comprises:
s35, inquiring the position information of the unanswered user;
s36, calculating the arrival time of the user according to the position information of the user;
and S37, additionally marking the arrival state of the user according to the arrival time of the user.
5. The method of claim 1, wherein the step S4 further comprises the steps of:
s41, counting the number of the users with the garden status not marked as the number of the users and the number of the users in each reserved time period;
s42, comparing the number of users with the state of no arrival with the number of users in the next reserved time period, when the number of users with the state of no arrival is larger than the number of users in the next reserved time period, executing the step S43, and when the number of users with the state of no arrival is smaller than or equal to the number of users in the next reserved time period, executing the step S44;
s43, sending secondary reservation information to the arrived users in the next reservation period, and sending the secondary reservation information to the arrived users in the next reservation period in sequence according to the number of the remaining arrived users, so as to obtain secondary reservation feedback data of the arrived users in a plurality of reservation periods; modifying the corresponding reserved time period of the arrived user according to the secondary reservation feedback data;
s44, sending secondary reservation information to the arrived user in the next reservation period, and acquiring secondary reservation feedback data of the arrived user in the next reservation period; and allocating the reservation time period of the current late user according to the sequence of acquiring the secondary reservation feedback data.
6. The time-sharing reservation method for maintaining the maximum garden-entering rate through time-span fusion according to claim 1, wherein in step S5, when the number of arrived users in the reservation period corresponding to the actual time of arrival is less than the number of late users in the current reservation period, the surplus reservation information of the late users is allocated to the arrived users in the next reservation period; and when the number of the arrived users in the reservation time period corresponding to the actual arrival time is greater than or equal to the number of the late users in the current reservation time period, allocating the reservation information of the current late users according to the sequence of acquiring the scheduling reservation feedback information.
7. The time-sharing reservation method for time-sharing integration across time periods to maintain the maximum admission rate according to claim 5 or 6, wherein the remaining reservation information is not distributed after being distributed through the steps of S4 and S5, and the remaining reservation information is transmitted to a field ticket vending machine.
8. A time-sharing reservation system that merges across time periods to maintain a maximum garden share, the system comprising:
the user communication module is used for establishing communication with the user side, issuing reservation information and receiving the reservation information of the user;
the reservation information storage module is communicated with the user communication module and used for storing the time-sharing reservation information of the user;
the user analysis module is communicated with the user communication module to acquire a user state and analyze the arrival state of the user according to the user state, wherein the arrival state mark comprises arrival, late arrival and non-arrival;
the reservation information marking module receives the arrival state of the user sent by the user analysis module and writes the arrival state into the time-sharing reservation information of the corresponding user;
the secondary reservation module reads and counts the number of the users with the unavailable park state marks, sends secondary reservation information to the arrived users in the next reservation time period according to the number of the unavailable users, acquires secondary reservation feedback data of the arrived users in the next reservation time period, and modifies the corresponding reservation time period of the arrived users according to the secondary reservation feedback data;
the map module is used for acquiring the real-time position of the late user and loading the position into the map module to estimate the actual arrival time of the late user;
and the scheduling reservation module is used for sending scheduling reservation information to the arrived users in the reservation time period corresponding to the actual arrival time, acquiring scheduling reservation feedback information of the arrived users in the corresponding reservation time period, and modifying the corresponding reservation time period of the arrived users according to the scheduling reservation feedback information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111390024.9A CN113837416A (en) | 2021-11-23 | 2021-11-23 | Time-sharing reservation method and system for maintaining maximum garden entry rate by time-span period fusion |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111390024.9A CN113837416A (en) | 2021-11-23 | 2021-11-23 | Time-sharing reservation method and system for maintaining maximum garden entry rate by time-span period fusion |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113837416A true CN113837416A (en) | 2021-12-24 |
Family
ID=78971547
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111390024.9A Pending CN113837416A (en) | 2021-11-23 | 2021-11-23 | Time-sharing reservation method and system for maintaining maximum garden entry rate by time-span period fusion |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113837416A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2002095643A1 (en) * | 2001-05-24 | 2002-11-28 | Matsushita Electric Industrial Co., Ltd. | Attraction use scheduling apparatus, reservation information input apparatus, and system using them |
| CN1924911A (en) * | 2005-09-02 | 2007-03-07 | 艾岩 | Method for realizing reservation services in time section for clients |
| CN104616064A (en) * | 2014-12-22 | 2015-05-13 | 王宏业 | Cushioned ordering system and operation method thereof |
| CN105184377A (en) * | 2015-07-17 | 2015-12-23 | 苏州信亨自动化科技有限公司 | Movement position information-based seat reservation method and system |
| CN112308260A (en) * | 2020-11-19 | 2021-02-02 | 成都中科大旗软件股份有限公司 | Real-name time-sharing reservation ticket booking method and system |
-
2021
- 2021-11-23 CN CN202111390024.9A patent/CN113837416A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2002095643A1 (en) * | 2001-05-24 | 2002-11-28 | Matsushita Electric Industrial Co., Ltd. | Attraction use scheduling apparatus, reservation information input apparatus, and system using them |
| CN1924911A (en) * | 2005-09-02 | 2007-03-07 | 艾岩 | Method for realizing reservation services in time section for clients |
| CN104616064A (en) * | 2014-12-22 | 2015-05-13 | 王宏业 | Cushioned ordering system and operation method thereof |
| CN105184377A (en) * | 2015-07-17 | 2015-12-23 | 苏州信亨自动化科技有限公司 | Movement position information-based seat reservation method and system |
| CN112308260A (en) * | 2020-11-19 | 2021-02-02 | 成都中科大旗软件股份有限公司 | Real-name time-sharing reservation ticket booking method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7801629B2 (en) | Management of the flow of passengers, baggage and cargo in relation to travel facilities | |
| US20030102956A1 (en) | Queuing system and methods | |
| US10062234B2 (en) | System for regulating access to a resource | |
| US6889098B1 (en) | Method and apparatus for managing attraction admission | |
| CN107146451A (en) | A kind of parking management method and equipment | |
| CN110782053B (en) | Time-sharing reservation scheduling method, device, equipment and medium | |
| US11288603B2 (en) | System for real-time optimal matching of ride sharing requests | |
| US20050060173A1 (en) | Management of the flow of persons in entertainment environments | |
| CN105812478B (en) | A kind of cell phone application communication system and load-balancing method and method of hiring a car | |
| CN105827718B (en) | A kind of client communication system and load-balancing method and method of hiring a car | |
| CN110378497A (en) | A kind of station owner parking stall system of operation and management | |
| CN105959343B (en) | A kind of vehicle-mounted APP communication system and load-balancing method and method of hiring a car | |
| CN108960465A (en) | It is a kind of to consider that the parking lot for being expected service level selects reservation system and method | |
| CH695030A5 (en) | Mobilitaetsdienstesystem, especially for Ballungsraeume. | |
| CN113837416A (en) | Time-sharing reservation method and system for maintaining maximum garden entry rate by time-span period fusion | |
| EP2569759B1 (en) | System for regulating access to a resource | |
| CN112002142B (en) | Shared parking berth distribution system and method based on floating price | |
| CN110950199A (en) | Intelligent elevator remote dispatching system based on internet | |
| JP2007188386A (en) | Reservation processing system and its method | |
| CN113826126A (en) | Rental area | |
| JP4345659B2 (en) | Seat reservation system and method | |
| JP2006172145A (en) | Reservation processing system and its method | |
| CN106882653A (en) | A kind of ticketing elevator device and control method | |
| JP2018010454A (en) | Congestion degree prediction device, congestion degree prediction information delivery system, and congestion degree prediction method | |
| CN105827719B (en) | A kind of WEB user platform communication system and load-balancing method and method of hiring a car |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20211224 |
|
| RJ01 | Rejection of invention patent application after publication |