CN108428277B - A kind of row number method of calling and system based on buffer zone analysis - Google Patents
A kind of row number method of calling and system based on buffer zone analysis Download PDFInfo
- Publication number
- CN108428277B CN108428277B CN201810212085.8A CN201810212085A CN108428277B CN 108428277 B CN108428277 B CN 108428277B CN 201810212085 A CN201810212085 A CN 201810212085A CN 108428277 B CN108428277 B CN 108428277B
- Authority
- CN
- China
- Prior art keywords
- buffering area
- area domain
- existing customer
- time
- queuing
- 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.)
- Active
Links
Classifications
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C11/00—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/52—Network services specially adapted for the location of the user terminal
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C11/00—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere
- G07C2011/04—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere related to queuing systems
Abstract
The invention discloses a kind of row number method of calling based on buffer zone analysis, comprising: A constructs first buffering area domain according to the reference velocity for estimating queuing time and mode of transportation；B, if existing customer in first buffering area domain, calls existing customer, if existing customer is not in first buffering area domain, next bit client enters step A and existing customer enters step C；C constructs second buffering area domain according to the reference velocity of quitting time and mode of transportation；D, if existing customer in second buffering area domain, calls existing customer, if existing customer, not in second buffering area domain, next bit client enters step A and existing customer cancels queuing qualification.The invention also discloses a kind of row number calling system based on buffer zone analysis.Using the present invention, it can be achieved that the people-oriented interaction of queuing process, allows client to carry out social activities during being lined up equal sign, moreover it is possible to take into account the efficiency for being lined up equal sign, can effectively solve conflict between doctors and patients, promote customer experience, promote social efficiency.
Description
Technical field
The present invention relates to mathematics and Geographical Information Sciences technical field more particularly to a kind of row number based on buffer zone analysis
Method of calling and a kind of row number calling system based on buffer zone analysis.
Background technique
In people's daily life, it is often necessary to be lined up equal sign, especially at the restaurant, hospital, bank, administrative services center
These places.Therefore, it is lined up equal sign system and plays the part of very important role in social field, for social stability, people's quality
Promotion it is significant.
But traditional broadcast mode, which is lined up equal sign system, to communicate with client in time, it is easy to cause client's time
Waste, need to arrange in numerical order again simultaneously as all kinds of reasons cause queue machine that can miss, cause huge waste to client, easily make
At the contradiction of service side and client, increase social unstable factor.
Hence it is imperative that researching and developing a kind of queuing equal sign method of interactive mode, spatial relation is relied on, fully considers visitor
The optimal combination of equal sign efficiency Yu client's time availability is accomplished in the arrangement of time at family, promotes the overall operation efficiency of society.
Summary of the invention
Technical problem to be solved by the present invention lies in, provide one kind be easily achieved, strong applicability, be based on buffer zone analysis
Row number method of calling and system, it can be achieved that the two-way interaction of client and service point.
In order to solve the above-mentioned technical problems, the present invention provides a kind of row number method of calling based on buffer zone analysis, packet
It includes:
It is slow to construct first according to the reference velocity for estimating queuing time and mode of transportation on the basis of estimating queuing time by A
Rush region；
B, using first buffering area domain as boundary, if existing customer calls existing customer in first buffering area domain, if working as
Preceding client is not in first buffering area domain, then next bit client enters step A and existing customer enters step C；
C constructs second buffering area domain according to the reference velocity of quitting time and mode of transportation on the basis of the quitting time；
D, using second buffering area domain as boundary, if existing customer calls existing customer in second buffering area domain, if working as
Preceding client is not in second buffering area domain, then next bit client enters step A and existing customer cancels queuing qualification.
As an improvement of the above scheme, the step A includes: that basis estimates queuing time T1And the reference speed of mode of transportation
V is spent, calculates the first radius R, wherein R=T1×v；Using service point as the center of circle, the first radius R is radius, constructs first buffering area
Domain.
As an improvement of the above scheme, the step B includes: using first buffering area domain as boundary, according to existing customer position
It sets and judges whether existing customer is in first buffering area domain；If existing customer is in first buffering area domain, according to current visitor
Time needed for the reference velocity of family position and mode of transportation calculates arrival service point, and existing customer is notified to need at the appointed time
Interior return service point；If existing customer not in first buffering area domain, notifies existing customer beyond queuing distance, next client
Automatically into step A, existing customer enters step C.
As an improvement of the above scheme, the step C includes: the time difference calculated between quitting time and current time
Tt；According to current time difference TtAnd the reference velocity v of mode of transportation, calculate the second radius Rt, wherein Rt=Tt×v；With service point
For the center of circle, the second radius RtFor radius, second buffering area domain is constructed.
As an improvement of the above scheme, the step D includes: using second buffering area domain as boundary, according to existing customer position
It sets and judges whether existing customer is in second buffering area domain；If existing customer is in second buffering area domain, according to current visitor
Time needed for the reference velocity of family position and mode of transportation calculates arrival service point, and existing customer is notified to need at the appointed time
Interior return service point retains the queuing qualification of existing customer, if existing customer is different if existing customer is agreed to return to service point
Meaning returns to service point, then next bit client enters step A and existing customer cancels queuing qualification；If existing customer is not slow second
It rushes in region, then next bit client enters step A and notifies existing customer beyond the queuing for being lined up apart from and cancelling existing customer
Qualification.
Correspondingly, the present invention also provides a kind of row number calling system based on buffer zone analysis, comprising:
First buffering area domain constructs module, on the basis of estimating queuing time, according to estimating queuing time and traffic
The reference velocity of mode constructs first buffering area domain；
First buffering area domain processing module is used for using first buffering area domain as boundary, if existing customer is in first buffering area
In domain, then existing customer is called, if existing customer, not in first buffering area domain, next bit client passes through first buffering area domain
Building module carries out processing and existing customer constructs module by second buffering area domain and handled；
Second buffering area domain constructs module, is used on the basis of the quitting time, according to quitting time and the ginseng of mode of transportation
Examine speed building second buffering area domain；
Second buffering area domain processing module is used for using second buffering area domain as boundary, if existing customer is in second buffering area
In domain, then existing customer is called, if existing customer, not in second buffering area domain, next bit client passes through first buffering area domain
Building module carries out processing and existing customer cancels queuing qualification.
As an improvement of the above scheme, the first buffering area domain building module includes: the first radius computing unit, is used for
According to estimating queuing time T1And the reference velocity v of mode of transportation, calculate the first radius R, wherein R=T1×v；First buffering area
Domain construction unit, for using service point as the center of circle, the first radius R to be radius, building first buffering area domain.
As an improvement of the above scheme, first buffering area domain processing module includes: first buffering area domain judging unit,
For judging whether existing customer is in first buffering area domain according to current subscriber location using first buffering area domain as boundary；
First processing units, if for existing customer in first buffering area domain, according to current subscriber location and the ginseng of mode of transportation
The time needed for speed calculates arrival service point is examined, and notifies existing customer that need within a specified time return to service point；At second
Unit is managed, if notifying existing customer beyond distance is lined up, then next bit visitor for existing customer not in first buffering area domain
Family carries out processing by first buffering area domain building module and existing customer constructs module by second buffering area domain and handled.
As an improvement of the above scheme, the second buffering area domain building module includes: time difference calculating unit, based on
Calculate the time difference T between quitting time and current timet；Second radius computing unit, for according to current time difference TtAnd traffic
The reference velocity v of mode calculates the second radius Rt, wherein Rt=Tt×v；Second buffering area domain construction unit, for service
Point is the center of circle, the second radius RtFor radius, second buffering area domain is constructed.
As an improvement of the above scheme, second buffering area domain processing module includes: second buffering area domain judging unit,
For judging whether existing customer is in second buffering area domain according to current subscriber location using second buffering area domain as boundary；
Third processing unit, if for existing customer in second buffering area domain, according to current subscriber location and the ginseng of mode of transportation
The time needed for speed calculates arrival service point is examined, and notifies existing customer that need within a specified time return to service point, if currently
Client agrees to return service point, then retains the queuing qualification of existing customer, next if existing customer disagrees return service point
Position client is handled by first buffering area domain building module and existing customer cancels queuing qualification；Fourth processing unit is used
In if existing customer is not in second buffering area domain next bit client by first buffering area domain construct module handle and
Notice existing customer is beyond the queuing qualification for being lined up apart from and cancelling existing customer.
The invention has the following beneficial effects:
The present invention is based on the row number method of callings of buffer zone analysis to be suitable for location-based two -way interactive mode queuing etc.
Number demand.Unlike the prior art, the present invention changes the original broadcast mode of existing queuing system, by buffer zone analysis
Technology, Shortest Path Searching technology and mobile interaction technique integrated use, realize the people-oriented interaction mode of queuing system, energy
Allow client carry out corresponding social activities during being lined up equal sign, while again can take into account be lined up equal sign efficiency, it is easy to accomplish, height
Effect is stablized, is versatile, for solving conflict between doctors and patients, promotes customer experience, promotes social efficiency and be all of great significance.
Detailed description of the invention
Fig. 1 is the embodiment flow chart of the row number method of calling the present invention is based on buffer zone analysis；
Fig. 2 is another embodiment flow chart of the row number method of calling the present invention is based on buffer zone analysis；
Fig. 3 is the schematic diagram of service point and Customer Location point in Fig. 2；
Fig. 4 is the structural schematic diagram of the row number calling system the present invention is based on buffer zone analysis；
Fig. 5 is the structural schematic diagram of building module in first buffering area domain in Fig. 4；
Fig. 6 is the structural schematic diagram of first buffering area domain processing module in Fig. 4；
Fig. 7 is the structural schematic diagram of building module in second buffering area domain in Fig. 4；
Fig. 8 is the structural schematic diagram of second buffering area domain processing module in Fig. 4.
Specific embodiment
To make the object, technical solutions and advantages of the present invention clearer, the present invention is made into one below in conjunction with attached drawing
Step ground detailed description.Only this is stated, the present invention occurs in the text or will occur up, down, left, right, before and after, it is inside and outside etc. just
Position word is not to specific restriction of the invention only on the basis of attached drawing of the invention.
The embodiment flow chart of the row number method of calling the present invention is based on buffer zone analysis, packet are shown referring to Fig. 1, Fig. 1
It includes:
Step A constructs the according to the reference velocity for estimating queuing time and mode of transportation on the basis of estimating queuing time
One buffer area.
Specifically, the step A includes:
A1, according to estimating queuing time T1And the reference velocity v of mode of transportation, calculate the first radius R, wherein R=T1×
v。
It should be noted that described estimate queuing time T1Calculation method it is as follows: calculate current Number and existing customer
Difference n between number；Queuing time T is estimated according to difference n and average service time t1, wherein T1=n × t.
A2, using service point as the center of circle, the first radius R is radius, constructs first buffering area domain.Specifically, it is with service point
The center of circle, the first radius R are border circular areas, that is, first buffering area domain made of radius is constructed.
Step B, using first buffering area domain as boundary, if existing customer calls existing customer in first buffering area domain,
If existing customer is not in first buffering area domain, next bit client enters step A and existing customer enters step C.
Specifically, the step B includes:
B1 judges whether existing customer is in the first buffering according to current subscriber location using first buffering area domain as boundary
In region.
B2, if existing customer in first buffering area domain, according to current subscriber location and the reference velocity of mode of transportation
The time needed for reaching service point is calculated, and notifies existing customer that need within a specified time return to service point.
It should be noted that if existing customer in first buffering area domain, then extract current subscriber location and service point it
Between shortest path length S, calculate reach service point needed for time T2, and existing customer is notified to need at the appointed time T3Inside return
Return service point, wherein T2=S ÷ v, T3=T1-T2.Preferably, the Shortest Path Searching based on Spatial Data Analysis can be used to calculate
Method (patent No. 201510790636.5) extracts the shortest path length S between current subscriber location and service point, but not with this
For limitation, can be extracted according to the actual situation using effective path search algorithm most short between current subscriber location and service point
Path.
B3, if existing customer not in first buffering area domain, notifies existing customer beyond distance is lined up, next client is certainly
Dynamic to enter step A, existing customer enters step C.
Step C constructs second buffering area according to the reference velocity of quitting time and mode of transportation on the basis of the quitting time
Domain.
Specifically, the step C includes:
C1 calculates the time difference T between quitting time and current timet。
C2, according to current time difference TtAnd the reference velocity v of mode of transportation, calculate the second radius Rt, wherein Rt=Tt×
v。
C3, using service point as the center of circle, the second radius RtFor radius, second buffering area domain is constructed.Specifically, it is with service point
The center of circle, the second radius RtFor border circular areas, that is, second buffering area domain made of constructed by radius.
Step D, using second buffering area domain as boundary, if existing customer calls existing customer in second buffering area domain,
If existing customer, not in second buffering area domain, next bit client enters step A and existing customer cancels queuing qualification.
Specifically, the step D includes:
D1 judges whether existing customer is in the second buffering according to current subscriber location using second buffering area domain as boundary
In region.
D2, if existing customer in second buffering area domain, according to current subscriber location and the reference velocity of mode of transportation
The time needed for reaching service point is calculated, and notifies existing customer that need within a specified time return to service point, if existing customer is same
Meaning returns to service point, then retains the queuing qualification of existing customer, if existing customer disagrees return service point, next bit client
It enters step A and existing customer cancels queuing qualification.
It should be noted that if existing customer is in second buffering area domain, then according to extracting current subscriber location and service
Shortest path length S ' between point calculates time T needed for reaching service point2', and existing customer is notified to need at the appointed time
T3Service point is returned in ', wherein T2'=S ' ÷ v, T3'=Tt-T2'.Preferably, it can be used most short based on Spatial Data Analysis
Path search algorithm (patent No. 201510790636.5) extracts the shortest path length between current subscriber location and service point
S ', system that but not limited to this can extract current subscriber location and service using effective path search algorithm according to the actual situation
Shortest path between point.
D3, if existing customer, not in second buffering area domain, next bit client enters step A and notice existing customer is super
It is lined up distance out and cancels the queuing qualification of existing customer.
From the foregoing, it will be observed that the present invention is based on the row number method of callings of buffer zone analysis to be suitable for location-based two-way interactive mould
Formula is lined up equal sign demand.Unlike the prior art, the present invention changes the original broadcast mode of existing queuing system, will delay
Area's analytical technology, Shortest Path Searching technology and mobile interaction technique integrated use are rushed, the hommization for realizing queuing system is handed over
Mutual mode can allow client to carry out corresponding social activities during being lined up equal sign, while can take into account the efficiency for being lined up equal sign again, easily
In realization, efficient stable, versatile, for solving conflict between doctors and patients, promote customer experience, promoted social efficiency all have it is important
Meaning.
Referring to fig. 2 and Fig. 3, below with reference to specific embodiment, the present invention is further illustrated.
S1 calculates the difference n between current Number and existing customer number, wherein n=10；
S2 estimates queuing time T according to difference n and average service time t1, wherein t=5 (minute), T1=n × t=10
× 5=50 (minute)；
S3, according to estimating queuing time T1And the reference velocity v of mode of transportation, calculate the first radius R, wherein v=5 is (public
In/hour), R=T1× v=50 × (5 ÷ 60)=4.16 (kilometer), it is 4 kilometers that R, which is rounded,.
S4, using service point as the center of circle, the first radius R is radius, constructs border circular areas, this border circular areas, that is, first buffering area
Domain.
S5 judges current visitor according to current subscriber location using first buffering area domain as boundary (circle that radius is 4 kilometers)
Whether family is in first buffering area domain.
S6, if existing customer in first buffering area domain (referring to No. 1 Customer Location in Fig. 3), using based on space point
The Shortest Path Searching Algorithm of analysis technology extracts the shortest path length S between current subscriber location and service point, calculates and reaches
Time T needed for service point2, and existing customer is notified to need at the appointed time T3Interior return service point, wherein S=3 kilometers, T2=
S ÷ 5 × 60=36 of v=3 ÷ (minute), T3=T1-T2=50-36=14 (minute).
S7, if existing customer not in first buffering area domain (referring to No. 2 Customer Locations in Fig. 3), notify existing customer
Beyond distance is lined up, next client enters step S8 automatically into step S1, existing customer.
S8 calculates the time difference T between quitting time and current timet, wherein quitting time 12:00, current time
For 9:00, then time difference TtIt is 3 hours.
S9, according to current time difference TtAnd the reference velocity v of mode of transportation, calculate the second radius Rt, wherein Tt=3, v=
5 (kilometers/hour), Rt=Tt× v=3 × 5=15 kilometers.
S10, using service point as the center of circle, the second radius RtFor radius, border circular areas is constructed, this border circular areas i.e. second buffers
Region.
S11 judges current using second buffering area domain as boundary (circle that radius is 15 kilometers) according to current subscriber location
Whether client is in second buffering area domain.
S12, if existing customer in second buffering area domain (referring to No. 2 Customer Locations in Fig. 3), using based on space point
The Shortest Path Searching Algorithm of analysis technology extracts the shortest path length S ' between current subscriber location and service point, calculates and reaches
Time T needed for service point2', and existing customer is notified to need at the appointed time T3Service point is returned in ', if existing customer agreement is returned
Service point is returned, then retains the queuing qualification of existing customer, if existing customer disagrees return service point, next bit client enters
Step S1 and existing customer, which are cancelled, is lined up qualification, wherein '=10 kilometer S, T25 × 60=120 of '=S ' ÷ v=10 ÷ (point
Clock), T3'=Tt-T2'=3 × 60-120=60 (minute).
S13, if existing customer, not in second buffering area domain, next bit client enters step S1 and notice existing customer
Beyond the queuing qualification for being lined up apart from and cancelling existing customer.
Referring to fig. 4, Fig. 4 shows the specific structure of the row number calling system 100 the present invention is based on buffer zone analysis, packet
Include first buffering area domain building module 1, first buffering area domain processing module 2, second buffering area domain building module 3 and the second buffering
Regional processing module 4, specifically:
First buffering area domain constructs module 1, on the basis of estimating queuing time, according to estimating queuing time and traffic
The reference velocity of mode constructs first buffering area domain.
First buffering area domain processing module 2 is used for using first buffering area domain as boundary, if existing customer is in first buffering area
In domain, then existing customer is called, if existing customer, not in first buffering area domain, next bit client passes through first buffering area domain
Building module 1 carries out processing and existing customer constructs module 3 by second buffering area domain and handled.
Second buffering area domain constructs module 3, is used on the basis of the quitting time, according to quitting time and the ginseng of mode of transportation
Examine speed building second buffering area domain.
Second buffering area domain processing module 4 is used for using second buffering area domain as boundary, if existing customer is in second buffering area
In domain, then existing customer is called, if existing customer, not in second buffering area domain, next bit client passes through first buffering area domain
Building module 1 carries out processing and existing customer cancels queuing qualification.
As shown in figure 5, the first buffering area domain building module 1 includes:
First radius computing unit 11 estimates queuing time T for basis1And the reference velocity v of mode of transportation, calculate the
Radius R, wherein R=T1×v.Wherein, described to estimate queuing time T1Calculation method it is as follows: calculate current Number and current
Difference n between client's number；Queuing time T is estimated according to difference n and average service time t1, wherein T1=n × t.
First buffering area domain construction unit 12 is used for using service point as the center of circle, and the first radius R is radius, and building first is slow
Rush region.
As shown in fig. 6, first buffering area domain processing module 2 includes:
First buffering area domain judging unit 21, for being judged according to current subscriber location using first buffering area domain as boundary
Whether existing customer is in first buffering area domain.
First processing units 22, if for existing customer in first buffering area domain, according to current subscriber location and friendship
Time needed for the reference velocity of logical mode calculates arrival service point, and notify existing customer that need within a specified time return to service
Point.It should be noted that if existing customer in first buffering area domain, then extracts between current subscriber location and service point most
Short path length S calculates time T needed for reaching service point2, and existing customer is notified to need at the appointed time T3Interior return service
Point, wherein T2=S ÷ v, T3=T1-T2.Preferably, the Shortest Path Searching Algorithm based on Spatial Data Analysis can be used (specially
201510790636.5) benefit number extracts the shortest path length S between current subscriber location and service point.
The second processing unit 23, if notifying existing customer beyond row for existing customer not in first buffering area domain
Team's distance, then next bit client is handled by first buffering area domain building module 1 and existing customer passes through second buffering area
Domain building module 3 is handled.
As shown in fig. 7, the second buffering area domain building module 3 includes:
Time difference calculating unit, for calculating the time difference T between quitting time and current timet。
Second radius computing unit 31, for according to current time difference TtAnd the reference velocity v of mode of transportation, calculate second
Radius Rt, wherein Rt=Tt×v。
Second buffering area domain construction unit 32 is used for using service point as the center of circle, the second radius RtFor radius, building second is delayed
Rush region.
As shown in figure 8, second buffering area domain processing module 4 includes:
Second buffering area domain judging unit 41, for being judged according to current subscriber location using second buffering area domain as boundary
Whether existing customer is in second buffering area domain.
Third processing unit 42, if for existing customer in second buffering area domain, according to current subscriber location and friendship
Time needed for the reference velocity of logical mode calculates arrival service point, and notify existing customer that need within a specified time return to service
Point retains the queuing qualification of existing customer if existing customer is agreed to return to service point, if existing customer disagrees return service
Point, then next bit client is handled by first buffering area domain building module 1 and existing customer cancels queuing qualification.It needs
It is bright, if existing customer in second buffering area domain, according to the shortest path extracted between current subscriber location and service point
Electrical path length S ' calculates time T needed for reaching service point2', and existing customer is notified to need at the appointed time T3Service is returned in '
Point, wherein T2'=S ' ÷ v, T3'=Tt-T2'.Preferably, the Shortest Path Searching Algorithm based on Spatial Data Analysis can be used
(patent No. 201510790636.5) extracts the shortest path length S ' between current subscriber location and service point.
It is slow by first to be used for the next bit client if existing customer is not in second buffering area domain for fourth processing unit 43
Region building module 1 is rushed to be handled and notify existing customer beyond the queuing qualification for being lined up apart from and cancelling existing customer.
From the foregoing, it will be observed that the present invention passes through the position of client and service point, the time difference is calculated, constructs buffer area, for visitor
Family carries out other social activitieies and provides reference.Meanwhile Spatio-temporal factors and human-computer interaction integrated use are changed tradition by the present invention
Queuing system broadcast mode is not influencing other people service quality simultaneously, hommization is examined for the client that queue machine for the first time can be missed
Consider individual needs.In addition, also there is the urgent possibility arranged in numerical order without influencing other people service quality indirectly in the present invention, it is objective to being promoted
Family experience, saving social resources, the social unstable factor of reduction are all of great significance, and can be pushed away in social various industries
Extensively, application potential is huge.
The above is a preferred embodiment of the present invention, it is noted that for those skilled in the art
For, various improvements and modifications may be made without departing from the principle of the present invention, these improvements and modifications are also considered as
Protection scope of the present invention.
Claims (10)
1. a kind of row number method of calling based on buffer zone analysis characterized by comprising
A constructs first buffering area according to the reference velocity for estimating queuing time and mode of transportation on the basis of estimating queuing time
Domain；
B, using first buffering area domain as boundary, if existing customer calls existing customer in first buffering area domain, if current visitor
Family is not in first buffering area domain, then next bit client enters step A and existing customer enters step C；
C constructs second buffering area domain according to the reference velocity of quitting time and mode of transportation on the basis of the quitting time；
D, using second buffering area domain as boundary, if existing customer calls existing customer in second buffering area domain, if current visitor
Family is not in second buffering area domain, then next bit client enters step A and existing customer cancels queuing qualification.
2. the row number method of calling based on buffer zone analysis as described in claim 1, which is characterized in that the step A includes:
According to estimating queuing time T1And the reference velocity v of mode of transportation, calculate the first radius R, wherein R=T1×v；
Using service point as the center of circle, the first radius R is radius, constructs first buffering area domain.
3. the row number method of calling based on buffer zone analysis as described in claim 1, which is characterized in that the step B includes:
Using first buffering area domain as boundary, judge whether existing customer is in first buffering area domain according to current subscriber location；
If existing customer in first buffering area domain, is calculated according to the reference velocity of current subscriber location and mode of transportation and is reached
Time needed for service point, and notify existing customer that need within a specified time return to service point；
If existing customer not in first buffering area domain, notify existing customer beyond be lined up distance, next client automatically into
Step A, existing customer enter step C.
4. the row number method of calling based on buffer zone analysis as described in claim 1, which is characterized in that the step C includes:
Calculate the time difference T between quitting time and current timet；
According to current time difference TtAnd the reference velocity v of mode of transportation, calculate the second radius Rt, wherein Rt=Tt×v；
Using service point as the center of circle, the second radius RtFor radius, second buffering area domain is constructed.
5. the row number method of calling based on buffer zone analysis as described in claim 1, which is characterized in that the step D includes:
Using second buffering area domain as boundary, judge whether existing customer is in second buffering area domain according to current subscriber location；
If existing customer in second buffering area domain, is calculated according to the reference velocity of current subscriber location and mode of transportation and is reached
Time needed for service point, and notify existing customer that need within a specified time return to service point, if existing customer is agreed to return to clothes
Business point, then retain the queuing qualification of existing customer, if existing customer disagrees return service point, next bit client is entered step
A and existing customer, which are cancelled, is lined up qualification；
If existing customer, not in second buffering area domain, next bit client enters step A and notice existing customer beyond queuing
Distance and the queuing qualification for cancelling existing customer.
6. a kind of row number calling system based on buffer zone analysis characterized by comprising
First buffering area domain constructs module, on the basis of estimating queuing time, according to estimating queuing time and mode of transportation
Reference velocity construct first buffering area domain；
First buffering area domain processing module, for using first buffering area domain as boundary, if existing customer in first buffering area domain,
Existing customer is then called, if existing customer is not in first buffering area domain, next bit client is constructed by first buffering area domain
Module carries out processing and existing customer constructs module by second buffering area domain and handled；
Second buffering area domain constructs module, is used on the basis of the quitting time, according to the reference of quitting time and mode of transportation speed
Degree building second buffering area domain；
Second buffering area domain processing module, for using second buffering area domain as boundary, if existing customer in second buffering area domain,
Existing customer is then called, if existing customer is not in second buffering area domain, next bit client is constructed by first buffering area domain
Module carries out processing and existing customer cancels queuing qualification.
7. the row number calling system based on buffer zone analysis as claimed in claim 6, which is characterized in that the first buffering area
Domain constructs module
First radius computing unit estimates queuing time T for basis1And the reference velocity v of mode of transportation, calculate the first radius
R, wherein R=T1×v；
First buffering area domain construction unit, for using service point as the center of circle, the first radius R to be radius, building first buffering area domain.
8. the row number calling system based on buffer zone analysis as claimed in claim 6, which is characterized in that the first buffering area
Domain processing module includes:
First buffering area domain judging unit, for judging current visitor according to current subscriber location using first buffering area domain as boundary
Whether family is in first buffering area domain；
First processing units, if for existing customer in first buffering area domain, according to current subscriber location and mode of transportation
Reference velocity calculate reach service point needed for the time, and notify existing customer that need within a specified time return to service point；
The second processing unit, if notifying existing customer exceeds to be lined up distance for existing customer not in first buffering area domain,
Then next bit client is handled by first buffering area domain building module and existing customer passes through second buffering area domain building mould
Block is handled.
9. the row number calling system based on buffer zone analysis as claimed in claim 6, which is characterized in that the second buffering area
Domain constructs module
Time difference calculating unit, for calculating the time difference T between quitting time and current timet；
Second radius computing unit, for according to current time difference TtAnd the reference velocity v of mode of transportation, calculate the second radius Rt,
Wherein, Rt=Tt×v；
Second buffering area domain construction unit is used for using service point as the center of circle, the second radius RtFor radius, second buffering area domain is constructed.
10. the row number calling system based on buffer zone analysis as claimed in claim 6, which is characterized in that second buffering
Regional processing module includes:
Second buffering area domain judging unit, for judging current visitor according to current subscriber location using second buffering area domain as boundary
Whether family is in second buffering area domain；
Third processing unit, if for existing customer in second buffering area domain, according to current subscriber location and mode of transportation
Reference velocity calculate reach service point needed for the time, and notify existing customer that need within a specified time return to service point, if
Existing customer agrees to return service point, then retains the queuing qualification of existing customer, if existing customer disagrees return service point,
Next bit client is handled by first buffering area domain building module and existing customer cancels queuing qualification；
Fourth processing unit is used for the next bit client if existing customer is not in second buffering area domain and passes through first buffering area domain
Building module is handled and notifies existing customer beyond the queuing qualification for being lined up apart from and cancelling existing customer.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810212085.8A CN108428277B (en) | 2018-03-15 | 2018-03-15 | A kind of row number method of calling and system based on buffer zone analysis |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810212085.8A CN108428277B (en) | 2018-03-15 | 2018-03-15 | A kind of row number method of calling and system based on buffer zone analysis |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108428277A CN108428277A (en) | 2018-08-21 |
| CN108428277B true CN108428277B (en) | 2019-06-11 |
Family
ID=63158618
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810212085.8A Active CN108428277B (en) | 2018-03-15 | 2018-03-15 | A kind of row number method of calling and system based on buffer zone analysis |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108428277B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101110136A (en) * | 2007-04-24 | 2008-01-23 | 暨南大学 | Intelligent queuing system |
| CN103366437A (en) * | 2013-07-19 | 2013-10-23 | 魏国辰 | Queuing number-taking processing method, and server and system for queuing number-taking processing |
| CN104732640A (en) * | 2015-03-09 | 2015-06-24 | 联动优势科技有限公司 | Queuing number calling method and number call server |
| EP2991010A1 (en) * | 2011-10-07 | 2016-03-02 | Tensator Group Limited | Queuing system |
| CN106296955A (en) * | 2016-09-09 | 2017-01-04 | 深圳怡化电脑股份有限公司 | Queuing strategy based on wireless terminal and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2938539A1 (en) * | 2015-08-19 | 2017-02-19 | Wal-Mart Stores, Inc. | System for reducing waiting time |
-
2018
- 2018-03-15 CN CN201810212085.8A patent/CN108428277B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101110136A (en) * | 2007-04-24 | 2008-01-23 | 暨南大学 | Intelligent queuing system |
| EP2991010A1 (en) * | 2011-10-07 | 2016-03-02 | Tensator Group Limited | Queuing system |
| CN103366437A (en) * | 2013-07-19 | 2013-10-23 | 魏国辰 | Queuing number-taking processing method, and server and system for queuing number-taking processing |
| CN104732640A (en) * | 2015-03-09 | 2015-06-24 | 联动优势科技有限公司 | Queuing number calling method and number call server |
| CN106296955A (en) * | 2016-09-09 | 2017-01-04 | 深圳怡化电脑股份有限公司 | Queuing strategy based on wireless terminal and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108428277A (en) | 2018-08-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ling et al. | Mobile telephony, mobility, and the coordination of everyday life | |
| Lorini et al. | Online vehicle routing and scheduling with dynamic travel times | |
| US8140441B2 (en) | Workflow management in a global support organization | |
| CN106453980B (en) | A kind of method and system improving prediction outgoing call accuracy rate based on number attribution | |
| US20120197670A1 (en) | Online restaurant systems for forecasting behaviors of late customers | |
| US20110066468A1 (en) | Dynamic event planning through location awareness | |
| KR20140039194A (en) | System and method for an intelligent personal timeline assistant | |
| JP2013501275A5 (en) | ||
| US10212281B2 (en) | System and method for handling repetitive calls at call center | |
| CN103246952A (en) | Conflicting meeting scheduler | |
| US8811598B2 (en) | Scheduling an agent based on a contact center history | |
| CN105163274A (en) | Reservation method and system based on mobile position information | |
| CN109636311A (en) | A kind of row number situation reminding method and terminal device | |
| CN105046802A (en) | Multi-counter based bank queuing and number calling method and system | |
| CN108428277B (en) | A kind of row number method of calling and system based on buffer zone analysis | |
| CN103220211A (en) | Processing method, processing device and mobile terminal for social network site (SNS) messages | |
| EP2753132A1 (en) | Large-scale human mobility pattern recognition | |
| CN110349428B (en) | Method and device for identifying whether user is going to bus stop | |
| US20160364696A1 (en) | Meeting scheduler for automated face-to-face meeting generation | |
| CN109508860A (en) | A kind of auto form delivering method and device | |
| Klimek et al. | Towards a better understanding and behavior recognition of inhabitants in smart cities. A public transport case | |
| CN106161188A (en) | Message method, message display method and device | |
| CN107705191A (en) | The order of OTA platforms strives for method and system | |
| WO2017082683A1 (en) | Method and system for providing information on expenditure management, and non-transitory computer-readable recording medium | |
| Nazarov et al. | Heavy outgoing call asymptotics for retrial queue with two way communication and multiple types of outgoing calls |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |