Queue length calculation method, device and equipment and storage medium

Abstract

The application discloses a queuing number calculation method, device and equipment and a storage medium. The queuing number calculation method comprises the following steps: acquiring first queuing queue and time information of current queue query of a user; determining a first priority of the first queuing queue and a second priority of other queuing queues; and determining a queuing number result of the current queue query based on the first priority, the second priority and the time information. The application belongs to the technical field of computers, considers the first priority of the queuing queue allocated by the user, the second priority of other queuing queues and the time information of the current queue query, two influencing factors, calculates the queuing number result of the current queue query, makes the waiting number displayed by the ticket number consistent with the actual number of people to be waited for, the expected queuing time of the user is small in difference with the actual queuing time, and thus the user experience is improved.

Description

Technical Field

[0001] This application relates to the field of computer technology, and in particular to a method, apparatus, device and storage medium for calculating the number of people in a queue. Background Technology

[0002] Currently, many financial institutions have branches with corresponding service windows to facilitate offline transactions for users. However, due to the limited number of service windows at these service windows, users typically need to queue and obtain tickets during peak hours, then proceed to the corresponding service window in an orderly manner according to their ticket number.

[0003] In related technologies, business outlets often need to provide differentiated services based on customer levels. They also need to design service queues for account opening customers, special customers, and customers with cash and non-cash transaction needs, resulting in numerous queues. When the number of service windows is less than the number of queues, and the number of people at the business outlet is too large, each queue will have some people waiting. This leads to a discrepancy between the number of people waiting displayed on the ticket and the actual number of people waiting, causing a significant difference between the user's expected waiting time and the actual waiting time, resulting in a degraded user experience. Summary of the Invention

[0004] The main purpose of this application is to provide a method, apparatus, device and storage medium for calculating the number of people in a queue, in order to solve the technical problem in the prior art where there is a large difference between the user's expected queuing time and the actual queuing time, which leads to a decline in user experience.

[0005] To achieve the above objectives, this application provides a method for calculating the number of people in a queue, the method comprising:

[0006] Retrieve the user's first queue and the time information of the current queue query;

[0007] Determine the first priority of the first queue and the second priority of the other queues;

[0008] Based on the first priority, the second priority, and the time information, the queue number result for the current queue query is determined.

[0009] Optionally, the step of determining the queue size result of the current queue query based on the first priority, the second priority, and the time information includes:

[0010] Identify the second queue whose second priority is higher than the first priority among other queues, and accumulate the number of people in the first queue of the current second queue;

[0011] Accumulate the number of people in the second queue before the time information in the first queue;

[0012] The number of people in the first queue and the number of people in the second queue are added together to obtain the number of people in the queue for the current queue query.

[0013] Optionally, the step of obtaining the user's first queue and the time information of the current queue query includes:

[0014] Retrieve user information and the current time information of the queue query;

[0015] Based on the user information, the user's ranking is assigned to the first queue.

[0016] Optionally, the user information includes business information and identity information, and the step of assigning the user to the first queuing queue based on the user information includes:

[0017] Based on the identity information, users are grouped to obtain target groups;

[0018] Based on the business information, the user's ranking is assigned to the first queue under the target group.

[0019] Optionally, the step of determining the queue size result of the current queue query based on the first priority, the second priority, and the time information includes:

[0020] Identify the second queue with a higher priority than the first priority among other queues under the target group, and accumulate the number of people in the first queue of the current second queue;

[0021] Accumulate the number of people in the second queue before the time information in the first queue;

[0022] The number of people in the first queue and the number of people in the second queue are added together to obtain the number of people in the queue for the current queue query.

[0023] Optionally, the step of determining the second queue with a higher priority than the first priority among other queues under the target group includes:

[0024] Determine the second priority of each other queue under the target group;

[0025] The second priority is compared with the first priority to obtain the comparison result;

[0026] The queue with the second priority higher than the first priority in the comparison results is identified as the second queue.

[0027] Optionally, after the step of determining the queue size result of the current queue query based on the first priority and the time information, the method includes:

[0028] Based on the queue length results, a service queuing scheme is determined;

[0029] Based on the queue size and the service call number scheme, calculate the current queue time.

[0030] This application also provides a queue length calculation device, the queue length calculation device comprising:

[0031] The acquisition module is used to obtain the user's first queue and the time information of the current queue query;

[0032] A determination module is used to determine the first priority of the first queuing queue and the second priority of other queuing queues;

[0033] The calculation module is used to determine the number of people queuing for the current queue query based on the first priority, the second priority, and the time information.

[0034] This application also provides a queue length calculation device, which includes: a memory, a processor, and a program stored in the memory for implementing the queue length calculation method.

[0035] The memory is used to store the program that implements the method for calculating the number of people in the queue;

[0036] The processor is used to execute a program that implements the queue number calculation method, so as to implement the steps of the queue number calculation method.

[0037] This application also provides a storage medium storing a program for implementing a method for calculating the number of people in a queue, the program being executed by a processor to implement the steps of the method for calculating the number of people in a queue.

[0038] This application provides a method, apparatus, device, and storage medium for calculating queue length, addressing the issue in related technologies where the number of people displayed on the ticket does not match the actual number of people waiting, leading to a significant difference between the user's expected and actual queuing times and a degraded user experience. In this application, the method involves acquiring the user's first queue and the time information of the current queue query; determining the first priority of the first queue and the second priority of other queues; and determining the queue length result for the current queue query based on the first priority, the second priority, and the time information. In other words, this application considers two dimensions of influencing factors: the first priority of the user's assigned queue and the second priority of other queues, as well as the time information of the current queue query, to calculate the queue length result for the current queue query. This ensures that the number of people displayed on the ticket matches the actual number of people waiting, minimizing the difference between the user's expected and actual queuing times, thereby improving the user experience. Attached Figure Description

[0039] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this application and, together with the description, serve to explain the principles of this application. To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, those skilled in the art can obtain other drawings based on these drawings without any creative effort.

[0040] Figure 1 This is a schematic diagram of the device structure of the hardware operating environment involved in the embodiments of this application;

[0041] Figure 2 This is a flowchart illustrating the first embodiment of the queue number calculation method of this application;

[0042] Figure 3 This is a schematic diagram of the queuing number calculation device of this application;

[0043] Figure 4 This is a schematic diagram of a scenario for the second embodiment of the queue number calculation method of this application.

[0044] The realization of the purpose, functional features and advantages of this application will be further explained in conjunction with the embodiments and with reference to the accompanying drawings. Detailed Implementation

[0045] It should be understood that the specific embodiments described herein are merely illustrative of this application and are not intended to limit this application.

[0046] like Figure 1 As shown, Figure 1This is a schematic diagram of the terminal structure of the hardware operating environment involved in the embodiments of this application.

[0047] The terminal in this application embodiment can be a PC, or a smartphone, tablet computer, e-book reader, MP3 (Moving Picture Experts Group Audio Layer III) player, MP4 (Moving Picture Experts Group Audio Layer IV) player, portable computer, or other portable terminal devices with display functions.

[0048] like Figure 1 As shown, the terminal may include: a processor 1001, such as a CPU; a network interface 1004; a user interface 1003; a memory 1005; and a communication bus 1002. The communication bus 1002 is used to enable communication between these components. The user interface 1003 may include a display screen and an input unit such as a keyboard. Optionally, the user interface 1003 may also include a standard wired interface or a wireless interface. The network interface 1004 may optionally include a standard wired interface or a wireless interface (such as a Wi-Fi interface). The memory 1005 may be high-speed RAM or non-volatile memory, such as a disk drive. Optionally, the memory 1005 may also be a storage device independent of the aforementioned processor 1001.

[0049] Optionally, the terminal may also include a camera, RF (Radio Frequency) circuitry, sensors, audio circuitry, a WiFi module, and so on. Sensors may include light sensors, motion sensors, and other sensors. Specifically, light sensors may include ambient light sensors and proximity sensors. The ambient light sensor can adjust the display brightness according to the ambient light level, while the proximity sensor can turn off the display and / or backlight when the mobile terminal is moved to the ear. As a type of motion sensor, a gravity accelerometer can detect the magnitude of acceleration in various directions (generally three axes). When stationary, it can detect the magnitude and direction of gravity, and can be used for applications that identify the mobile terminal's posture (such as landscape / portrait switching, related games, magnetometer posture calibration), vibration recognition functions (such as pedometers, taps), etc. Of course, the mobile terminal may also be equipped with other sensors such as gyroscopes, barometers, hygrometers, thermometers, and infrared sensors, which will not be elaborated here.

[0050] Those skilled in the art will understand that Figure 1The terminal structure shown does not constitute a limitation on the terminal and may include more or fewer components than shown, or combine certain components, or have different component arrangements.

[0051] like Figure 1 As shown, the memory 1005, which serves as a computer storage medium, may include an operating device, a network communication module, a user interface module, and a queue number calculation program.

[0052] exist Figure 1 In the terminal shown, the network interface 1004 is mainly used to connect to the backend server and communicate with the backend server; the user interface 1003 is mainly used to connect to the client (user terminal) and communicate with the client; and the processor 1001 can be used to call the queue number calculation program stored in the memory 1005.

[0053] Reference Figure 2 This application provides a method for calculating the number of people in a queue, the method comprising:

[0054] Step S100: Obtain the user's first queue and the time information of the current queue query;

[0055] Step S200: Determine the first priority of the first queuing queue and the second priority of the other queuing queues;

[0056] Step S300: Based on the first priority, the second priority, and the time information, determine the queue number result of the current queue query.

[0057] In this embodiment, the application scenario is:

[0058] As an example, a scenario for calculating the number of people in a queue can be seen in bank branches where customers need to be accounted for. In related technologies, branches often need to provide differentiated services based on customer level, and design service queues for account opening customers, special customers, and customers with cash and non-cash transaction needs, resulting in many queues. When the number of service windows is less than the number of queues, if the number of customers at the branch is too large and each queue has a number of people, the number of people waiting displayed on the ticket will not match the actual number of people waiting, leading to a significant difference between the user's expected and actual waiting time, thus degrading the user experience. To address this scenario, the queue number calculation method in this embodiment considers two dimensions of influencing factors: the first priority of the queue assigned to the user and the second priority of other queues, as well as the time information of the current queue query. This method calculates the number of people waiting in the current queue, ensuring that the number of people displayed on the ticket matches the actual number of people waiting, minimizing the difference between the user's expected and actual waiting time, thereby improving the user experience.

[0059] As an example, the application scenarios for calculating the number of people in a queue are not limited to the above-mentioned need to calculate the number of people in the queue when conducting business at a bank's offline business outlets, but also include various other scenarios for calculating the number of people in a queue, without making specific limitations here.

[0060] The purpose of this embodiment is to minimize the difference between the user's expected queuing time and the actual queuing time, thereby improving the user experience.

[0061] In this embodiment, the queue number calculation method is applied to the queue number calculation device.

[0062] The specific steps are as follows:

[0063] Step S100: Obtain the user's first queue and the time information for querying the current queue;

[0064] In this embodiment, the user's first queue refers to the queue in which the user is queuing. It can be a queue selected by the user himself, for example, after the user takes a number at a self-service terminal and queues in the corresponding queue. It can also be a queue selected by the device, for example, after the user sends his identity information and the business information he is handling to the device, the device selects the corresponding queue.

[0065] In this embodiment, the device can obtain the time information of the current queue query by determining the time information of the queue query in scenarios such as before, during, or after the user takes a number through the system clock.

[0066] Specifically, step S100 includes the following steps S110-S120:

[0067] Step S110: Obtain user information and the current queue query time information;

[0068] In this embodiment, the user information includes business information and identity information. The business information refers to the relevant information of the business that the user needs to handle, including but not limited to account opening, cash business, and non-cash business. The identity information includes ordinary customers, VIP customers, and special group customers. Different businesses or identities have different priorities for handling business, which will affect the queue order.

[0069] In this embodiment, the time information of the current queue query refers to the time information when the user performs a queue query in scenarios such as before, during, or after obtaining a number.

[0070] In this embodiment, the device can acquire user information by reading a carrier containing user information, such as an ID card, a bank card, or recognizing a face; it can also be acquired by the user filling in relevant user information or uploading user data. No specific limitation is made here. The device can acquire the time information of the current queue query by determining the time of the queue query in scenarios such as before, during, or after obtaining a number through the system clock.

[0071] Step S120: Based on the user information, assign the user's ranking to the first queuing queue;

[0072] In this embodiment, the device assigns the user's ranking to the first queue based on the user information, wherein, referring to Figure 4 Each offline service outlet has multiple service windows and multiple queues, with the number of queues exceeding the number of service windows. Each queue is arranged according to ticket number order (time order). A single service window can call multiple queues, and the priority of each queue can be different (higher priority numbers are called first, then lower priority numbers) or the same (called according to the time order of all tickets in the two queues). Specifically, after a user checks the queue before, during, or after obtaining a number, the device determines the user's queue based on the user information (customer level and service requested) and assigns the user to that queue, i.e., the first queue.

[0073] Step S200: Determine the first priority of the first queuing queue and the second priority of the other queuing queues;

[0074] In this embodiment, the device determines the first priority of the first queue and the second priority of other queues. The device can determine the priority of the queue by obtaining a pre-set priority or by caching the priority call window data of each queue in the daily operation plan.

[0075] Step S300: Based on the first priority, the second priority, and the time information, determine the queue number result of the current queue query.

[0076] In this embodiment, the device determines the queue number result of the current queue query based on the first priority, the second priority, and the time information. That is, the device considers the influencing factors of two dimensions, including the first priority of the queue assigned to the user and the second priority of other queues, as well as the time information of the current queue query, to calculate the queue number result of the current queue query. This ensures that the number of people waiting displayed on the ticket matches the actual number of people waiting, and that the difference between the user's expected queuing time and the actual queuing time is small, thereby improving the user experience.

[0077] Specifically, step S300 includes the following steps S310-S330:

[0078] Step S310: Determine the second queue whose second priority is higher than the first priority among other queues, and accumulate the number of people in the first queue of the current second queue;

[0079] In this embodiment, the device determines a second queue whose second priority is higher than the first priority among other queues, and accumulates the first queue number of people in the current second queue. For example, the queues include queue A, queue B and queue C, and the priority of the queues from largest to smallest is queue A, queue B and queue C. The first queue is queue B, then the second queue is queue A. The current queue number of people in queue A is 6, then the current first queue number of people in the second queue is 6.

[0080] Specifically, step S310 includes the following steps S311-S312:

[0081] Step S311: Compare the second priority with the first priority to obtain the comparison result;

[0082] In this embodiment, the device compares the second priority with the first priority to obtain a comparison result. That is, it compares the priority of each other queuing queue with the first queuing queue where the user is located. The comparison result includes the results of queuing queues whose second priority is higher than the first priority and the results of queuing queues whose second priority is lower than the first priority.

[0083] Step S312: The queue with the second priority higher than the first priority in the comparison results is determined as the second queue.

[0084] In this embodiment, the device determines the queue with the second priority higher than the first priority in the comparison results as the second queue. For example, the queue includes queue A, queue B and queue C, and the priority of the queues from largest to smallest is queue A, queue B and queue C. If the first queue is queue C, then the second queue includes queue A and queue B.

[0085] Step S320: Accumulate the number of people in the second queue before the time information in the first queue.

[0086] In this embodiment, the device accumulates the number of people in the first queue before the time information, that is, it accumulates the number of people in the first queue whose queuing time is before the user to obtain the number of people in the second queue.

[0087] Step S330: The number of people in the first queue and the number of people in the second queue are added together to obtain the queue number result for the current queue query.

[0088] In this embodiment, the device accumulates the number of people in the first queue and the number of people in the second queue to obtain the queue number result for the current queue query. Specifically, it accumulates the number of people in the first queue with higher priority than the user's, along with the number of people in the user's first queue whose queuing time precedes the user's. Because in related technologies, the number of people in the user queue often does not match the actual number of people waiting—often the user queue is smaller than the actual queue size—and the call-number logic prioritizes higher-priority queues, the user's expected queuing time is often much longer than the actual queuing time, leading to a decreased user experience and negative impacts such as service complaints. Therefore, this application proposes accumulating the number of people in the first queue with higher priority than the user's, along with the number of people in the user's first queue whose queuing time precedes the user's, to obtain the queue number result for the current queue query. This ensures that the actual queuing time is equal to or even higher than the user's expected queuing time. After obtaining the queue number result, the user can choose to wait or go to another offline service point based on their own situation, thus preventing the expected queuing time from being much longer than the actual queuing time, thereby improving the user experience and reducing negative impacts such as service complaints.

[0089] Specifically, this application provides three application scenarios. Scenario 1: Before taking a number, the device provides a query interface to determine which queue the customer should take based on the customer's level and the business being handled. Then, it queries the group to which the queue belongs and then calculates the total number of tickets in the group queue that is the same as or higher than the lowest priority of the specified queue.

[0090] Scenario 2: When taking a number, the device provides a number generation interface. Based on the customer's level and the business being handled, it determines which queue the customer should take a number from. Then, it queries the group to which the queue belongs, and then accumulates and calculates the number of tickets in all queues in the group that have the same or higher priority than the lowest priority of the specified queue. Finally, it generates a number ticket.

[0091] Scenario 3: After obtaining a number, the device provides a query interface to query the queue and latest position of the ticket. Then, it queries the group to which the queue belongs, and then calculates the total number of tickets in the group queue that are in a higher priority queue than the queue where the ticket is located, as well as the number of tickets in the queue with the same lowest priority that are ahead of the ticket position.

[0092] This application provides a method for calculating the number of people in a queue. Compared to related technologies where the number of people displayed on the ticket does not match the actual number of people waiting, leading to a significant difference between the user's expected and actual queuing times and a decline in user experience, this application obtains the user's first queue and the time information of the current queue query; determines the first priority of the first queue and the second priority of other queues; and determines the number of people in the current queue query based on the first priority, the second priority, and the time information. In other words, this application considers two dimensions of influencing factors—the first priority of the user's assigned queue and the second priority of other queues, as well as the time information of the current queue query—to calculate the number of people in the current queue query. This ensures that the number of people displayed on the ticket matches the actual number of people waiting, minimizing the difference between the user's expected and actual queuing times, thereby improving user experience.

[0093] Based on the first embodiment described above, this application also provides another embodiment, wherein the method for calculating the number of people in the queue includes the following steps A100-A500:

[0094] Step A100: Based on the identity information, the users are grouped to obtain the target group;

[0095] In this embodiment, the user information includes business information and identity information. Identity information includes ordinary customers, VIP customers, and special group customers. Different businesses or identities have different priorities for business processing, which affects the queue order. Therefore, the device groups users based on the identity information to obtain target groups. These target groups include, but are not limited to, VIP groups, ordinary customer groups, and special group groups. Specifically, refer to... Figure 4 The target groups include VIP groups and regular customer groups. Each group includes several queues, and each queue contains a certain number of people. Each group has a different priority, and a fixed window corresponds to the corresponding group. For example, refer to... Figure 4Window 1 handles the business for the VIP group queue (A), while windows 2 and 3 handle the business for the regular customer groups queues (B, C, Z). It's important to understand that the fixed window corresponding to the specific group is determined by business logic. Normally, the window responsible for the VIP group only handles VIP business, and the windows responsible for the regular customer group only handle regular customer business. However, in special circumstances, such as when there are few people in the VIP group queue and the VIP window is idle, but there are many people in the regular customer group queue, the business logic will change accordingly. This will redirect the business for the regular customer group to the VIP window. However, this change in business logic usually does not affect the current queue length query result, but it can affect the current queue time. This ensures that the difference between the user's expected queue time and the actual queue time is small, or even that the actual queue time is longer than the user's expected queue time, thereby improving the user experience.

[0096] Step A200: Based on the business information, assign the user's ranking to the first queue under the target group;

[0097] In this embodiment, the business information refers to the relevant information of the business that the user needs to handle, including but not limited to account opening business, cash business, and non-cash business. Based on the business information, the device assigns the user's order to the first queue under the target group, that is, each queue corresponds to a corresponding business, and each business has a different priority.

[0098] Step A300: Determine the second queue with a higher priority than the first priority among the other queues under the target group, and accumulate the number of people in the first queue of the current second queue;

[0099] In this embodiment, the device determines the second queue with a higher priority than the first priority among other queues under the target group, and accumulates the first queue number of people in the current second queue. The device only considers the priority of other queues under the target group and the first queue, without considering queues in other groups.

[0100] Specifically, step A300 includes the following steps A310-A330:

[0101] Step A310: Determine the second priority of each other queue under the target group;

[0102] In this embodiment, the device determines the second priority of each other queue under the target group, that is, the device only considers the priority of other queues under the target group and the first queue, without considering queues of other groups.

[0103] Step A320: Compare the second priority with the first priority to obtain the comparison result;

[0104] In this embodiment, the device compares the second priority with the first priority to obtain a comparison result. That is, it compares the priority of each other queue under the target group with the first queue where the user is located. The comparison result includes the results of queues with the second priority higher than the first priority and the results of queues with the second priority lower than the first priority.

[0105] Step A330: The queue with the second priority higher than the first priority in the comparison results is identified as the second queue.

[0106] In this embodiment, the device determines the queue with the second priority higher than the first priority in the comparison results as the second queue. For example, the queue includes queue A, queue B and queue C, and the priority of the queues from largest to smallest is queue A, queue B and queue C. If the first queue is queue C, then the second queue includes queue A and queue B.

[0107] Step A400: Accumulate the number of people in the second queue before the time information in the first queue.

[0108] In this embodiment, the above step S320 is referred to, and will not be repeated here.

[0109] Step A500: Add the first queue number and the second queue number together to obtain the queue number result for the current queue query.

[0110] In this embodiment, the above step S330 is referred to, and will not be repeated here.

[0111] In this embodiment, this application proposes a scheme for calculating the number of people waiting in groups. First, all queues are grouped, and then, based on the operation plan (the window's calling logic design), the number of people waiting in queues according to customer level or the selected queue number can be estimated before, during, and after taking a number.

[0112] Based on the first and second embodiments described above, this application also provides another embodiment, wherein the method for calculating the number of people in the queue includes:

[0113] After step S300, which determines the queue size result of the current queue query based on the first priority and the time information, the method includes the following steps B100-B200:

[0114] Step B100: Based on the queue number results, determine the service queuing scheme;

[0115] In this embodiment, the device determines a service call scheme based on the queue number result. Specifically, the queue number result represents the current number of people in the queue. Based on the queue number result, the device also considers the number of people in each queue and the number of people in each queue under each group to determine the service call scheme. The service call scheme includes a first service call scheme (under normal circumstances), which means that the high-priority queue numbers are called first, then the numbers before the time sequence of the current queue are called, and then the numbers of the low-priority queues are called. It also includes a second service call scheme (under special circumstances), which means that when there are few people in the VIP group / or ordinary customer group and the responsible window of the VIP group / or ordinary customer group is idle, but there are many people in the ordinary customer group / or VIP group, the business logic will be changed accordingly to redirect the business of the ordinary customer group / or VIP group to the responsible window of the VIP group / or ordinary customer group.

[0116] Step B200: Calculate the queuing time of the current queue based on the queue size and the service queuing scheme.

[0117] In this embodiment, the device calculates the queuing time of the current queue based on the queue number result and the service queuing scheme. Specifically, the device can calculate the queuing time based on factors such as the number of windows, the number of queues, the service processing time, and the current queue number. The service processing time can be determined by taking the highest processing time from historical service processing time information for each service, thus ensuring that the actual queuing time is equal to or even higher than the user's expected queuing time. This prevents the expected queuing time from being significantly higher than the actual queuing time, thereby improving user experience and reducing negative impacts such as service complaints. This application proposes adding feedback on the queuing time based on the queue number result, ensuring that the actual queuing time is equal to or even higher than the user's expected queuing time. After checking the queue number result, users can choose to wait or go to another offline service outlet based on their own situation, thus preventing the expected queuing time from significantly higher than the actual queuing time, thereby improving user experience and reducing negative impacts such as service complaints.

[0118] This application also provides a queue length calculation device, referring to... Figure 3 The queue length counting device includes:

[0119] Module 10 is used to obtain the user's first queue and the time information of the current queue query;

[0120] The determining module 20 is used to determine the first priority of the first queuing queue and the second priority of other queuing queues;

[0121] The calculation module 30 is used to determine the number of people queuing for the current queue query based on the first priority, the second priority and the time information.

[0122] Optionally, the computing module 30 includes:

[0123] The first accumulation module is used to determine the second queue whose second priority is higher than the first priority among other queues, and to accumulate the first queue number of people in the current second queue.

[0124] The second accumulation module is used to accumulate the number of people in the second queue before the time information in the first queue.

[0125] The first cumulative calculation module is used to accumulate the number of people in the first queue and the number of people in the second queue to obtain the queue number result of the current queue query.

[0126] Optionally, the acquisition module 10 includes:

[0127] The information acquisition module is used to acquire user information and the current time information of the queue query;

[0128] The allocation module is used to allocate the user's order to the first queue based on the user information.

[0129] Optionally, the allocation module includes:

[0130] The grouping module is used to group users based on the identity information to obtain target groups;

[0131] The queue allocation module is used to allocate the user's order to the first queue under the target group based on the business information.

[0132] Optionally, the computing module 30 includes:

[0133] The third accumulation module is used to determine the second queue with a higher priority than the first priority among other queues under the target group, and to accumulate the first queue number of people in the current second queue.

[0134] The fourth accumulation module is used to accumulate the number of people in the second queue before the time information in the first queue.

[0135] The second cumulative calculation module is used to accumulate the number of people in the first queue and the number of people in the second queue to obtain the queue number result of the current queue query.

[0136] Optionally, the third accumulation module includes:

[0137] The priority determination module is used to determine the second priority of each other queue under the target group;

[0138] The comparison module is used to compare the second priority with the first priority to obtain the comparison result;

[0139] The queue determination module is used to determine the queue with the second priority higher than the first priority in the comparison results as the second queue.

[0140] Optionally, the method for calculating the number of people in the queue further includes:

[0141] The queuing scheme determination module is used to determine the business queuing scheme based on the queue number result;

[0142] The queuing time calculation module is used to calculate the queuing time of the current queue based on the number of people in the queue and the service call scheme.

[0143] The specific implementation of the queue number calculation device in this application is basically the same as the various embodiments of the queue number calculation method described above, and will not be repeated here.

[0144] Reference Figure 1 , Figure 1 This is a schematic diagram of the terminal structure of the hardware operating environment involved in the embodiments of this application.

[0145] like Figure 1 As shown, the terminal may include: a processor 1001, such as a CPU; a network interface 1004; a user interface 1003; a memory 1005; and a communication bus 1002. The communication bus 1002 is used to enable communication between these components. The user interface 1003 may include a display screen and an input unit such as a keyboard. Optionally, the user interface 1003 may also include a standard wired interface or a wireless interface. The network interface 1004 may optionally include a standard wired interface or a wireless interface (such as a Wi-Fi interface). The memory 1005 may be high-speed RAM or non-volatile memory, such as a disk drive. Optionally, the memory 1005 may also be a storage device independent of the aforementioned processor 1001.

[0146] Optionally, the queue counting device may also include a rectangular user interface, a network interface, a camera, RF (Radio Frequency) circuitry, sensors, audio circuitry, a WiFi module, etc. The rectangular user interface may include a display screen and an input submodule such as a keyboard. Optionally, the rectangular user interface may also include a standard wired interface or a wireless interface. The network interface may optionally include a standard wired interface or a wireless interface (such as a Wi-Fi interface).

[0147] Those skilled in the art will understand that Figure 1 The structure of the queue counting device shown does not constitute a limitation on the queue counting device, and may include more or fewer components than shown, or combine certain components, or have different component arrangements.

[0148] like Figure 1 As shown, the memory 1005, serving as a storage medium, may include an operating system, a network communication module, and a queue counting program. The operating system is a program that manages and controls the hardware and software resources of the queue counting device, supporting the operation of the queue counting program and other software and / or programs. The network communication module is used to enable communication between the various components within the memory 1005, as well as communication with other hardware and software in the queue counting system.

[0149] exist Figure 1 In the queue number calculation device shown, the processor 1001 is used to execute the queue number calculation program stored in the memory 1005 to implement the steps of the queue number calculation method described above.

[0150] The specific implementation of the queue number calculation device in this application is basically the same as the various embodiments of the queue number calculation method described above, and will not be repeated here.

[0151] This application also provides a storage medium storing a program that implements a method for calculating the number of people in a queue. The program for calculating the number of people in a queue is executed by a processor to implement the following method for calculating the number of people in a queue:

[0152] Retrieve the user's first queue and the time information of the current queue query;

[0153] Determine the first priority of the first queue and the second priority of the other queues;

[0154] Based on the first priority, the second priority, and the time information, the queue number result for the current queue query is determined.

[0155] Optionally, the step of determining the queue size result of the current queue query based on the first priority, the second priority, and the time information includes:

[0156] Identify the second queue whose second priority is higher than the first priority among other queues, and accumulate the number of people in the first queue of the current second queue;

[0157] Accumulate the number of people in the second queue before the time information in the first queue;

[0158] The number of people in the first queue and the number of people in the second queue are added together to obtain the number of people in the queue for the current queue query.

[0159] Optionally, the step of obtaining the user's first queue and the time information of the current queue query includes:

[0160] Retrieve user information and the current time information of the queue query;

[0161] Based on the user information, the user's ranking is assigned to the first queue.

[0162] Optionally, the user information includes business information and identity information, and the step of assigning the user to the first queuing queue based on the user information includes:

[0163] Based on the identity information, users are grouped to obtain target groups;

[0164] Based on the business information, the user's ranking is assigned to the first queue under the target group.

[0165] Optionally, the step of determining the queue size result of the current queue query based on the first priority, the second priority, and the time information includes:

[0166] Identify the second queue with a higher priority than the first priority among other queues under the target group, and accumulate the number of people in the first queue of the current second queue;

[0167] Accumulate the number of people in the second queue before the time information in the first queue;

[0168] The number of people in the first queue and the number of people in the second queue are added together to obtain the number of people in the queue for the current queue query.

[0169] Optionally, the step of determining the second queue with a higher priority than the first priority among other queues under the target group includes:

[0170] Determine the second priority of each other queue under the target group;

[0171] The second priority is compared with the first priority to obtain the comparison result;

[0172] The queue with the second priority higher than the first priority in the comparison results is identified as the second queue.

[0173] Optionally, after the step of determining the queue size result of the current queue query based on the first priority and the time information, the method includes:

[0174] Based on the queue length results, a service queuing scheme is determined;

[0175] Based on the queue size and the service call number scheme, calculate the current queue time.

[0176] The specific implementation of the storage medium in this application is basically the same as the embodiments of the above-described queue number calculation method, and will not be repeated here.

[0177] This application also provides a computer program product, including a computer program that, when executed by a processor, implements the steps of the above-described method for calculating the number of people in a queue.

[0178] The specific implementation of the computer program product in this application is basically the same as the various embodiments of the above-mentioned queue number calculation method, and will not be repeated here.

[0179] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Unless otherwise specified, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes that element.

[0180] The sequence numbers of the embodiments in this application are for descriptive purposes only and do not represent the superiority or inferiority of the embodiments.

[0181] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) as described above, and includes several instructions to cause a terminal device (which may be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in the various embodiments of this application.

[0182] The above are merely preferred embodiments of this application and do not limit the patent scope of this application. Any equivalent structural or procedural transformations made using the content of this application's specification and drawings, or direct or indirect applications in other related technical fields, are similarly included within the patent protection scope of this application.

Claims

1. A method for calculating the number of people in a queue, characterized in that, The method for calculating the number of people in the queue includes: Retrieve the user's first queue and the time information of the current queue query; Determine the first priority of the first queue and the second priority of the other queues; Based on the first priority, the second priority, and the time information, the queue number result for the current queue query is determined; The step of determining the queue number result of the current queue query based on the first priority, the second priority, and the time information includes: Identify the second queue whose second priority is higher than the first priority among other queues, and accumulate the number of people in the first queue of the current second queue; Accumulate the number of people in the second queue before the time information in the first queue; The number of people in the first queue and the number of people in the second queue are added together to obtain the number of people in the queue for the current queue query.

2. The method for calculating the number of people in a queue as described in claim 1, characterized in that, The step of obtaining the user's first queue and the time information of the current queue query includes: Retrieve user information and the current time information of the queue query; Based on the user information, the user's ranking is assigned to the first queue.

3. The method for calculating the number of people in a queue as described in claim 2, characterized in that, The user information includes business information and identity information. The step of assigning users to the first queue based on the user information includes: Based on the identity information, users are grouped to obtain target groups; Based on the business information, the user's ranking is assigned to the first queue under the target group.

4. The method for calculating the number of people in a queue as described in claim 3, characterized in that, The step of determining the queue number result of the current queue query based on the first priority, the second priority, and the time information includes: Identify the second queue with a higher priority than the first priority among other queues under the target group, and accumulate the number of people in the first queue of the current second queue; Accumulate the number of people in the second queue before the time information in the first queue; The number of people in the first queue and the number of people in the second queue are added together to obtain the number of people in the queue for the current queue query.

5. The method for calculating the number of people in a queue as described in claim 4, characterized in that, The step of determining the second queue with a higher priority than the first priority among other queues under the target group includes: Determine the second priority of each other queue under the target group; The second priority is compared with the first priority to obtain the comparison result; The queue with the second priority higher than the first priority in the comparison results is identified as the second queue.

6. The method for calculating the number of people in a queue as described in claim 1, characterized in that, After the step of determining the queue size result of the current queue query based on the first priority and the time information, the method includes: Based on the queue length results, a service queuing scheme is determined; Based on the queue size and the service call number scheme, calculate the current queue time.

7. A device for calculating the number of people in a queue, characterized in that, The queue length calculation device includes: The acquisition module is used to obtain the user's first queue and the time information of the current queue query; A determination module is used to determine the first priority of the first queuing queue and the second priority of other queuing queues; The calculation module is used to determine the queue number result of the current queue query based on the first priority, the second priority and the time information; The calculation module is used to implement: Identify the second queue whose second priority is higher than the first priority among other queues, and accumulate the number of people in the first queue of the current second queue; Accumulate the number of people in the second queue before the time information in the first queue; The number of people in the first queue and the number of people in the second queue are added together to obtain the number of people in the queue for the current queue query.

8. A queue length counting device, characterized in that, The queue length calculation device includes: a memory, a processor, and a program stored in the memory for implementing the queue length calculation method. The memory is used to store the program that implements the method for calculating the number of people in the queue; The processor is configured to execute a program that implements the queue number calculation method to implement the steps of the queue number calculation method as described in any one of claims 1 to 6.

9. A storage medium, characterized in that, The storage medium stores a program for implementing a method for calculating the number of people in a queue, which is executed by a processor to implement the steps of the method for calculating the number of people in a queue as described in any one of claims 1 to 6.

Images