Seat recommendation method and system for improving station turnover rate, electronic equipment and storage medium

Abstract

The invention relates to the technical field of new-generation information, and discloses a seat recommendation method and system for improving a station turnover rate, electronic equipment and a storage medium, seat distribution is carried out by dynamically planning reservation users and queuing passenger flow and autonomously selecting a sequential seat distribution mode or an overall seat distribution mode, and when the overall seat distribution is carried out, the seat turnover rate is improved. The optimal seat dispatching mode can be selected by calculating the probabilities of different seat states under different conditions, the single seating rate at the current moment is pursued, the turnover rate of the seats is ensured from the time span before and after, seat resources are combined and optimized under the condition that the seating order is ensured, and the seat dispatching efficiency is improved. And finally, the resource utilization rate and the turnover rate of seats are improved.

Description

Technical Field

[0001] The present invention relates to the field of new generation information technology, and in particular to a seat recommendation method, system, electronic device and storage medium for improving table turnover rate. Background Art

[0002] In different operating scenarios, there is no shortage of reservations and recommendations for various types of seats, such as seats in transportation, performances, cinemas, restaurants, etc. In some scenarios, seating is strictly carried out according to the reserved seats and time, but in some scenarios, reservations and queues are interspersed. Therefore, when there are some conflicts, the choice of whether to assign seats will often affect the turnover rate and seat resource utilization, which in turn directly affects the operating efficiency.

[0003] For example, manual scheduling cannot efficiently coordinate reservations with on-site customer flow. When available seats become available, manual judgment can lead to two extremes: 1. Assigning seats on-site without considering reservations can delay scheduled seating, leading to customer churn and reduced seat utilization. 2. Over-reserving seats can extend wait times for on-site customers and leave seats unused, further leading to customer churn and reduced seat utilization. Especially during peak hours, delayed scheduling can lead to wasted resources and customer churn, reducing overall table turnover.

[0004] Existing seat recommendation schemes usually make recommendations based on frequency of use, seating duration, etc. However, most of these schemes recommend seats based on the current seating situation and queuing situation at a given time point. They lack coordination across time spans and may fall into local optimal solutions. That is, the maximum occupancy rate may be met at the moment, but the overall turnover rate may be affected from the perspective of the entire timeline.

[0005] In summary, existing technologies have obvious limitations, making it difficult to achieve global optimization of seat resources under complex rules. This ultimately leads to the contradiction between "high seat vacancy rate" and "customers with reservations cannot be seated on time". Intelligent solutions are urgently needed to improve seat utilization and turnover rate. Summary of the Invention

[0006] In response to the problem in the prior art that the lack of coordination over a time span leads to a low overall seat turnover rate, the present invention provides a seat recommendation method, system, electronic device and storage medium for improving the turnover rate. By dynamically coordinating the reservation users and the queuing passengers, seats can be assigned by autonomously selecting a sequential assignment or a coordinated assignment. In addition, when assigning seats in a coordinated manner, the optimal assignment method can be selected by calculating the probabilities of different seat states under different conditions. It not only pursues a single occupancy rate at the current moment, but ensures the seat turnover rate from the previous and subsequent time spans. While ensuring the seating order, it realizes the combined optimization of seat resources, and ultimately improves the resource utilization and turnover rate of seats.

[0007] The following are the technical solutions of the present invention.

[0008] A seat recommendation method for improving table turnover rate comprises the following steps: When a vacant seat appears, it is determined whether there is a reservation user within the preset time period. If not, a seat is assigned in order. Otherwise, it is determined whether the number of vacant seats meets the reservation user's needs. If so, a seat is assigned to the reservation user. Otherwise, a seat is assigned in a coordinated manner. Seat assignment based on queue order: Check the number of available seats in order of queue order to see if it matches the number of people traveling with the queue number, and assign a seat to the first matching queue number; Comprehensive seat assignment: Calculate the first probability of generating enough free seats before the reservation time based on the current seating situation. If it is greater than the preset probability, switch to sequential seat assignment. Otherwise, generate several pre-assignment plans, calculate the second probability of generating enough free seats before the reservation time for different pre-assignment plans, and select the pre-assignment plan with the highest probability to assign seats to the matching queue number.

[0009] In the present invention, by judging the existence of reservation users within a preset time period and the matching of free seats, priority is given to meeting reservation needs while avoiding idle seats, reducing the contradiction between reservation customers failing to show up and waiting in line on site, and at the same time, through probability calculation, accurate prediction of seat release before the reservation time is made, maximizing seat utilization efficiency and table turnover rate while reducing the risk of reservation customers having no seats.

[0010] Optionally, the vacant seats include continuous vacancies and / or independent vacancies, wherein each seat is preset with an associated seat. If there is an associated relationship between the continuous vacancies and / or independent vacancies, pre-table sharing is performed to update the continuous vacancies, and the number of vacant seats takes the maximum value among the continuous vacancies and / or independent seats.

[0011] Optionally, the priority seating assignment includes: reading the number of free seats, determining the number of people traveling with the first-priority queue number, and if it is less than or equal to the number of free seats, assigning seats and updating the number of free seats, and re-executing the priority seating assignment; otherwise, continuing to determine the number of people traveling with the next-priority queue number, until the number of people traveling with the queue number is less than or equal to the number of free seats, assigning seats and updating the number of free seats, and re-executing the priority seating assignment.

[0012] Optionally, the calculating, based on the current seating situation, a first probability of generating sufficient vacant seats before the reservation time of the reservation user includes: All seats are classified according to the number of companions seated to obtain different actual seat combinations. The historical seating duration distribution of each companion number is retrieved, and the time difference between the seating time of each actual seat combination and the reservation time of the reservation user is calculated. The historical seating duration distribution is segmented based on the time difference as the dividing line to obtain the initial probability of each actual seat combination leaving before the reservation time. Based on the number of seats in the actual seat combination and the initial probability, the first probability of generating enough vacant seats before the reservation time of the reservation user is calculated.

[0013] In the present invention, the initial probability of each actual seat combination leaving before the reservation time can be obtained through the historical seating time distribution and the time difference between the seating time and the reservation time of the reservation user, and the first probability of generating enough vacant seats before the reservation time of the reservation user can be accurately calculated based on the initial probabilities of all seats.

[0014] Optionally, the calculating of a first probability of generating sufficient vacant seats before the reservation time of the reservation user based on the number of seats in the actual seat combination and the initial probability includes: Pre-assigning seats with associated seats to obtain several pre-assigned seat combinations, and using the lowest initial probability of the actual seat combination involved in the pre-assigned seat combination as the initial probability of the pre-assigned seat combination; Selecting, from the pre-assigned seat combinations and the actual seat combinations, the pre-assigned seat combinations and the actual seat combinations whose number of seats is greater than or equal to the user demand of the reservation user, to obtain potential seat combinations; According to the initial probabilities of the potential seat combinations, the probability that there is at least one combination that can leave before the reservation time of the reservation user is calculated to obtain a first probability.

[0015] In the present invention, all potential seat combinations can be obtained by pre-assigning tables, and the probability of these combinations being vacant before the reservation time of the reservation user is calculated, ensuring that the system can clearly know the possibility that the reservation user can dine on time.

[0016] Optionally, generating a plurality of pre-assignment plans, calculating the second probability of different pre-assignment plans generating sufficient vacant seats before the reservation time of the reservation user, and selecting the pre-assignment plan with the highest probability to assign a seat to the matching queue number may include: Several pre-assignment plans are generated based on the available seats and the number of people in the queue. The historical seating time distribution for each group size is retrieved. The time difference between the current time and the reservation time is calculated. The historical seating time distribution is segmented based on the time difference to obtain the initial probability of each group size leaving before the reservation time. Based on the initial probabilities corresponding to the combinations of the number of companions involved in different pre-assignment plans, a second probability of each pre-assignment plan generating enough vacant seats before the reservation time of the reservation user is calculated.

[0017] In the present invention, similarly, all possible seating assignments can be known through the pre-seat assignment plan, and the possibility that the reserved user can dine on time can be finally calculated.

[0018] Optionally, the number of companions is calculated based on at least one of age and gender.

[0019] The present invention further provides a seat recommendation system for improving table turnover rate, which is used in any of the above-mentioned seat recommendation methods for improving table turnover rate, comprising: The control module is used to determine whether there is a reservation user within a preset time period when a vacant seat appears. If not, a seat is assigned sequentially. Otherwise, it is determined whether the number of vacant seats meets the reservation user's needs. If so, a seat is assigned to the reservation user. Otherwise, a seat is assigned comprehensively. The first seat assignment module is used for priority seat assignment: it checks the number of available seats in order of queue order to see if it matches the number of people traveling with the queue number, and assigns a seat to the first matching queue number; The second seat assignment module is used for coordinated seat assignment: based on the current seating situation, the first probability of generating enough vacant seats before the reservation time of the reservation user is calculated. If the probability is greater than the preset probability, the seat assignment is switched to the sequential seat assignment. Otherwise, several pre-assignment plans are generated, and the second probability of different pre-assignment plans generating enough vacant seats before the reservation time of the reservation user is calculated. The pre-assignment plan with the highest probability is selected to assign seats to the matching queue number.

[0020] The present invention also provides an electronic device comprising a memory and a processor, wherein the memory stores a computer program, and when the processor calls the computer program in the memory, it implements the steps of any one of the above-mentioned seat recommendation methods for improving table turnover rate.

[0021] The present invention also provides a storage medium storing computer-executable instructions. When the computer-executable instructions are loaded and executed by a processor, the steps of any one of the above-mentioned seat recommendation methods for improving table turnover rate are implemented.

[0022] This invention achieves global optimization of seat resources by dynamically coordinating reservation users and queuing passenger flow, predicting seat release through probability calculation, and optimizing seat combinations through pre-sharing tables. This effectively improves table turnover rate and resource utilization. Specific substantial effects include: By judging the existence of reserved users within the preset time period and the matching of available seats, we prioritize meeting reservation needs while avoiding idle seats, reducing the risk of reserved customers missing their appointments. On the premise of ensuring that reserved users are seated on time, we maximize the use of seat resources and reduce the contradiction between "reserved customers unable to be seated" and "idle seats on site".

[0023] Accurately predict the first probability of generating enough free seats before the reservation time and the second probability of different pre-assignment plans, and select the optimal seating assignment method based on probabilistic judgment, avoiding focusing only on the local optimum of the current occupancy rate, ensuring efficient seat circulation over time, and improving the overall turnover rate.

[0024] By pre-grouping consecutive or independent vacancies that are related to each other, all possible seat combinations can be obtained, ensuring that the system clearly understands the possibility that users who have made reservations can dine on time, achieving the combination optimization of seat resources, avoiding seat splitting or waste, and improving seat utilization.

[0025] The number of passengers is differentiated by age, gender and other dimensions, and probability calculation is performed based on the historical distribution of seating time, so that the seating assignment plan is more in line with the actual scenario and the accuracy and flexibility of seating assignment are improved.

[0026] Through the system architecture including the control module, the first seat assignment module and the second seat assignment module, the seat assignment process is automated, avoiding the delays and errors of manual scheduling, and efficiently handling the coordination needs of reservations and on-site passenger flow, especially reducing resource waste and customer churn during peak hours, thereby improving the overall seat scheduling efficiency and operating benefits. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] Figure 1 is a flow chart of an embodiment of the present invention; Figure 2 This is a flowchart of the coordinated seat assignment according to an embodiment of the present invention; Figure 3 This is a real-life seat map according to an embodiment of the present invention. DETAILED DESCRIPTION

[0028] To make the objectives, technical solutions, and advantages of the embodiments of the present invention more clear, the technical solutions will be clearly and completely described below in conjunction with the embodiments. Obviously, the embodiments described are only some embodiments of the present invention, not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of the present invention.

[0029] It should be understood that in various embodiments of the present invention, the size of the sequence number of each process does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present invention.

[0030] It should be understood that in the present invention, "include" and "have" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or apparatus that includes a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to these processes, methods, products or apparatuses.

[0031] It should be understood that in the present invention, "multiple" refers to two or more. "And / or" is only a description of the association relationship of associated objects, indicating that three relationships can exist. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "Contains A, B and C", "Contains A, B, C" means that A, B, and C are all included, "Contains A, B or C" means that one of A, B, and C is included, and "Contains A, B and / or C" means that any one, any two, or any three of A, B, and C are included.

[0032] The technical solution of the present invention is described in detail below with reference to specific embodiments. The embodiments may be combined with each other, and the same or similar concepts or processes may not be described in detail in some embodiments.

[0033] Example: A seat recommendation method for improving table turnover rate, comprising: Figure 1 The following steps are shown: When there are vacant seats, it is determined whether there are any users who have made reservations within the preset time period. If not, seats are assigned in order. Otherwise, it is determined whether the number of vacant seats meets the needs of users who have made reservations. If so, seats are assigned to users who have made reservations. Otherwise, seats are assigned in a coordinated manner.

[0034] For ease of understanding, this embodiment uses a restaurant as an example for illustration, but the scenario of this embodiment is not limited to restaurants. Before deploying the solution of this embodiment, you can first set the restaurant's seating map, which can be directly converted from the design map or manually set.

[0035] As a feasible implementation method, a seat must be vacant before it can be recommended and assigned. Whether a seat is vacant is determined based on the settlement information of the cash register system or the manual setting of the store clerk.

[0036] As a feasible implementation, the preset duration represents a buffer period reserved by the restaurant to ensure a certain degree of on-time seating stability. This allows the restaurant to minimize the uncertainty of some customers' dining times from affecting the overall calculation and layout. The preset duration can be set to 20 minutes, 30 minutes, 40 minutes, 45 minutes, or one hour, among others. In this example, 30 minutes is used.

[0037] For example, a restaurant has three empty seats at 12:00 PM (a total of four seats if combined). The system then detects a reservation for four people at 12:20 PM. Since the number of empty seats (4) ≥ the number of people who have reserved (4), the reservation is assigned directly. If the reservation number is five, then coordinated seating is initiated.

[0038] Among them, the priority seat assignment: check the number of available seats in order according to the queue order to see if it matches the number of people traveling with the queue number, and assign a seat to the first matching queue number.

[0039] As a feasible implementation method, the priority seating assignment described in this embodiment includes: reading the number of available seats, determining the number of people traveling with the first-priority queue number, and if it is less than or equal to the number of available seats, assigning seats and updating the number of available seats, and re-executing the priority seating assignment; otherwise, continuing to determine the number of people traveling with the next-priority queue number, until the number of people traveling with the queue number is less than or equal to the number of available seats, assigning seats and updating the number of available seats, and re-executing the priority seating assignment.

[0040] This implementation follows a first-come, first-served principle. Queue numbers are sorted by the time they were picked up, and priority seating is only assigned to users queuing in person. For example, if there are available seats for a table of four, queue number 1 has two people, queue number 2 has five people, and queue number 3 has three people, the system will first determine if the number of people in queue number 1 (2) ≤ 4, then assign seats, update the number of available seats to 2, and restart the priority seating process.

[0041] As a feasible implementation, the available seats described in this embodiment include consecutive vacancies and / or independent vacancies, with each seat pre-associated. If there is an association between consecutive vacancies and / or independent vacancies, pre-joining tables will be performed to update the consecutive vacancies, with the maximum number of available seats being the maximum of the consecutive vacancies and / or independent vacancies. For example, associated seats refer to tables that can be combined. For example, if tables A1 and A2 are independent but the distance between them meets the conditions for joining, then the associated seat A2 can be set in A1's properties.

[0042] The process of coordinated seat assignment is as follows: Figure 2As shown: Based on the current seating situation, the first probability of generating enough free seats before the reservation time of the reservation user is calculated. If it is greater than the preset probability, the system switches to sequential seating assignment. Otherwise, several pre-assignment plans are generated, and the second probability of generating enough free seats before the reservation time of the reservation user is calculated for different pre-assignment plans. The pre-assignment plan with the highest probability is selected to assign seats to the matching queue number.

[0043] As a feasible implementation, the calculation of the first probability includes: All seats are classified according to the number of people seated together to obtain different actual seat combinations. The historical seating duration distribution for each number of people is retrieved. The time difference between the seating time of each actual seat combination and the reservation time is calculated. The historical seating duration distribution is segmented based on the time difference as the dividing line to obtain the initial probability of each actual seat combination leaving the seat before the reservation time. Pre-assigning seats with associated seats to obtain several pre-assigned seat combinations, and using the lowest initial probability of the actual seat combination involved in the pre-assigned seat combination as the initial probability of the pre-assigned seat combination; Selecting, from the pre-assigned seat combinations and the actual seat combinations, the pre-assigned seat combinations and the actual seat combinations whose number of seats is greater than or equal to the user demand of the reservation user, to obtain potential seat combinations; According to the initial probabilities of the potential seat combinations, the probability that there is at least one combination that can leave before the reservation time of the reservation user is calculated to obtain a first probability.

[0044] In this embodiment, categorizing by the number of seated companions refers to categorizing seats by the number of seated companions, dividing them into groups of one, two, or three people, and if necessary, further subdividing them into groups of men and women, adults and children, etc. The actual seat combinations represent the current seating situation. The historical seating duration distribution in this embodiment refers to retrieving historical data for each group of companions. For example, in the dining duration statistics for two people, 20% of the time is less than 20 minutes, 30% is between 20 and 30 minutes, 25% is between 30 and 40 minutes, 10% is between 40 and 50 minutes, 10% is between 50 and 60 minutes, and 5% is over 60 minutes. The same applies to other groups. This yields the historical seating duration distribution.

[0045] In this example, the time difference calculation and initial probability are as follows: assuming the reservation time is 1:00 PM and the current seating time for seating combination A3-4 is 11:30 AM, the time difference is 1.5 hours. Based on historical data, the probability of a table of four being unseated within 1.5 hours is 60%, so the initial probability for this combination is 60%.

[0046] In this embodiment, if only actual seat combinations are calculated, then filtering based on the number of users who made the reservation may easily miss some potential seats that can be joined. For example, if a reservation is for a group of five, if filtering is performed directly based on five people, the potential combinations in the current actual seat combinations may be limited. Therefore, this embodiment introduces pre-assembled seat combinations to include seats that can be joined but are not actually joined. For example, if a table for two and a table for three can be joined, the pre-assembled seat combinations will include this possible combination.

[0047] Therefore, pre-assigned seating groups pre-group related seats (such as consecutive tables that can be combined, or separate tables with spacing that meets the requirements for table joining) into virtual tables. After pre-assignment, the probability of vacancy is calculated for each group. For example, the initial probability for a 2+3 pre-assigned seating group is the lowest of the two- and three-person tables (since the table can only be joined if all seats are vacated). This ensures a conservative prediction and reduces the risk of reservations being left without a seat.

[0048] Therefore, as a possible implementation, the first probability is calculated as follows: For example, if the initial probabilities for three potential seating combinations are 50%, 60%, and 70%, respectively, then the probabilities of all three combinations remaining are 50%, 40%, and 30%, respectively. The probability that all three combinations remain is 0.5*0.4*0.3=0.06, and the probability that at least one combination is absent is 1-0.06=0.94, giving a first probability of 94%. Typically, the default probability can be 90% (or a higher or lower value depending on the degree of conservatism). If the first probability is 94%, which is greater than the default probability, then probabilistically speaking, there is a 94% probability that the reservation user will be seated immediately upon arrival (there is a 94% probability that other available seats will be available). Therefore, the currently available seat can be assigned immediately, without waiting for the reservation user. Otherwise, the reservation user may need to wait upon arrival, so the seat is temporarily reserved.

[0049] It should be noted that the preset probability can be set to a higher or lower value depending on whether it is conservative, for example, a more aggressive setting of 80%, or a conservative setting of 95%.

[0050] In this embodiment, this process can be expressed by a probability formula:

[0051] Where P represents the first probability, n represents the number of potential seat combinations, and i is the combination number. is the initial probability for each potential seat combination.

[0052] As a feasible implementation method, the calculation of the second probability includes: Several pre-assignment plans are generated based on the available seats and the number of people in the queue. The historical seating time distribution for each group size is retrieved. The time difference between the current time and the reservation time is calculated. The historical seating time distribution is segmented based on the time difference to obtain the initial probability of each group size leaving before the reservation time. Based on the initial probabilities corresponding to the combinations of the number of companions involved in different pre-assignment plans, a second probability of each pre-assignment plan generating enough vacant seats before the reservation time of the reservation user is calculated.

[0053] In this embodiment, similarly, all possible seating assignments can be known through the pre-seat assignment plan, and the possibility that the reserved user can dine on time can be finally calculated.

[0054] The calculation principle of the second probability is the same as that of the first probability, the only difference is that the initial probability is the initial probability of the pre-assignment plan.

[0055] In this embodiment, by judging the existence of reserved users within the preset time period and the matching of available seats, priority is given to meeting reservation needs while avoiding idle seats, reducing the contradiction between reserved customers failing to show up and waiting in line on site, and at the same time, through probability calculation, accurate prediction of seat release before the reservation time is made, maximizing seat utilization efficiency and table turnover rate while reducing the risk of reserved customers having no seats.

[0056] This embodiment further provides a seat recommendation system for improving table turnover rate, which is used in any of the above-mentioned seat recommendation methods for improving table turnover rate, including: The control module is used to determine whether there is a reservation user within a preset time period when a vacant seat appears. If not, a seat is assigned sequentially. Otherwise, it is determined whether the number of vacant seats meets the reservation user's needs. If so, a seat is assigned to the reservation user. Otherwise, a seat is assigned comprehensively. The first seat assignment module is used for priority seat assignment: it checks the number of available seats in order of queue order to see if it matches the number of people traveling with the queue number, and assigns a seat to the first matching queue number; The second seat assignment module is used for coordinated seat assignment: based on the current seating situation, the first probability of generating enough vacant seats before the reservation time of the reservation user is calculated. If the probability is greater than the preset probability, the seat assignment is switched to the sequential seat assignment. Otherwise, several pre-assignment plans are generated, and the second probability of different pre-assignment plans generating enough vacant seats before the reservation time of the reservation user is calculated. The pre-assignment plan with the highest probability is selected to assign seats to the matching queue number.

[0057] In this embodiment, the system can automatically adjust the historical seating time distribution based on restaurant operating data and customer dining duration, and regularly update it to achieve the best results for each restaurant, achieving a personalized experience for each restaurant. In addition, the data of each restaurant can provide a reference for new restaurants of the same type.

[0058] The system platform of this embodiment can also generate a real-life seating map based on the actual layout of the restaurant, such as Figure 3 As shown, it provides customers with an intuitive seat selection experience. It can also further refine seat attributes, such as type: regular seat, bar, private room, whether it is against the wall, whether it can be shared, etc.

[0059] These settings can be manually entered or the system can automatically identify the actual layout. For example, it can determine the seating attributes by identifying walls, seat / table spacing, and separate rooms.

[0060] The system of this embodiment can also set additional constraints on seat recommendations and seating. For example, the number of empty seats cannot be less than the minimum number of regular reservations, similar to the rule that movie theaters do not allow tickets to be sold in separate seats. When the minimum number of regular reservations is set to 2, separate seats cannot be recommended.

[0061] On this basis, the system can also accept additional requirements of users who are queuing or making reservations, such as not wanting to sit against the wall, not wanting to sit at the bar, only wanting to sit in a private room, etc. The system can simply add these constraints based on the aforementioned recommendation method.

[0062] Similarly, this embodiment also allows for operations such as rebooking, standbying, canceling, and swapping. For example, customers can modify their dining time and number of diners, allowing for timely adjustments to restaurant seating information to avoid wasted seats and improve seat utilization. When a customer cancels a reservation, the standby is immediately notified, reducing vacant seats. For customers leaving early, the restaurant can be provided with a reminder to leave early, reducing vacant seats and increasing occupancy rates. Orders with the same number of diners, start time, and end time can be swapped. It should be noted that these conditions can be relaxed or tightened as appropriate.

[0063] This embodiment can also set the priority of seats. When there are vacant seats with the same other conditions, they can be recommended in order of priority. The user can also be allowed to change or refresh the recommended seats.

[0064] This embodiment also provides for post-deployment linkage between different system entities. For example, it can recommend brand restaurants in the same city: if a restaurant doesn't have a suitable meal time, the system will recommend customers to a nearby restaurant of the same brand, thereby increasing the occupancy rate of the available restaurant. Restrictions can also be added, such as a brand restaurant restriction in the same city: a user can only reserve one order at the same brand restaurant, preventing customers from selecting multiple restaurants and causing losses to the restaurant by cancelling orders at short notice.

[0065] It should be added that in the method or system of this embodiment, rules can be added, modified or reduced according to the actual needs of different operators. These rules can be written manually or derived based on some data or calculation analysis of the system to meet personalized seat recommendations. The specific rules are not listed here.

[0066] This embodiment also provides an electronic device, including a memory and a processor, wherein the memory stores a computer program, and when the processor calls the computer program in the memory, it implements the steps of any one of the above-mentioned seat recommendation methods for improving table turnover rate.

[0067] The electronic device can be a fixed or mobile device such as a computer, mobile phone, tablet, or various existing cash register devices can be reused.

[0068] This embodiment also provides a storage medium, in which computer-executable instructions are stored. When the computer-executable instructions are loaded and executed by a processor, the steps of any one of the above-mentioned seat recommendation methods for improving table turnover rate are implemented.

[0069] This embodiment achieves global optimization of seat resources by dynamically coordinating reservation users and queueing passengers, predicting seat release through probability calculation, and optimizing seat combinations through pre-sharing tables, effectively improving table turnover rate and resource utilization. Specific substantial effects include: By judging the existence of reserved users within the preset time period and the matching of available seats, we prioritize meeting reservation needs while avoiding idle seats, reducing the risk of reserved customers missing their appointments. On the premise of ensuring that reserved users are seated on time, we maximize the use of seat resources and reduce the contradiction between "reserved customers unable to be seated" and "idle seats on site".

[0070] Accurately predict the first probability of generating enough free seats before the reservation time and the second probability of different pre-assignment plans, and select the optimal seating assignment method based on probabilistic judgment, avoiding focusing only on the local optimum of the current occupancy rate, ensuring efficient seat circulation over time, and improving the overall turnover rate.

[0071] By pre-grouping consecutive or independent vacancies that are related to each other, all possible seat combinations can be obtained, ensuring that the system clearly understands the possibility that users who have made reservations can dine on time, achieving the combination optimization of seat resources, avoiding seat splitting or waste, and improving seat utilization.

[0072] The number of passengers is differentiated by age, gender and other dimensions, and probability calculation is performed based on the historical distribution of seating time, so that the seating assignment plan is more in line with the actual scenario and the accuracy and flexibility of seating assignment are improved.

[0073] Through the system architecture including the control module, the first seat assignment module and the second seat assignment module, the seat assignment process is automated, avoiding the delays and errors of manual scheduling, and efficiently handling the coordination needs of reservations and on-site passenger flow, especially reducing resource waste and customer churn during peak hours, thereby improving the overall seat scheduling efficiency and operating benefits.

[0074] Through the description of the above implementation methods, technical personnel in the relevant field can understand that for the convenience and simplicity of description, only the division of the above-mentioned functional modules is used as an example. In actual applications, the above-mentioned functions can be distributed and completed by different functional modules as needed, that is, the internal structure of the specific device can be divided into different functional modules to complete all or part of the functions described above.

[0075] In the embodiments provided in this application, it should be understood that the disclosed structures and methods can be implemented in other ways. For example, the embodiments of the structure described above are merely schematic. For example, the division of modules or units is only a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another structure, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interface, structure or unit, which can be electrical, mechanical or other forms.

[0076] Units described as separate components may or may not be physically separate, and components shown as units may be one physical unit or multiple physical units, that is, they may be located in one place or distributed in multiple places. Some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.

[0077] In addition, the functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated units may be implemented in the form of hardware or software functional units.

[0078] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application is essentially or the part that 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 several instructions for enabling a device (which can be a single-chip microcomputer, chip, etc.) or a processor (processor) to execute all or part of the steps of the various embodiments of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0079] The above content is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of the present application. Therefore, the scope of protection of the present application should be based on the scope of protection of the claims.

Claims

1. A seat recommendation method for improving table turnover rate, characterized in that: The following steps are involved: When a vacant seat appears, it is determined whether there is a reservation user within the preset time period. If not, a seat is assigned in order. Otherwise, it is determined whether the number of vacant seats meets the reservation user's needs. If so, a seat is assigned to the reservation user. Otherwise, a seat is assigned in a coordinated manner. Seat assignment based on queue order: Check the number of available seats in order of queue order to see if it matches the number of people traveling with the queue number, and assign a seat to the first matching queue number; Comprehensive seat assignment: Calculate the first probability of generating enough free seats before the reservation time based on the current seating situation. If it is greater than the preset probability, switch to sequential seat assignment. Otherwise, generate several pre-assignment plans, calculate the second probability of generating enough free seats before the reservation time for different pre-assignment plans, and select the pre-assignment plan with the highest probability to assign seats to the matching queue number.

2. A seat recommendation method for improving table turnover rate according to claim 1, characterized in that: The vacant seats include continuous vacancies and / or independent vacancies, where each seat is preset with an associated seat. If there is an associated relationship between the continuous vacancies and / or independent vacancies, pre-shared tables are performed to update the continuous vacancies, and the number of vacant seats takes the maximum value of the continuous vacancies and / or independent vacancies.

3. A seat recommendation method for improving table turnover rate according to claim 1, characterized in that: The priority seating assignment includes: reading the number of available seats, determining the number of people traveling with the first-priority queue number; if the number is less than or equal to the number of available seats, assigning seats and updating the number of available seats, and re-executing the priority seating assignment; otherwise, continuing to determine the number of people traveling with the next-priority queue number until the number of people traveling with the queue number is less than or equal to the number of available seats, assigning seats and updating the number of available seats, and re-executing the priority seating assignment.

4. A seat recommendation method for improving table turnover rate according to claim 1, characterized in that: The calculating, based on the current seating situation, of a first probability of generating sufficient vacant seats before the reservation time of the reservation user includes: All seats are classified according to the number of companions seated to obtain different actual seat combinations. The historical seating duration distribution of each companion number is retrieved, and the time difference between the seating time of each actual seat combination and the reservation time of the reservation user is calculated. The historical seating duration distribution is segmented based on the time difference as the dividing line to obtain the initial probability of each actual seat combination leaving before the reservation time. Based on the number of seats in the actual seat combination and the initial probability, the first probability of generating enough vacant seats before the reservation time of the reservation user is calculated.

5. A seat recommendation method for improving table turnover rate according to claim 4, characterized in that: The calculating of the first probability of generating sufficient vacant seats before the reservation time of the reservation user based on the number of seats in the actual seat combination and the initial probability includes: Pre-assigning seats with associated seats to obtain several pre-assigned seat combinations, and using the lowest initial probability of the actual seat combination involved in the pre-assigned seat combination as the initial probability of the pre-assigned seat combination; Selecting, from the pre-assigned seat combinations and the actual seat combinations, the pre-assigned seat combinations and the actual seat combinations whose number of seats is greater than or equal to the user demand of the reservation user, to obtain potential seat combinations; According to the initial probabilities of the potential seat combinations, the probability that there is at least one combination that can leave before the reservation time of the reservation user is calculated to obtain a first probability.

6. A seat recommendation method for improving table turnover rate according to claim 1, characterized in that: The generating of a plurality of pre-assignment plans, calculating the second probability of different pre-assignment plans generating sufficient vacant seats before the reservation time of the reservation user, and selecting the pre-assignment plan with the highest probability to assign a seat to the matching queue number includes: Several pre-assignment plans are generated based on the available seats and the number of people in the queue. The historical seating time distribution for each group size is retrieved. The time difference between the current time and the reservation time is calculated. The historical seating time distribution is segmented based on the time difference to obtain the initial probability of each group size leaving before the reservation time. Based on the initial probabilities corresponding to the combinations of the number of companions involved in different pre-assignment plans, a second probability of each pre-assignment plan generating enough vacant seats before the reservation time of the reservation user is calculated.

7. A seat recommendation method for improving table turnover rate according to any one of claims 1 to 6, characterized in that: The number of companions is calculated based on at least one of age and gender.

8. A seat recommendation system for improving table turnover rate, used to implement a seat recommendation method for improving table turnover rate according to any one of claims 1 to 7, characterized in that: include: The control module is used to determine whether there is a reservation user within a preset time period when a vacant seat appears. If not, a seat is assigned sequentially. Otherwise, it is determined whether the number of vacant seats meets the reservation user's needs. If so, a seat is assigned to the reservation user. Otherwise, a seat is assigned comprehensively. The first seat assignment module is used for priority seat assignment: it checks the number of available seats in order of queue order to see if it matches the number of people traveling with the queue number, and assigns a seat to the first matching queue number; The second seat assignment module is used for coordinated seat assignment: based on the current seating situation, the first probability of generating enough vacant seats before the reservation time of the reservation user is calculated. If the probability is greater than the preset probability, the seat assignment is switched to the sequential seat assignment. Otherwise, several pre-assignment plans are generated, and the second probability of different pre-assignment plans generating enough vacant seats before the reservation time of the reservation user is calculated. The pre-assignment plan with the highest probability is selected to assign seats to the matching queue number.

9. An electronic device, characterized in that: The method comprises a memory and a processor, wherein a computer program is stored in the memory, and when the processor calls the computer program in the memory, the method implements the steps of a seat recommendation method for improving table turnover rate as described in any one of claims 1 to 7.

10. A storage medium, characterized in that: The storage medium stores computer-executable instructions, which, when loaded and executed by a processor, implement the steps of a seat recommendation method for improving table turnover rate as described in any one of claims 1 to 7.

Images