CN102270363B - Intelligent queuing system - Google Patents
Intelligent queuing system Download PDFInfo
- Publication number
- CN102270363B CN102270363B CN201110072900.3A CN201110072900A CN102270363B CN 102270363 B CN102270363 B CN 102270363B CN 201110072900 A CN201110072900 A CN 201110072900A CN 102270363 B CN102270363 B CN 102270363B
- Authority
- CN
- China
- Prior art keywords
- queue number
- time
- queue
- client
- search
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000012790 confirmation Methods 0.000 claims description 24
- 238000000034 method Methods 0.000 claims description 18
- 238000013459 approach Methods 0.000 claims description 12
- 230000006870 function Effects 0.000 claims description 10
- 230000005055 memory storage Effects 0.000 claims description 7
- 238000009499 grossing Methods 0.000 claims description 6
- 238000000611 regression analysis Methods 0.000 claims description 3
- PEDCQBHIVMGVHV-UHFFFAOYSA-N Glycerine Chemical compound OCC(O)CO PEDCQBHIVMGVHV-UHFFFAOYSA-N 0.000 claims description 2
- 230000007547 defect Effects 0.000 abstract description 4
- 238000005516 engineering process Methods 0.000 abstract description 4
- 230000008878 coupling Effects 0.000 abstract description 3
- 238000010168 coupling process Methods 0.000 abstract description 3
- 238000005859 coupling reaction Methods 0.000 abstract description 3
- 238000004891 communication Methods 0.000 description 10
- 238000010586 diagram Methods 0.000 description 6
- 230000002452 interceptive effect Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 230000008859 change Effects 0.000 description 3
- 230000006855 networking Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 241000931705 Cicada Species 0.000 description 1
- 206010011469 Crying Diseases 0.000 description 1
- 239000003086 colorant Substances 0.000 description 1
- 238000010219 correlation analysis Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000001131 transforming effect Effects 0.000 description 1
Landscapes
- Telephonic Communication Services (AREA)
Abstract
The invention discloses an intelligent queuing system. The system comprises a client terminal, a storage device and a controller; the controller is used for distributing a queuing number according to application information of the client terminal; the storage device is used for storing queuing information; and the system is characterized in that: the controller can discontinuously distribute the queuing number according to the application information of the client terminal, wherein each distributed queuing number corresponds to a specific time period or a time point. The system has the advantages that: the defect that only continuous queuing number is distributed in the conventional queuing system is overcome, so that the coupling degree of number taking time and the queuing number, and the number taking time and the service time is reduced, and great convenience is brought to a client to choose the queuing number which meets the schedule of the client; and the conventional mature mobile positioning technology is applied to the queuing field, so that convenience is brought to the client, the vacant number is eliminated, the service efficiency of a service desk is improved and a queuing system that a number is taken remotely is more practical.
Description
Affiliated technical field
The present invention relates to a kind of intelligent queue system.
Background technology
Traditional services rule is the queuing system of wait system, and information desk selects client to serve following four kinds of rules: 1, First Come First Served.2, rear to first service.3, Random Service.4, priority service.
The scheme of application number 200710091280.1 and 200810002494.1, queue number closes on while taking turns to does a confirmation, and the device of calling out the numbers is only called out the numbers to the queue number of confirming, spacing rate is reduced greatly, is also that queuing strategy queuing system increases practicality more flexibly.
The scheme of application number 200810098938.6, the queuing system networking of multiple business websites, queuing system is that client chooses and meets the business hall of customer demand most and distribute queue number, makes client have the more leeway of more options.
But existing also do not have one can meet client in the number of getting of ranking of a certain special time, and after another special time in go to handle the system of the required service of client.Here for the example running in practice and draw problem: client is with regard to the free queue number A20 that obtained of 12 noon, wherein " A " can regard queue identity as, " 20 " can regard sequence number as (for convenience of description, this programme is using the sequence number of queue number as queue number, as " queue number 20 " represents the queue number that a certain queue sequence number is 20), at 4 in afternoon is free handles the required service of client, but according to the queuing system of existing First Come First Served, generally can about 2 thirty, take turns to called number at 12 near the queue number A20 getting client office, do not do required service and at this moment client is busy.This is because the queuing system of First Come First Served at present has a defect of turning a blind eye to: within the specific time, get the queue number of a specific queue, this queue number is unique fixing can not changing so, be that queue number output is continuous, exporting the previous queue number of a certain queue queue when queuing system is N, and the next queue number that queuing system is exported this queue must be N+1.The time of the namely number of getting and the queue number of distribution, tight with the time that the takes turns to coupling of the queue number distributing.But existing queuing system cannot realize a certain queue of output, previous queue number is N, and the next queue number that queuing system is exported this queue can be N+1, but can export discrete queue number.
Some queuing systems adopt the mode of subscription time point or subscription time section to solve the problem in above-mentioned giving an example, but adopt the mode of subscription time point, and the resource of businessman will be that a client is special, inapplicable in most of occasions, fair and just not; The scheme of the mode of employing subscription time section as described in application number 200810111714.4 remote query-reservation type queuing machines and remote query-reservation queuing method, when multiple clients preengage the same time period, multiple clients can interact, and the user of a upper time period of reservation also can affect and preengages the user of next time period and take turns to the time, pre-like this in special time period the user of transacting business, the time that takes turns to also becomes can not cicada, so adopt the mode effect of subscription time section also not good.
Summary of the invention
The present invention solves the technological deficiency of above-mentioned queuing system, provide a kind of can discontinuous output queue number and avoid crying the queuing system of spacing, the queue number that this system can distribute client more to need, this queue number time that takes turns to more meets client's schedule.
For achieving the above object, intelligent queue system of the present invention, comprise client terminal, memory storage and controller, described controller is for distributing queue number according to the application information of client terminal, and memory storage is for storage queue information, and queuing message comprises pre-confirmation queue, it is characterized in that, described controller can be according to the application information of client terminal, discontinuous distribution queue number, the corresponding specific time period of each queue number or the time point that distribute.The queue number that described controller distributes can be N+i, and described N refers to the previous queue number of a certain queue of system output, and i refers to random natural number and N+i >=1 except zero, that is to say that the queue number of system output can be discrete.Client can select according to the arrangement of time of oneself queue number of institute correspondence time period or time point.
Due to the discontinuous output queue number of queuing system, facilitate client, also provide more operation random to client, easily cause the generation of spacing, the therefore eliminating of spacing, just becomes technical characterictic crucial in queuing system of the present invention.
Obvious progress of the present invention is, overcome traditional queuing system and can only distribute the defect of continuous queue number, the degree of coupling that makes the number of getting time and queue number and queue number take turns to the time reduces, and the queue number that more meets own schedule for customer selecting provides great convenience; Existing, ripe mobile positioning technique is applied to queuing field, has both facilitated client, rejected again spacing, improved the efficiency of service of information desk, also make the queuing system of remote number obtaining become more practical.
Brief description of the drawings
Fig. 1 is the structural representation of the embodiment of the present invention one.
Fig. 2 is interactive interface (the being touch-screen) schematic diagram of client terminal in the invention process one.
Fig. 3 is that client terminal sends the processing flow chart after application information.
Fig. 4 is another interactive interface schematic diagram of client terminal in the embodiment of the present invention one, and the changeable demonstration of Fig. 2.
Fig. 5 is the whether schematic diagram at the scene of location client of the embodiment of the present invention one.
Fig. 6 is the processing flow chart of a kind of special case of Fig. 3.
Embodiment
Below the specific embodiment of the present invention is done to describe more specifically.Should be noted that following description is in order more to clearly demonstrate the present invention, is not in order to limit the present invention.
As shown in Figure 1, queuing system of the present invention, comprise that client terminal (is necessary?), memory storage and controller, controller distributes queue number according to the application information of client terminal, memory storage is for storage queue information, it is characterized in that, controller can be according to the application information of client terminal, discontinuous distribution queue number; The corresponding specific time period of each queue number or the time point that distribute.
In described controller, be provided with predicting unit, described predicting unit is used for predicting the corresponding called number time of queue number.
The present invention also comprises confirmation device, and described confirmation device is connected with controller; The concrete confirmation method of described confirmation device is described in 200810002494.1.When near on-the-spot information desk of client, within the confirmation time period of queue number, by confirming that device confirms queue number, the queue number of confirming enters pre-confirmation queue.
Described customer service terminal can be mobile phone or queue machine or internet; The application information of described client terminal comprises cell-phone number, queuing system is preserved the related information of queue number and cell-phone number, and close on while taking turns to mobile phone located at this queue number, if this mobile phone location in the on-the-spot distance range allowing of information desk, this queue number enters pre-confirmation queue.
If described client terminal is mobile phone, application information comprises the cell-phone number that sends application information; If when described client terminal is queue machine or other internet terminal, when client inputs application information, can input handset number, queuing system sends identifying code to this mobile phone, client inputs described identifying code at client terminal, and the application information that client terminal sends comprises cell-phone number and described identifying code.
The present invention also comprises the equipment of calling out the numbers, and the described equipment and control device of calling out the numbers connects; The described equipment of calling out the numbers only to through pre-that confirm, confirm that the queue number in queue calls out the numbers in advance.Confirm client that the queue number in queue is corresponding at the scene because of pre-, thereby overcome the defect of being spacing.
Due to the called number time of the corresponding prediction of each queue number in system of the present invention, therefore client can be according to the time of oneself, selects assignable queue number (queue number being not yet assigned with).If the time that the application information of client's input comprises the service of acceptance, controller can offer the some queue numbers of client for customer selecting by customer service terminal, and described some queue numbers are the queue number that the time that predict by predicting unit and acceptance service client's input is consistent or be close.
In order to ensure the validity of the obtained queue number of the number of getting user, be also assigned a corresponding identifying code to each queue number simultaneously.
In order to facilitate client, can multiple business halls be set in many places, be distributed in the queuing system networking of multiple business halls.When the controller in queuing system of the present invention is searched when meeting the queue number of application information in a queue, controller is searched queue number from the queue of the same type of other business halls, and a queue number for the business hall being consistent with application information is distributed to this application.
The corresponding queue number series in each business hall, in the time having multiple business hall, can corresponding multiple queue number series.
In same queue, the prediction that the prediction time of taking turns to of queue number N+1 is greater than queue number N takes turns to the time.
The prediction of the described queue number time that takes turns to is predicted by predicting unit.Before queuing system output queue number, predicting unit dopes taking turns to the time of each queue number on the same day by queue historical data.Queuing system, in the process of work, according to the Zero queuing situation on the same day, refreshes predicted data in real time.Thereby dwindle in real time the error that error that predicted time and active service time produces and spacing cause.If the larger error of the generation service time of prediction when the up-to-date predicted time of the queue number having distributed and client's number of getting; If by the mobile phone remote number of getting, controller by Short Message Service Gateway photos and sending messages to client terminal, prompting client; If by the scene number of getting, just send information by LED display at the scene.
If deviation appears in prediction, or to change appear in client's schedule itself, and client can change queue number forward or backward by client terminal application, and controller can be that the new queue number of distribution is applied in this time, former queue number state by inseparable distribution transforming for distributing.The rule changing is: if the former queue number of this client is N, client application pushes away front or postpones No. K, if queue number N+K place can distribution state, this client applies for successfully, and queue number N+K distributes to this client, and queue number N discharges, in can distribution state.If N+K is in can not distribution state, the nearest and assignable queue number of system search and N+K, and to client's feedback, further confirm to client.K is 0 integer, and being greater than at 0 o'clock is to postpone, and being less than at 0 o'clock is before pushing away.Or the rule of change is: client re-enters the application information containing service time by client terminal.
Before queue number takes turns to the time, arrive information desk for convenience of client, close on while taking turns at queue number, system is reminded client by note or phone in advance.
Known by above description, queue number of the present invention is not only the sequence number of queue, be also a kind of similar bus ticket, can allow that client chooses and can apply for also can rollback resource.For avoiding arbitrarily, the malice number of getting causes predicting unit prediction deviation, the higher limit of setting queue number to each queue, the historical maximal value that this higher limit is this queue; If comprise the queue number information larger than higher limit in the application information of client terminal, this application is invalid; Complete when number resource consumption, be 1 to increase progressively higher limit, increase resource by step-length.In historical record, the maximum queue number of this queue is 300, only has when 300 complete with interior number resource consumption, just can get be greater than 300 number.2 kinds of the situations that number resource consumption is complete, the one, all distribute for all numbers, the 2nd, call out the numbers and arrive higher limit.
Embodiment mono-
Fig. 1 is the structural representation of the embodiment of the present invention one, and native system is deployed near information desk scene, conventionally in business hall.The connected mode of the each parts of native system is as follows: controller is connected communication with each window in services sites by netting twine by services sites communication interface, controller is connected communication with LED equipment by network, controller is connected communication with the equipment of calling out the numbers by tone frequency channel wire, controller is connected communication with printer by USB mouth, controller is connected by computer internal data line with storage unit, controller is connected communication with confirmation device by USB mouth, and controller is connected communication with client terminal by USB mouth, VGA mouth.Wherein client terminal is to touch device display screen, and interface layout, as shown in Fig. 2 or Fig. 4, confirms that device also can belong to client terminal, but because confirming that device is not touching on device display, so independent parts as shown in Figure 1.System also comprises Short Message Service Gateway, and is connected with controller, while taking turns to for closing on when queue number, by SMS notification client.
Controller comprises predicting unit, for by analysis of history data, predicts taking turns to the time of each queue number.In the time that historical data is less, adopt exponential smoothing or regression analysis (statistical Forecasting Methodology) to predict that respectively the prediction of each queue number on the same day takes turns to the time; In the time that historical data is more, the prediction that adopts relevant function method to analyze each queue number on the same day takes turns to the time.
The fundamental formular of exponential smoothing is:
St＝ayt+(1-a)St-1
In formula, the prediction of St-queue number on same day N takes turns to the time, i.e. the smooth value of time t, i.e. pretest value;
The actual value of Yt--time t;
The actual value of St-1--time t-1;
A--smoothing constant, its span is [0,1];
For the same day, the prediction of queue number N took turns to the time, was the function that the prediction of the queue number N of yesterday takes turns to the time, yesterday be the function of the day before yesterday, by that analogy, the actual wheel that the prediction time of taking turns to of first day is got first day is to the time.
Auto-regressive analysis, sets up prediction according to the rule of the time that takes turns in the past of queue number N and took turns to the model of time the same day, Here it is autoregressive model,
Formula as: Yt=(Yt-1, Yt-2 ...),
In formula, Yt is that the prediction of queue number N on the same day takes turns to the time;
Yt-1 be the previous day queue number N actual wheel to the time;
Yt-2 be more the previous day queue number N actual wheel to the time.
F is function, the same day queue number N the prediction time of taking turns to be in the past queue number N actual wheel to the functional value of time.
Correlation analysis, using the date on the same day what day belongs to, the attribute such as red-letter day, which, which number, weather condition is as analyzing foundation the moon, before system assignment queue number, with the highest data of a day of correlativity on the same day as the predicted value of working as day data; And, when system operation is after several hours, can also be according to the data of the actual motion on the same day, choose the data of a day the highest with history dependence as predicting the outcome according to revising.
In Fig. 2, the touch-screen display left side is queue lists, has 2 queues in diagram, is respectively: ordinary individual's service queue and VIP client's service queue; Ordinary individual's service queue has 2 input frames, is respectively used to put or queue number input time; VIP client's service queue has 4 input frames, is respectively used to put or queue number input time.Input equipment is soft keyboard or keyboard in kind, and time point or time period all can be accurate to second, and time and queue number all allow full dose input and increment input, can select as required to arrange.Time increment input, taking current time as base unit weight; The input of queue number increment, taking the current maximum queue number of just accepting service as base unit weight.When client touches click " application of ordinary individual's business " or " application of VIP client's business ", controller receives the application condition in application information, by application condition search and distribute assignable queue number.Wherein time and queue number are while input, are that this application distributes assignable queue number minimum in corresponding queue; Time and queue number condition alternative can not be filled out simultaneously, and in the time of time or an input of queue number input frame selection, treatment scheme as shown in Figure 3.
Touch-screen display the right is the relevant information of corresponding left side queue, and what wherein the first row showed is current time and the current queue number taking turns to.What the second row showed is the average used time of each queue number of the same day and yesterday, and the average used time on the described same day is the average service time of each queue number on the same day, is conventionally denoted as 1/ μ, and μ is the serviced client's number of energy in the unit interval; Described yesterday average used time algorithm in like manner.If the starting stage of system operation on the same day, without average used time index on the same day, client can be with reference to the average used time of yesterday.The third line and fourth line are assignable queue numbers, and fifth line is to skip to show assignable queue number; The third line, four lines and the five-element are all touch buttons.Client can pass through current queue number and average service time, oneself estimates the schedule which queue number meets oneself, then directly touches a queue number of clicking in the third line or fourth line, and system is exported this queue number.The 6th to ten row and first to fifth line in like manner.
The concrete operation flow of Fig. 3 is as follows:
Step S301, searches queue number by the condition in application information; If application information comprises time point, search the distributed queue number that the prediction time of taking turns to equals described time point; If application information comprises the time period, search prediction and take turns to the distributed queue number of time within the described time period; If application information comprises queue number, search queue number and equal the distributed queue number of described queue number; If application information comprises queue number section, search the distributed queue number of queue number in described queue number section;
Step S302, if search at least one queue number, enters step S303, if search less than, enter step S304;
Step S303, is that this application distributes a queue number, and exports this queue number information by client terminal, qualifiedly has multiplely if having, and selects at random one; This applies for finishing.
Step S304, searches the distributed queue number that closes on application information conditional most; If application information comprises time point, search the distributed queue number that the prediction time that takes turns to approaches described time point most; If application information comprises the time period, search initial time or the distributed queue number of end time that the prediction time that takes turns to approaches the described time period most; If application information comprises queue number, search queue number and approach most the distributed queue number of described queue number; If application information comprises queue number section, search queue number approach most described queue number section starting symbol or finish number distributed queue number; This step must search at least one qualified queue number that distributes; It is qualified that to distribute queue number to have multiple, as: in application information, queue number is 90, searches to close on assignable queue number most and be respectively 89 and 91.
Step S305 is the determining step of permissible error whether, while representing to search by the condition in application information, searches and takes turns to time or queue number less than the prediction of the queue number closing on most, whether permissible error of customer selecting.If permissible error, enters step S306; If not permissible error, enters step S307.
Step S306 is the scope of the error set of client; While representing to search by the condition in application information, if the queue number searching out is in the error range of setting, enter step S303.If not, enter step S307.
Step S307, is that described queue number information of closing on is most sent to client terminal, feeds back to client, expects that client confirms.
The confirmation of the selectable queue number information that step S308 is client to feedback, if client a queue number in the selectable queue number information of feedback is confirmed, represent that client replys agreement by client terminal and accepts this queue number, enter step S303; If controller is not received confirmation within the scope of official hour, or receive dissenting reply, this application finishes.
Shown in Fig. 4, being the interactive interface schematic diagram of the client terminal of the present embodiment, compared with Fig. 2, is the interactive interface of the client terminal of different-style, can switch by setting.Left side function is identical with the left side of Fig. 2; The right is queue number list, can distribute from indistributable queue number and represent with different patterns respectively, in practical application, preferably represents with different colours, in figure, represent with different fonts, lishu represents to distribute, and black matrix represents to distribute, and each queue number has taking turns to the time of predicting unit prediction.
Fig. 5 is that the present invention confirms the whether schematic diagram (being Mobile Location Technology) of embodiment at the scene of client.Gsm communication system comprises base station sub-system BSS and network subsystem NSS, and network subsystem NSS comprises mobile services switching centre MSC and homing user position register HLR, calling party location register VLR.Mobile phone is constantly tested the pilot signal of peripheral base station, and reports gsm communication system, and MSC also upgrades calling party location register VLR part data according to its up-to-date reporting information request of obtaining.When queuing system need to judge that user is whether at the scene time, queuing system sends phone number to gsm communication system and does location application, MSC is according to base station pilot signals that in cell-phone number and calling party location register VLR, mobile phone reports, calculate the geographic position of mobile phone, and return the geographic position of mobile phone to queuing system.Queuing system is made comparisons the geographic position of this geographic position and business hall, if distance is in 200 meters, judges client at the scene, and this queue number effectively and enter pre-service queue.The geographic position of business hall can be kept in memory storage in advance.Mobile Location Technology is prior art.
The concrete operation flow of Fig. 6 is as follows:
This flow process is the special case of flow process shown in Fig. 3, is permissible error not, and feeds back to client and need the queue number that client confirms to only have the situation of.
Step S601, accurately searches queue number by the condition in application information; If application information comprises time point, search the distributed queue number that the prediction time of taking turns to equals described time point; If application information comprises the time period, search prediction and take turns to the distributed queue number of time within the described time period; If application information comprises queue number, search queue number and equal the distributed queue number of described queue number; If application information comprises queue number section, search the distributed queue number of queue number in described queue number section;
Step S602, if search at least one queue number, enters step S603, if search less than, enter step S604;
Step S603, is that this application distributes a queue number, and exports this queue number information by client terminal, qualifiedly has multiplely if having, and selects at random one; This applies for finishing.
Step S604, searches the distributed queue number that closes on application information conditional most; If application information comprises time point, search the distributed queue number that the prediction time that takes turns to approaches described time point most; If application information comprises queue number, search queue number and approach most the distributed queue number of described queue number; This step must search at least one qualified queue number that distributes; There are multiple queue numbers that distribute if qualified, select at random one; As: in application information, queue number is 90, searches to close on assignable queue number most and be respectively 89 and 91, optional one.
Step S605, is that this queue number information is sent to client terminal, feeds back to client, expects that client confirms.
The confirmation of the selectable queue number information that step S606 is client to feedback, if client a queue number in the selectable queue number information of feedback is confirmed, represent that client replys agreement by client terminal and accepts this queue number, enter step S603; If controller is not received confirmation within the scope of official hour, or receive dissenting reply, this application finishes.
Claims (4)
1. an intelligent queuing method, the method has been used and has comprised client terminal, the queuing system of memory storage and controller, its middle controller distributes queue number according to the application information of client terminal, memory storage is for storage queue information, queuing message comprises pre-confirmation queue, it is characterized in that, in described controller, be provided with predicting unit, described predicting unit is used for predicting the corresponding called number time of queue number, described controller can be according to the application information of client terminal, discontinuous distribution queue number, the corresponding specific time period of each queue number or the time point that distribute, the queuing system using also comprises confirmation device, described confirmation device is connected with controller, when near on-the-spot information desk of client, within the confirmation time period of queue number, by confirming that device confirms queue number, the queue number of confirming enters pre-confirmation queue, described client terminal is mobile phone, the application information of described client terminal comprises cell-phone number, queuing system is preserved the related information of queue number and cell-phone number, and close on while taking turns to mobile phone located at this queue number, if this mobile phone location in the on-the-spot distance range allowing of information desk, this queue number enters pre-confirmation queue,
One of discontinuous distribution queue number is following mode:
Mode one,
Step S301, searches queue number by the condition in application information; If application information comprises time point, search the distributed queue number that the prediction time of taking turns to equals described time point; If application information comprises the time period, search prediction and take turns to the distributed queue number of time within the described time period; If application information comprises queue number, search queue number and equal the distributed queue number of described queue number; If application information comprises queue number section, search the distributed queue number of queue number in described queue number section;
Step S302, if search at least one queue number, enters step S303, if search less than, enter step S304;
Step S303, is that this application distributes a queue number, and exports this queue number information by client terminal, qualifiedly has multiplely if having, and selects at random one; This applies for finishing;
Step S304, searches the distributed queue number that closes on application information conditional most; If application information comprises time point, search the distributed queue number that the prediction time that takes turns to approaches described time point most; If application information comprises the time period, search initial time or the distributed queue number of end time that the prediction time that takes turns to approaches the described time period most; If application information comprises queue number, search queue number and approach most the distributed queue number of described queue number; If application information comprises queue number section, search queue number approach most described queue number section starting symbol or finish number distributed queue number; This step must search at least one qualified queue number that distributes; It is qualified that to distribute queue number to have multiple; Step S305 is the determining step of permissible error whether, while representing to search by the condition in application information, searches and takes turns to time or queue number less than the prediction of the queue number closing on most, whether permissible error of customer selecting; If permissible error, enters step S306; If not permissible error, enters step S307;
Step S306, while search, if the queue number searching out is in the error range of setting, enters step S303 by the condition in application information; If not, enter step S307;
Step S307, is that described queue number information of closing on is most sent to client terminal, feeds back to client, expects that client confirms;
The confirmation of the selectable queue number information that step S308 is client to feedback, if client a queue number in the selectable queue number information of feedback is confirmed, represent that client replys agreement by client terminal and accepts this queue number, enter step S303; If controller is not received confirmation within the scope of official hour, or receive dissenting reply, this application finishes;
Mode two:
Step S601, accurately searches queue number by the condition in application information; If application information comprises time point, search the distributed queue number that the prediction time of taking turns to equals described time point; If application information comprises the time period, search prediction and take turns to the distributed queue number of time within the described time period; If application information comprises queue number, search queue number and equal the distributed queue number of described queue number; If application information comprises queue number section, search the distributed queue number of queue number in described queue number section;
Step S602, if search at least one queue number, enters step S603, if search less than, enter step S604;
Step S603, is that this application distributes a queue number, and exports this queue number information by client terminal, qualifiedly has multiplely if having, and selects at random one; This applies for finishing;
Step S604, searches the distributed queue number that closes on application information conditional most; If application information comprises time point, search the distributed queue number that the prediction time that takes turns to approaches described time point most; If application information comprises queue number, search queue number and approach most the distributed queue number of described queue number; This step must search at least one qualified queue number that distributes; There are multiple queue numbers that distribute if qualified, select at random one; Step S605, is that this queue number information is sent to client terminal, feeds back to client, expects that client confirms;
The confirmation of the selectable queue number information that step S606 is client to feedback, if client a queue number in the selectable queue number information of feedback is confirmed, represent that client replys agreement by client terminal and accepts this queue number, enter step S603; If controller is not received confirmation within the scope of official hour, or receive dissenting reply, this application finishes.
2. intelligent queuing method according to claim 1, it is characterized in that, the method of described predicting unit prediction corresponding called number time of queue number is: in the time that historical data is less, adopt exponential smoothing or regression analysis to predict that respectively the prediction of each queue number on the same day takes turns to the time; In the time that historical data is more, the prediction that adopts relevant function method to analyze each queue number on the same day takes turns to the time;
(a) fundamental formular of described exponential smoothing is:
S
t＝aY
t+(1-a)S
t-1
In formula, S
t-the same day, the prediction of queue number N took turns to the time, i.e. the smooth value of time t, i.e. pretest value;
Y
t--the actual value of time t;
S
t-1--the actual value of time t-1;
A--smoothing constant, its span is [0,1];
For the same day, the prediction of queue number N took turns to the time, was the function that the prediction of the queue number N of yesterday takes turns to the time, yesterday be the function of the day before yesterday, by that analogy, the actual wheel that the prediction time of taking turns to of first day is got first day is to the time;
(b) described regression analysis formula is as follows:
Y
t＝f(Y
t-1,Y
t-2,…)，
Y in formula
tbe that the prediction of queue number N on the same day takes turns to the time;
Y
t-1be the previous day queue number N actual wheel to the time;
Y
t-2be more the previous day queue number N actual wheel to the time;
F is function, the same day queue number N the prediction time of taking turns to be in the past queue number N actual wheel to the functional value of time;
(c) described relevant function method is as follows:
Using the date on the same day what day belongs to, red-letter day, which, which number, weather condition attribute be as analyzing foundation the moon, before system assignment queue number, with the highest data of a day of correlativity on the same day as the predicted value of working as day data; And, when system operation is after several hours, can also be according to the data of the actual motion on the same day, choose the data of a day the highest with history dependence as predicting the outcome according to revising.
3. intelligent queuing method according to claim 1, is characterized in that, the queuing system using also comprises the equipment of calling out the numbers, and the described equipment and control device of calling out the numbers connects; The described equipment of calling out the numbers only to through pre-that confirm, confirm that the queue number in queue calls out the numbers in advance.
4. intelligent queuing method according to claim 1, is characterized in that, described each queue number is also assigned a corresponding identifying code simultaneously.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110072900.3A CN102270363B (en) | 2010-03-17 | 2011-03-15 | Intelligent queuing system |
Applications Claiming Priority (5)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010144291.3 | 2010-03-17 | ||
| CN201010144291 | 2010-03-17 | ||
| CN201010228416 | 2010-07-03 | ||
| CN201010228416.0 | 2010-07-26 | ||
| CN201110072900.3A CN102270363B (en) | 2010-03-17 | 2011-03-15 | Intelligent queuing system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102270363A CN102270363A (en) | 2011-12-07 |
| CN102270363B true CN102270363B (en) | 2014-12-10 |
Family
ID=45062733
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110072900.3A Expired - Fee Related CN102270363B (en) | 2010-03-17 | 2011-03-15 | Intelligent queuing system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102270363B (en) |
Families Citing this family (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102592344B (en) * | 2011-12-30 | 2015-01-14 | 深圳市奥拓电子股份有限公司 | Queuing machine system and queuing method |
| CN102647467B (en) * | 2012-03-31 | 2015-11-25 | 吴志华 | There is schedule off-line editing transmission method and the system on line of forecast function |
| CN104268975B (en) * | 2012-06-01 | 2017-05-17 | 李光磊 | Autonomous time-selecting queuing machine and method |
| CN102779367B (en) * | 2012-07-13 | 2015-02-04 | 南京信息工程大学 | Scheduling method of queuing processing system and queuing machine for prediction of service processing time |
| CN103473846B (en) * | 2013-09-22 | 2015-11-25 | 四川智行电子科技有限公司 | The dynamic queuing strategy of complicated many tokens |
| CN105844762B (en) * | 2016-06-15 | 2019-05-24 | 京东方科技集团股份有限公司 | Number lining up device, queuing system and row number method |
| CN107248018A (en) * | 2017-01-16 | 2017-10-13 | 国网山东省电力公司龙口市供电公司 | Queue up with evaluating on-line processing method, device and system in the Power supply business Room |
| CN107133682B (en) * | 2017-05-27 | 2021-03-02 | 北京绪水互联科技有限公司 | Equipment log-based equipment operation time estimation system and method, equipment log-based dynamic reservation system and implementation method thereof |
| CN107833341B (en) * | 2017-11-22 | 2020-09-15 | 深圳怡化电脑股份有限公司 | Intelligent queuing method, equipment and computer readable storage medium |
| CN108846722B (en) * | 2018-06-04 | 2022-02-11 | 深圳市深弘卓异科技有限公司 | Beverage self-service method and system |
| CN109146101B (en) * | 2018-07-11 | 2022-03-15 | 保山市质量技术监督综合检测中心 | Equipment reservation method and system |
| CN109658580A (en) * | 2018-11-05 | 2019-04-19 | 广州医科大学附属第三医院 | Hospital's sequence based on customer mobile terminal is called out the numbers method and system |
| CN109840605B (en) * | 2019-02-15 | 2021-04-02 | 广西盖德科技有限公司 | Location-based online queuing system, method and storage medium |
| TWI732308B (en) * | 2019-10-08 | 2021-07-01 | 兆豐國際商業銀行股份有限公司 | Queuing number system and queuing number method |
| CN111210047A (en) * | 2019-11-12 | 2020-05-29 | 恒大智慧科技有限公司 | Scenic spot service time estimation method, device and storage medium |
| CN111105546B (en) * | 2019-12-05 | 2022-07-01 | 应石磊 | Instant reservation method for vehicle service |
| CN112132303B (en) * | 2020-09-30 | 2023-08-29 | 中国银行股份有限公司 | Information management method and device based on block chain |
| CN112614267B (en) * | 2020-12-08 | 2022-05-03 | 快优智能技术有限公司 | Intelligent queuing system for surface labels |
| CN113362520B (en) * | 2021-06-07 | 2022-07-01 | 苏州卡创信息科技有限公司 | Intelligent queuing method and system and application platform thereof |
| CN113658370A (en) * | 2021-08-17 | 2021-11-16 | 厦门汇银通达数字科技有限公司 | Chemical industry park vehicle number optimizing method, storage medium and electronic equipment |
| CN114220211A (en) * | 2021-12-27 | 2022-03-22 | 咪咕音乐有限公司 | Video color ring back tone ranking prompt method, device, equipment and computer storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101110136A (en) * | 2007-04-24 | 2008-01-23 | 暨南大学 | Intelligent queuing system |
| CN101364977A (en) * | 2007-08-08 | 2009-02-11 | 银河联动信息技术（北京）有限公司 | Remote reserved queue number calling system and method |
| CN101582179A (en) * | 2008-05-16 | 2009-11-18 | 深圳市华骏电气有限公司 | Secondary-confirmation type queuing machine and secondary-confirmation queuing method |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030036936A1 (en) * | 2001-08-17 | 2003-02-20 | Steichen Jennifer L. | Computer method and apparatus to estimate customer arrival times using transactional data |
| US20040100390A1 (en) * | 2002-11-19 | 2004-05-27 | Safetzone Technologies Corp. | Queue management system and method |
-
2011
- 2011-03-15 CN CN201110072900.3A patent/CN102270363B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101110136A (en) * | 2007-04-24 | 2008-01-23 | 暨南大学 | Intelligent queuing system |
| CN101364977A (en) * | 2007-08-08 | 2009-02-11 | 银河联动信息技术（北京）有限公司 | Remote reserved queue number calling system and method |
| CN101582179A (en) * | 2008-05-16 | 2009-11-18 | 深圳市华骏电气有限公司 | Secondary-confirmation type queuing machine and secondary-confirmation queuing method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102270363A (en) | 2011-12-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102270363B (en) | Intelligent queuing system | |
| CN101867487B (en) | With the system and method for figure call connection symbol management association centre | |
| EP4186016A1 (en) | Method and system for scalable contact center agent scheduling utilizing automated ai modeling and multi-objective optimization | |
| CN104125349A (en) | Voice interaction management method and system based on telephone traffic forecasting | |
| CN104796422A (en) | Online customer service staff equilibrium assignment method and online customer service staff equilibrium assignment device | |
| CN101216961A (en) | A wireless queuing system and the corresponding method | |
| JP2012517639A (en) | Method and system for calculating charges online based on user service volume | |
| CN111010426A (en) | Message pushing method and device | |
| CN201910087U (en) | Number calling device and queuing system for bank outlets | |
| CN104200557A (en) | System and method for realizing intelligent number taking by using handheld equipment | |
| CN105719221A (en) | Path cooperation programming method and device aiming at multitask | |
| CN110956505B (en) | Advertisement inventory estimation method and related device | |
| CN106454437A (en) | Streaming media service rate prediction method and device | |
| CN101324947A (en) | Method and system for automatically ordering dishes and settling account | |
| CN102111276B (en) | Real-time charging method and system | |
| CN107730398A (en) | The recommendation method, apparatus and storage medium of electricity consumption charging mode | |
| CN101414385B (en) | Method and apparatus for prompting ticket-check service, and ticket management system | |
| CN101072226B (en) | Grid computing method and system | |
| CN110458410A (en) | A kind of method and apparatus of task distribution | |
| CN108694182A (en) | Movable method for pushing, movable pusher and server | |
| CN101924841B (en) | Building and control method of a kind of call center and data center's distributed frame | |
| CN111461365A (en) | Installation, maintenance and operation integrated autonomous sharing service platform system | |
| CN116189346A (en) | Intelligent queuing and calling system for digital science and technology deep integration hall management and marketing scene | |
| US20230259846A1 (en) | Communications apparatus and method for estimating potential demand for improved forecasting and resource management | |
| CN111290805B (en) | Method and system for quickly calling aggregation function |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CB03 | Change of inventor or designer information |
Inventor after: Tang Wenjuan Inventor before: Zheng Zhihao |
|
| CB03 | Change of inventor or designer information | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20171013 Address after: Rugao City, Jiangsu province Nantong city 226500 Yuan Zhen Guo Puhuang Road No. 58 Patentee after: Nantong Zhan Cheng Commodity Concrete Co.,Ltd. Address before: West Second Ring Road Taijiang District of Fuzhou City, Fujian province 350004 No. 99 East brilliant garden 7 Building 806 Patentee before: Zheng Zhihao |
|
| TR01 | Transfer of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20141210 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |