KR20040028041A - Apparatus for Assuming Prospective Waiting Time - Google Patents

Abstract

PURPOSE: A device for presuming an estimated waiting time is provided to minimize the waiting time by collecting the reserved users and the spot users of each amusement equipment, and efficiently allotting the users to the amusement equipment through the collected information. CONSTITUTION: A basic information storage(201) stores the basic information for presuming the estimated waiting time. The basic information is the basic information of each amusement equipment, the length information of a waiting line for each operation round, the reservation state information of each amusement equipment, and the reserved user information of each amusement equipment. A current state information storage(202) receives/stores the current state information needed to presume the estimate waiting time. A waiting time presuming part(203) presumes the estimated waiting time by using the information stored in the basic information storage and the current state information storage.

Description

Apparatus for Assuming Prospective Waiting Time

BACKGROUND OF THE INVENTION 1. Field of the Invention [0001] The present invention relates to an apparatus for estimating an expected waiting time, and more particularly, to an apparatus for estimating an expected waiting time used for a scheduling system and an waiting system for efficiently allocating a ride to a user in a specific time zone attracting a large number of users in an amusement park. .

As income levels improve, the importance of resort businesses is growing. Therefore, although the number of amusement parks such as theme parks is increasing, the reality is that there is no increase in facilities.

Especially on weekends, it is difficult to accommodate many users at the same time in an amusement park.

Currently, in the amusement park, a system for reserving a ride for a user who wants to use the amusement park through the Internet is established. However, when the play equipment exceeds the number of people that can accommodate, it is impossible to distribute the equipment efficiently.

Therefore, there is an urgent need for a system for efficiently distributing users when users are concentrated.

The present invention has been proposed in order to meet the above demands, and collects data of reserved users and field users for each play equipment, and allocates the user to the play equipment efficiently, thereby minimizing waiting time. It is an object of the present invention to provide an apparatus for estimating latency.

1 is an exemplary view for showing a state that a user is waiting for a ride in the amusement park to which the present invention is applied,

2 is a structural diagram of an embodiment of an apparatus for estimating an expected waiting time according to the present invention;

* Explanation of symbols for main parts of the drawings

201: basic information storage unit 202: current state information storage unit

203: waiting time estimation unit

In order to achieve the above object, the present invention collects data of reservation users and field users for each play equipment, and allocates the user to the play equipment efficiently through the equipment, thereby estimating an expected waiting time for minimizing waiting time. First storage means for receiving basic information required for estimation of waiting time and storing the same; Second storage means for receiving current state information required for waiting time estimation and storing it; And estimating means for estimating an expected waiting time using the information received from the first and second storage means.

First, the characteristics of the amusement park related to the present invention are as follows.

First, there is a characteristic that the user is crowded at a certain time such as a weekend. However, since there are not so many users during weekdays and weekdays, the number of rides cannot be increased.

Second, in the amusement park, the rides are distributed in a wide place. Therefore, it is not easy to find out even if the user tries to use a ride having a relatively low waiting time at the peak time. In addition, every walk to the front of the ride, and check the number of waiting, even if the number of waiting, the general user does not know the operating cycle of the ride, etc., it is difficult to know the exact waiting time.

Third, the user can use the free ticket (available for all rides all day), the ticket for a certain number of rides (for example, Big 5 ticket; hereafter referred to as 'Big 5 ticket'), specific ride ticket, etc. You can buy it. Normally, a user entering an amusement park to use a ride would like to use more than one ride.

Fourth, in the case of the Big 5 user or the free user, they want to use the rides they want in peak time with as little waiting time, but they do not want to use the rides in a specific order.

Finally, each ride is operated at regular time intervals. For example, a specific ride may run for 7 minutes at a time, and it may take 3 minutes for the user to get on and off.

Based on the characteristics of the amusement park as described above, the basic data required in the present invention, the operating time for each specific ride (hereinafter, simply referred to as 'OT') and the time required for getting on and off (hereinafter, simply referred to as 'RT') ), One-time total running time for specific rides (1RT = OT + RT), capacity for one-time rides for specific rides, number of reservations for specific rides for each ride (ie, specific run times), each play The queue length (ie the number of waiters) and the distribution of the number of users by each organization / day / time zone at the current service time by organization (ie the current service cycle).

The length of the queue (ie, the number of waiters) at the current running time (ie, the current running cycle) for each ride is inputted by a manager at the ticket office in front of the ride, or the length of the queue using a sensor mounted on the queue. The number of waiters can be calculated automatically. Calculating the number of waiters from the length of the queue will follow a predetermined rule (for example, 2.3 people for 1 meter of queue length).

The distribution of the number of users by each device / day of the week / time band is for inducing distribution of reservation time of the reservation user at the peak time by acquiring peak time data for each play equipment using accumulated statistical data.

In the present invention, to provide the site user with the expected waiting time information and scheduling information for the smooth use of the rides desired by the user at the peak time.

According to the present invention, in connection with the reservation system, recommend rides that can be used with minimum waiting time, inform the expected waiting time of each ride, and recommend the order of use of the rides to a user who wants to use a plurality of rides. Can give

The above objects, features and advantages will become more apparent from the following detailed description taken in conjunction with the accompanying drawings. First of all, in adding reference numerals to the components of each drawing, it should be noted that the same components have the same number as much as possible even if displayed on different drawings. Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings.

1 is an exemplary view for showing a user waiting state for the amusement equipment in the amusement park to which the present invention is applied.

As shown in the figure, the user who is waiting in front of the ride E does not know how many people are waiting in front of the ride C, and even if it is known, the one-time operation time of the ride C and the number of reservations not in the queue, etc. It's hard to find a way to use the ride with minimal time because it's unknown.

The lower case letters next to each ride means a ticket office for use by each ride. The main ticket office near the entrance will sell tickets for admission and rides (free tickets, big five tickets, individual tickets, etc.).

Amusement park users may purchase various tickets with careful planning, and rides may be used depending on the situation, so it is assumed that other rides and all forms of tickets can be purchased at the ticket office in front of each amusement park. do.

2 is a structural diagram of an embodiment of an apparatus for estimating an expected waiting time according to the present invention.

As shown in the figure, the estimation apparatus of the present invention includes a basic information storage unit 201, the current state information storage unit 202 and the waiting time estimation unit 203.

The basic information storage unit 201 is responsible for storing basic information required for waiting time estimation.

The information stored in the basic information storage unit 201 is largely divided into four types: basic information for each ride, length information of queues for each ride, reservation status information for each ride, and reservation users for each ride. Information.

The four basic information is stored in the form shown in Table 1 to Table 4, respectively.

Although a reservation may be reserved for a specific round, it is desirable to make it possible to make use of a random round over several rounds in consideration of the fact that the one ride time is very short.

In other words, the reservation is valid only within the reserved time zone or turnaround time. For example, if there are some rides that run 54 times at 10-minute intervals from 09:00 to 18:00, one of the 33, 34 and 35 rounds is reserved for use.

This reservation of any of several rounds will be referred to as "multiple round booking".

On the other hand, it is preferable to make a reservation for a specific time since the operation time of each ride is not familiar to the general user and the operation start time of the specific time may vary according to the delay of the operation.

That is, a reservation is made to use any one round from a specific time to a specific time (eg of three rounds from 12:00 to 12:30). Such a reservation over a specific time period will be referred to as "reservation within a specific time".

Reservations within a specific time period can also be converted to specific times, so reservations within multiple times and reservations within a specific time are essentially the same.

In the case of multi-time reservations and reservations within a specific time, a reservation is made not only to reserve a specific time but to use one of any time, which will be collectively referred to as "multi-time random reservation".

Reservations made up to payment at the time of reservation are referred to as "payment reservation", and reservations to be paid later after reservation are referred to as "non-payment reservation".

Payment reservations are available to unspecified users, and non-payment reservations are available only to members. Reservations can be made through the Internet, etc. In the case of non-payment reservations, the membership certificate or reservation certificate can be used within the valid time. Shall be.

The present state information storage unit 202 is responsible for receiving and storing present state information required for waiting time estimation.

When there are six rides in the form as shown in FIG. 1, the current state information storage unit 202 is the number of waiters, the next number of reservations (payment / non-payment), the number of reservations in multiple sessions and the reservation within a specific time. It can receive the current status information such as embroidery and save it.

Table 5 below shows an example in which the current state information unit stores information about the play equipment of A, B, C, D, E, and F of FIG.

The data shown in Table 5 is updated for each running cycle or at any time. In other words, when two reservations are made on the basis of reservations, two are lost from the number of reservations, and two is added to the number of waiters.

Similarly, two reservations will be canceled, or as soon as the reservation expiration time has elapsed, the number of reservations will be dropped.

In Table 5, for the sake of convenience, each of the rides is regarded as a state in which the operation starts at the same time. The waiter is a user who purchases a ticket at the ticket office and is waiting to use the ticket.

As described above, it does not matter if there are not many users for each ride, but if there are many users, such as weekends, there will be a large number of waiters as above, and the user "0" of FIG. 1 does not know where to go. It becomes a state.

Since rides are distributed in a large space, it is impossible for any user "0" to grasp how many waiters there are for each ride.

In the case of ride F, 240 people are currently waiting, so it seems to have to wait the longest, but ride F has a total running time of 5 minutes and capacity of 80 people. can do. In other words, it can be used after waiting 15 minutes.

On the other hand, in the case of the ride A, the number of seats (30 persons) is small and the driving time (20 minutes) is long, so it is necessary to wait for 40 minutes.

Here, in calculating the expected waiting time for each play equipment, the "current turn elapsed time" should be taken into account. For example, if ride time of ride A has passed 10 minutes from the current round and ride F has just started running (current time passed = 0), then ride A has an expected wait time of 30 minutes. The expected waiting time of the ride equipment F is 15 minutes.

Of the next reservation, the paying booker is in fact the buyer of the ticket and should be treated as a virtual waiter on par with the current waiter. Thus, considering only the number of visible waiters at present, it appears that ride B has a minimum wait time of eight minutes, since ride B has a wait time of eight minutes.

However, if the number of next-order reservations (payment) of ride B is 20 and they include up to 20 invisible virtual waiters that are not currently in the queue, ride B has a waiting time of 16 minutes and rides E's waiting time is shorter to 10 minutes. They are not yet queued. This is because the reservation is removed from the number of subscribers and added to the number of waiters when purchasing a ticket or confirming boarding of a ride based on the reservation.

On the other hand, in considering the number of bookers, the number of bookers in multiple sessions and the number of bookers in a specific time period must also be considered.

Again, if the number of in-game bookers for ride E is "30 (from now on three times)," there should be considered as potentially ten (= 30/3) waiters. In addition, if the number of reservations within a specific time period is 120 people in six rounds from now, the number of waiting for the next round should be regarded as having 20 (= 120/6) potential waiters. In other words, there are 30 potential waiters for the next round.

Here, although the number of reservations of the rides E within a specific time is represented by 120 people in six rounds, this is considered to be six rounds on average. For example, if there are 60 people in eight rounds and 60 people in four rounds, on average, there are 120 people in six rounds.

That is, when making a reservation for ride E, some users make a reservation over four rounds (ie within a 40 minute time interval) and some users make a reservation over eight rounds (ie within a 80 minute time interval). In this way, the user can freely determine the reservation time interval.

In fact, when calculating the potential wait, it is not divided into 120/3, but divided by the number of times each reservation is made, and adding them all together. That is, add 120 times for each subscriber, such as (1/8 + 1/4 + 1/3 + 1/9 + ...).

In the case of the next round of reservations, it is considered that a reservation has been made for one round, and eventually, the general procedure of defining the number of reservations in the multiple rounds by the number of rounds and considering them as potential waiters (or virtual waiters) can be defined.

Herein, if it is assumed that 20% of non-paying bookers are absent without making a reservation, the appropriate discount rate can be applied to the number of non-paying bookers. Among the multiple number of reservations and the number of reservations within a specific time period, the paying and non-paying reservations should be distinguished, but not for convenience, and the discount rate (unexcused absence rate) can be applied to the non-paying reservations.

The waiting time estimator 203 is in charge of estimating an expected waiting time using the information stored in the basic information storage unit 201 and the current state information storage unit 202.

This is determined by the following equation.

In the above description, Estimated Waiting Time (EWT) is the total estimated waiting time, Passed Time of Current Turn (PTCT) is the elapsed time of the current round, One Round Operation Time (1ROT) is one total operation time, N1RA (Number of 1 Round Accommodation) ) Is a one-time capacity, NWP (Number of Waiting Persons) is the number of waiting, NPWP (Number of Potential Waiting Persons) is the number of potential waiting.

