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.
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.