In addition, NPR (Number of Payed Reservator) is the number of paid reservations from the calculation time, NNR (Number of Non-Payed Reservator) is the number of non-paid reservations that extend from the calculation time, and NTR (Number of Turns for Reservation) is the calculation time The number of times spanning from and the RA (Rate of Absence) is the rate of unexcused absences.

Also, "Lower" means dropping decimals and taking only integers.

It is assumed that the probability of the appearance of a subscriber in the series of reservations is the same, and it is assumed that the frequency of occurrence of the reservationer is the same during the period, since the number of times of reservations is usually small.

In other words, the likelihood of a reservation is considered to be in accordance with a certain distribution.

On the other hand, users who purchase a one-day free pass (or big five pass) on-site can use it at any time from the point of purchase to the end of the amusement park (the round). For example, the likelihood of a free-use user may be more likely just after the point of purchase.

In other words, it is possible to apply more freely to the purchaser of a free-pass buyer for a turn within a certain time (for example, 3 hours) from the point of purchase. By analyzing the propensity of free-use buyers in the field, they can find an appropriate distribution according to their usage time and apply it to find the number of potential waiters.

Similarly for users who purchase free passes that can be used on any date (which can be seen as booking for all rides on any date), the propensity of such users (for example, 11: 00-15: 00). In most cases, the use of play equipment can be analyzed to obtain a distribution that appropriately reflects such tendencies, and can be used to calculate the number of potential waiters.

That is, in this case, instead of summing the values divided by the number of times (NTR) over which reservations have been made in Equation 1, a distribution applicable to a specific user is obtained, and the likelihood of the appearance of a specific subscriber according to the distribution is determined for each user. All add up.

Based on Equation 1, an expected waiting time of any ride can be calculated from the current time. "Lower" means dropping decimals and taking only integers. If a user wants to know which rides have the lowest latency, they can easily calculate.

It is very difficult to estimate the expected waiting time for each ride at a specific point in time. There may be a way to use historical statistics, but it is difficult to implement, and the effectiveness is usually questioned.

Therefore, to estimate the expected waiting time based on the "near future" time point from the present time, the method proposed in the present invention can be similarly applied.

For example, to find the expected wait time (and expected wait time) of ride E after 30 minutes (ie after 3 rounds), the expected wait time (and estimated waits) after 10 minutes (after 1 round). ), Then the estimated waiting time is regarded as the current waiting time, and the estimated waiting time (and the expected waiting time) after 10 minutes is again obtained. Find the time (and expected wait), and again find the expected wait time (and expected wait) after 30 minutes.

However, as time passes, the number of people who purchase tickets on the spot as non-bookers and join the waiting list is not considered. If the total number of users in the amusement park used by reservation is about 50% of the total users, the number of potential waiters additionally generated by the reservation per one-time reservation in calculating the expected waiting time after 10 minutes is calculated. Estimated waiting time can be calculated by considering the waiting time for reservation.

That is, for example, in Table 5 above, the next waiting potential of ride E is "20 (the next paying subscriber) + 10 (1/3 of 30 over 3) + 20 (6 1/6) out of 120 rounds = 50 ".

These 50 persons are regarded as non-reserved users occurring in one round (any round close to the current round).

Another method can be included in the number of waiters, assuming that the average number of non-reserved ticket buyers in each round is the number of on-site buyers in several adjacent rounds. For example, if there are 30 non-reserved ticket buyers out of 80 waiters for the next round of ride E, about 30 non-reserved ticket buyers will occur in the next round and include them in the wait count. Applying the average of estimates of non-reserved buyers).

The number of non-reserved ticket buyers in any one round counts the number of additional non-reserved ticket buyers that occurred during one additional run from the beginning of the current round to the end of the current round. There may be a method of doing this, and there may be various methods such as counting the number of non-bookers in the total waiting time at the start or end of a specific round.

Thus, the expected waiting time in the near future based on the number of potential waiters and estimated waiters (by waiting at a certain time among the potential waiters and non-reserved ticket purchasers at the previous round) by multi-time reservation at a specific time point. Will be available.

In this case, if the expected waiting time of ride A is long, a user "0" waits for use of ride A within 10 minutes can be asked to teach the available time.

At the ticket office, it is possible to calculate the expected waiting time for several rounds from now on, and teach the user "0" a round of waiting time within 10 minutes.

Suppose a random user "0" asks the ticket office to recommend four rides that can be used soonest with minimum waiting time from now on.

The present invention proposes a method for easily scheduling using a technique for obtaining an expected waiting time at a specific time point (for example, the current time point or an arbitrary time point).

First, the expected waiting time may be obtained from the above table, and the user may be provided with the order in which the expected waiting time is shortest.

For example, assume that the order of E-B-C. However, the time point where the user "0" uses the second play equipment B here is the time elapsed by the use time of the play equipment E. FIG.

That is, the play equipment having the minimum expected waiting time when the use time of the play equipment E other than the present time has elapsed may be other play equipment (eg, the play equipment F) than the play equipment B. This is because the predicted value of the potential waiter calculated from the reservation of the ride B or the user who purchases the ticket in the non-reserved state may increase when the use time of the first ride E has elapsed (the value in the above table is Dynamic changes over time)

Therefore, except for the first play equipment E, it is possible to find a play equipment having a minimum expected waiting time at a specific point in time when the use time of the play equipment E has elapsed for only the remaining play equipment. For example, play equipment F.

Next, similarly, except for rides E and F, it is possible to find a ride (eg, ride B) having a minimum waiting time at a specific point in time after the ride time of rides E and F from the current time. . Eventually, it can be scheduled in the order of E-F-B.

This shows, of course, that near-optimal scheduling can be easily implemented in a practical way, and scheduling in the order of E-F-B is the ultimate optimal value (the order and combination that minimizes the use time of the three rides). Is difficult.

However, for the near future from the current point of view, it can be expected to give a near good result.

The same can be applied to the case where the user "0" designates specific rides (eg, rides A, B, D) and requests a method that can be used in a minimum amount of time. In addition, even if the user "0" requests a way to use as many rides as possible for a certain time (for example, one hour) from now on, the combination and sequence of rides that can be used for one hour in the same manner are also described. You can get it.

As another example, there may be a case in which the user "0" requests a method of using his favorite ride F twice, but using three rides in minimum time.

There may also be a request to use at least three of the other rides, with the exception of certain rides (eg, A, B) that they do not like.

In this case, you can easily find the solution by applying the same method described above.

In addition, the same technique can be used to answer various types of requests of user "0".

The present invention described above is capable of various substitutions, modifications, and changes without departing from the spirit of the present invention for those skilled in the art to which the present invention pertains. It is not limited to the drawing.

As described above, the present invention provides a method of obtaining an expected waiting time at a specific time in a system capable of making a random reservation, thereby minimizing the waiting time of users, and also waiting for a ride in the amusement park insignificantly. There is an effect to save.

Claims (4)

In the apparatus for estimating waiting time for minimizing waiting time by collecting data of reserved users and field users for each play equipment and efficiently assigning the user to the play equipment, First storage means for receiving basic information required for estimation of waiting time and storing the same; Second storage means for receiving current state information required for waiting time estimation and storing it; And Estimation means for estimating an expected waiting time using the information received from the first and second storage means Estimated latency estimation apparatus comprising a. The method of claim 1, The information stored in the first storage means is Including basic information for each ride, information on the length of the queue for each ride, information on reservation status for each ride, and reservation user information for each ride Estimated latency estimation apparatus characterized in that. The method of claim 2, The information stored in the second storage means is Including number of waiters, number of next reservations (payment / non-payment), number of reservations in multiple sessions and the number of reservations in specific time Estimated latency estimation apparatus characterized in that. The method of claim 1, The estimating means, Estimating the expected waiting time using the following equation Estimated latency estimation apparatus characterized in that. (However, Estimated Waiting Time (EWT) is the total expected waiting time, Passed Time of Current Turn (PTCT) is the elapsed time of the current round, 1 Total Operation Time is 1 ROT (1 Round Operation Time), Number of 1 Round Accommodation) ) Is a one-time capacity, Number of Waiting Persons (NWP) is the number of waiting, and Number of Potential Waiting Persons (NPWP) is the number of potential waiting. In addition, NPR (Number of Payed Reservator) is the number of paid reservations from the calculation time, NNR (Number of Non-Payed Reservator) is the number of non-paid reservations that extend from the calculation time, and NTR (Number of Turns for Reservation) is the calculation time The number of times spanning from and the RA (Rate of Absence) is the rate of unexcused absences of the holder. Also, "Lower" means dropping decimals and taking only integers)