CN103021168B - Method and system for scheduling control processing - Google Patents
Method and system for scheduling control processing Download PDFInfo
- Publication number
- CN103021168B CN103021168B CN201210517348.9A CN201210517348A CN103021168B CN 103021168 B CN103021168 B CN 103021168B CN 201210517348 A CN201210517348 A CN 201210517348A CN 103021168 B CN103021168 B CN 103021168B
- Authority
- CN
- China
- Prior art keywords
- passenger
- client
- taxi
- coefficient
- information
- 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
Landscapes
- Traffic Control Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a method and system for scheduling control processing. The method includes the following steps: after a strategy controller receives an identification request sent by a passenger client, if refusal pushing times of the passenger client are judged to be smaller than a first preset value, the passenger client sends a booking request to calculator; the calculator determines a requiring time degree range and sends the requiring time degree range to a comparer according to self-stored information after receiving the booking request; distance and rate-limiting coefficient are determined so as to determine supplier time coefficient and send the supplier time coefficient to the comparer; and the comparer determines a target taxi, sends the requiring time degree range and the target taxi information to an information pushing server and sends information to be pushed to the passenger client. If the passenger client refuses, refusal response is sent to the strategy controller and the information pushing server respectively, the strategy controller conducts corresponding control, and taxi resource utilization maximization and taxi driver revenue maximization are achieved. A passenger malice booking phenomenon is avoided, and a scheduling system resource is saved.
Description
Technical field
The invention belongs to dispatching communication field, particularly relate to a kind of scheduling controlling disposal route and system.
Background technology
At present, when passenger needs to call a taxi, subscribed to taxi dispatching center requests by phone, taxi dispatching center is according to the position of passenger and periphery taxi no-load condition, the license plate number of the unloaded taxi that signal passengers is subscribed, meanwhile, also inform the contact method of unloaded cab-getter, thus complete reservation.
When passenger has specific demand, the type of hiring a car can be selected, such as: electricity recall hire a car, common taxi.
But technique scheme does not also disclose: according to the individual demand of passenger's pending transactions, realize the Dynamic Selection to taxi by dispatching system, rational allocation taxi resource, realizes the maximization of taxi maximum resource utilization and taxi driver's income.
Through retrieval, find one section of patent, patent name: based on the point-to-point taxi taking platform (application number: 201110268992.2 applyings date: 2011-09-13) of smart mobile phone, applicant: Liu Jinbao, the patent describes following technical scheme:
A kind of point-to-point taxi taking platform based on smart mobile phone, it comprises passenger's client, central dispatching server, taxi driver's client, passenger's client is connected with one end of central dispatching server, the other end of central dispatching server and taxi driver's client's side link, passenger's client and taxi driver's client are intelligent mobile phone terminal, intelligent mobile phone terminal is provided with the application software based on intelligent operating system, passenger users sends by the function button clicked on software the request of calling a taxi in passenger's client, intelligent mobile phone terminal sends passenger users positional information automatically based on the application software of intelligent operating system, after central dispatching server receives passenger users positional information, according to the positional information of passenger users, the taxi of Auto-matching around it, load corresponding scheduling rule, filter out multiple stage taxi according to scheduling rule, the information of calling a taxi of passenger users and user's current location information are sent to the multiple stage taxi filtered out, taxi driver's client receives passenger users and calls a taxi after information and user's current location information, prompting taxi driver whether order, taxi driver can determine whether to be ready order according to oneself current situation and wish, if be ready order, then whether be ready that the click of order interface is option, the selection of taxi driver can be sent to central dispatching server, and the taxi information that all order selections are options by central dispatching server returns to passenger users, passenger users selects a taxi according to the information oneself of the taxi of order wish that has seen, the selection of passenger users can be sent to central dispatching server, passenger users is selected to be transmitted to taxi driver's client by central dispatching server, after taxi driver completes Confirmation of Orders, the phone of user is sent to taxi driver's client by central dispatching server, will confirm that the taxi license plate number of order issues passenger's client.
But technique scheme does not also disclose: according to the individual demand of passenger's pending transactions, realize the Dynamic Selection to taxi by dispatching system, rational allocation taxi resource, realizes the maximization of taxi maximum resource utilization and taxi driver's income.
Summary of the invention
The invention provides a kind of scheduling controlling disposal route and system, to solve the problem.
The invention provides a kind of scheduling controlling disposal route and system.Said method comprises the following steps:
After strategy controller receives the authentication request of passenger's client transmission, by its inner counter arranged, if judge, the number of times that described passenger's client refusal pushes is less than the first preset value, the affairs importance rate that then passenger's client is selected according to passenger is classified, reservation request is sent to counter, wherein, positional information and the affairs importance rate classified information of passenger's client is carried in described reservation request;
After described counter receives described reservation request, according to the classification of affairs importance rate and transaction level coefficient vs table, determine corresponding transaction level coefficient; And according to transaction level coefficient and the required time degree scope table of comparisons, determine corresponding required time degree scope and be sent to comparer;
After described counter receives described reservation request, determine each unloaded taxi positional information and according to positional information, each the unloaded taxi positional information of passenger's client obtained, determine distance between each unloaded taxi and passenger's client and according to distance and the distance coefficient table of comparisons, determine distance coefficient;
Described counter is according to the road speed limit between taxi and passenger's client and according to speed limit and speed limit coefficient vs table, determine speed limit coefficient;
Described counter, according to described distance coefficient and described speed limit coefficient, is determined supplier's time coefficient of each unloaded taxi and is sent to comparer;
Described comparer compares the required time degree scope of acquisition and supplier's time coefficient of each unloaded taxi, according to default selection strategy, determine target taxi and described required time degree scope and described target taxi information are sent to Information Push Server;
Described Information Push Server is according to the required time degree scope obtained, described target taxi information, required time degree scope and the information pushing table of comparisons, determine information to be pushed and send described information to be pushed to described passenger's client, wherein, the attribute information of target taxi is carried in described information to be pushed;
If described passenger's client refusal, then described passenger's client sends refusal response respectively to described strategy controller, described Information Push Server, counter in described strategy controller adds 1, described first preset value is more than or equal to if judge, then described strategy controller sends inhibit command to described counter, forbid that described counter again receives the reservation request of described passenger's client transmission or sends inhibit command directly to described passenger's client, forbid that described passenger's client sends reservation request again.
The present invention also provides a kind of scheduling controlling disposal system, comprising: passenger's client, counter, comparer, Information Push Server, strategy controller; Described passenger's client is connected with comparer by counter; Described Information Push Server is connected with described passenger's client, described comparer respectively; Described strategy controller is connected with described passenger's client, described counter respectively;
Described passenger's client, for sending authentication request to strategy controller; Also receive the authentication request of passenger's client transmission for strategy controller after, by its inner counter arranged, if judge, the number of times that described passenger's client refusal pushes is less than the first preset value, then according to the affairs importance rate classification that passenger selectes, reservation request is sent to counter, wherein, positional information and the affairs importance rate classified information of passenger's client is carried in described reservation request; Also for receiving the information to be pushed that described Information Push Server sends; Also for sending refusal response respectively to described strategy controller, described Information Push Server; Also for receiving the inhibit command that described strategy controller sends;
Described counter, after receiving described reservation request, according to the classification of affairs importance rate and transaction level coefficient vs table, determines corresponding transaction level coefficient; And according to transaction level coefficient and the required time degree scope table of comparisons, determine corresponding required time degree scope and be sent to comparer; Also for after receiving described reservation request, determine each unloaded taxi positional information and according to positional information, each the unloaded taxi positional information of passenger's client obtained, determine distance between each unloaded taxi and passenger's client and according to distance and the distance coefficient table of comparisons, determine distance coefficient; Also for according to speed limit and speed limit coefficient vs table, determining speed limit coefficient according to the road speed limit between taxi and passenger's client; Also for according to described distance coefficient and described speed limit coefficient, determine supplier's time coefficient of each unloaded taxi and be sent to comparer; Also for receiving the inhibit command that described strategy controller sends;
Described comparer, for receive described counter send required time degree scope and each unloaded taxi supplier's time coefficient after, the required time degree scope relatively obtained and supplier's time coefficient of each unloaded taxi, according to default selection strategy, determine target taxi and described required time degree scope and described target taxi information are sent to Information Push Server;
Described Information Push Server, for the required time degree scope according to acquisition, described target taxi information, required time degree scope and the information pushing table of comparisons, determine information to be pushed and send described information to be pushed to described passenger's client, wherein, the attribute information of target taxi is carried in described information to be pushed; Also for receiving the refusal response that described passenger's client sends;
Described strategy controller, after receiving authentication request that passenger's client sends, by its inner counter arranged, judges whether the number of times that described passenger's client refusal pushes is less than the first preset value; After receiving the response of described passenger's client refusal, counter adds 1, described first preset value is more than or equal to if judge, then send inhibit command to described counter, forbid that described counter again receives the reservation request of described passenger's client transmission or sends inhibit command directly to described passenger's client, forbid that described passenger's client sends reservation request again.
Compared to prior art, according to a kind of scheduling controlling disposal route provided by the invention and system, after strategy controller receives the authentication request of passenger's client transmission, by its inner counter arranged, if judge, the number of times that described passenger's client refusal pushes is less than the first preset value, the affairs importance rate that then passenger's client is selected according to passenger is classified, and sends reservation request to counter, after described counter receives described reservation request, according to the classification of affairs importance rate and transaction level coefficient vs table, determine corresponding transaction level coefficient, and according to transaction level coefficient and the required time degree scope table of comparisons, determine corresponding required time degree scope and be sent to comparer, after described counter receives described reservation request, determine each unloaded taxi positional information and according to positional information, each the unloaded taxi positional information of passenger's client obtained, determine distance between each unloaded taxi and passenger's client and according to distance and the distance coefficient table of comparisons, determine distance coefficient, described counter is according to the road speed limit between taxi and passenger's client and according to speed limit and speed limit coefficient vs table, determine speed limit coefficient, described counter, according to described distance coefficient and described speed limit coefficient, is determined supplier's time coefficient of each unloaded taxi and is sent to comparer, described comparer compares the required time degree scope of acquisition and supplier's time coefficient of each unloaded taxi, according to default selection strategy, determine target taxi and described required time degree scope and described target taxi information are sent to Information Push Server, described Information Push Server is according to the required time degree scope obtained, described target taxi information, required time degree scope and the information pushing table of comparisons, determine information to be pushed and send described information to be pushed to described passenger's client, if described passenger's client refusal, then described passenger's client is respectively to described strategy controller, described Information Push Server sends refusal response, counter in described strategy controller adds 1, described first preset value is more than or equal to if judge, then described strategy controller sends inhibit command to described counter, forbid that described counter again receives the reservation request of described passenger's client transmission or sends inhibit command directly to described passenger's client, forbid that described passenger's client sends reservation request again, achieve the individual demand according to passenger's pending transactions, the Dynamic Selection to taxi is realized by dispatching system, rational allocation taxi resource, realize the maximization of taxi maximum resource utilization and taxi driver's income, the phenomenon simultaneously preventing passenger's malice to subscribe, has saved schedules system resources.
Accompanying drawing explanation
Accompanying drawing described herein is used to provide a further understanding of the present invention, and form a application's part, schematic description and description of the present invention, for explaining the present invention, does not form inappropriate limitation of the present invention.In the accompanying drawings:
Figure 1 shows that the process flow diagram realizing scheduling controlling disposal route that preferred embodiment according to the present invention provides;
Figure 2 shows that the structural drawing realizing scheduling controlling disposal system that preferred embodiment according to the present invention provides.
Embodiment
Hereinafter also describe the present invention in detail with reference to accompanying drawing in conjunction with the embodiments.It should be noted that, when not conflicting, the embodiment in the application and the feature in embodiment can combine mutually.
Figure 1 shows that the process flow diagram realizing scheduling controlling disposal route that preferred embodiment according to the present invention provides.As shown in Figure 1, what preferred embodiment of the present invention provided realizes scheduling controlling disposal route, comprises step 101 ~ 108.
In step 101, after strategy controller receives the authentication request of passenger's client transmission, by its inner counter arranged, if judge, the number of times that described passenger's client refusal pushes is less than the first preset value, the affairs importance rate that then passenger's client is selected according to passenger is classified, send reservation request to counter, wherein, in described reservation request, carry positional information and the affairs importance rate classified information of passenger's client.
Wherein, passenger's client sends authentication request to strategy controller, after described strategy controller receives described authentication request, by its inner counter arranged, judge whether the number of times that described passenger's client refusal pushes is less than the first preset value, if be more than or equal to, then described strategy controller sends inhibit command to described passenger's client, forbids that described passenger's client sends reservation request; If be less than described first preset value, then described strategy controller sends authorized order to described passenger's client, and allow described passenger's client to send reservation request, wherein, the first preset value is Operation system setting, such as: 3.
Wherein, passenger's client is intelligent mobile phone terminal, intelligent mobile phone terminal is provided with the application software based on intelligent operating system, passenger users sends reservation request in passenger's client by the function button clicked on software, wherein, positional information and the affairs importance rate classified information of passenger's client is carried in described reservation request.
Wherein, operation system of smart phone includes but not limited to the operating systems such as Android, IOS, Symbian.
Wherein, the classification of described affairs importance rate comprises following four classes: important and urgent, insignificant and urgent, important and non-emergent, insignificant and non-emergent.
In step 102, after described counter receives described reservation request, according to the classification of affairs importance rate and transaction level coefficient vs table, determine corresponding transaction level coefficient; And according to transaction level coefficient and the required time degree scope table of comparisons, determine corresponding required time degree scope and be sent to comparer;
The classification of affairs importance rate and transaction level coefficient vs table
| Affairs importance rate is classified | Transaction level coefficient |
| Important and urgent | 1.0 |
| Insignificant and urgent | 0.6 |
| Important and non-emergent | 0.4 |
| Insignificant and non-emergent | 0.1 |
Table 1
Table 1 illustrates: the classification of affairs importance rate and transaction level coefficient vs table include the corresponding relation of the classification of affairs importance rate and transaction level coefficient, and wherein, affairs importance rate is higher, and transaction level coefficient is larger.
Above-mentioned affairs importance rate classification, the concrete numerical value of transaction level coefficient can set as required, and the present embodiment will not limit its scope.
Transaction level coefficient and the required time degree scope table of comparisons
| Transaction level coefficient | Required time degree scope |
| 1.0 | 0＜P≤0.2 |
| 0.6 | 0.2＜P≤0.4 |
| 0.4 | 0.4＜P≤0.6 |
| 0.1 | P＞0.6 |
Table 2
Table 2 illustrates: transaction level coefficient and the required time degree scope table of comparisons comprise the corresponding relation of transaction level coefficient and required time degree scope, and wherein, transaction level coefficient is higher, need time degree scope less.
The concrete numerical value of above-mentioned transaction level coefficient, required time degree scope can be arranged as required, and the present embodiment will not limit its scope.
Step 103: after described counter receives described reservation request, determine each unloaded taxi positional information and according to positional information, each the unloaded taxi positional information of passenger's client obtained, determine distance between each unloaded taxi and passenger's client and according to distance and the distance coefficient table of comparisons, determine distance coefficient;
Specified otherwise one: taxi driver's client is intelligent mobile phone terminal, intelligent mobile phone terminal is provided with the application software based on intelligent operating system, taxi driver's client is in running status all the time, at regular intervals (such as: 2 minutes), unloaded information and positional information is sent from trend counter.
Wherein, operation system of smart phone includes but not limited to the operating systems such as Android, IOS, Symbian.
Specified otherwise two: described counter, according to positional information, each the unloaded taxi positional information of passenger's client obtained, is determined distance between each unloaded taxi and passenger's client and according to distance and the distance coefficient table of comparisons, determines distance coefficient; Wherein, when having mulitpath between taxi and passenger's client, according to shortest path selection strategy, select shortest path, as the distance between taxi and passenger's client; Certainly, also can take other selection strategy, the present embodiment will not limit.
Distance and the distance coefficient table of comparisons
| Distance (unit: km) between taxi and passenger's client | Distance coefficient |
| X＞75 | 1.0 |
| 50＜X≤75 | 0.6 |
| 25＜X≤50 | 0.2 |
| 0＜X≤25 | 0.1 |
Table 3
Table 3 illustrates: described distance and the distance coefficient table of comparisons comprise the corresponding relation of distance between taxi and passenger's client and distance coefficient, and wherein, the distance between taxi and passenger's client is far away, and distance coefficient is larger.
The concrete numerical value of the distance between above-mentioned taxi and passenger's client, distance coefficient, can set as required, and the present embodiment will not limit its scope.
Step 104: described counter is according to the road speed limit between taxi and passenger's client and according to speed limit and speed limit coefficient vs table, determine speed limit coefficient;
Speed limit and speed limit coefficient vs table
| Road speed limit (unit: km/h) between taxi and passenger's client | Speed limit coefficient |
| Y＞80 | 1.0 |
| 60＜Y≤80 | 0.6 |
| 40＜Y≤60 | 0.4 |
| 0＜Y≤40 | 0.1 |
Table 4
Wherein, described speed limit and speed limit coefficient vs table comprise the corresponding relation of road speed limit between taxi and passenger's client and speed limit coefficient, and wherein, the road speed limit between taxi and passenger's client is higher, and speed limit coefficient is larger.
Road speed limit between above-mentioned taxi and passenger's client, the concrete numerical value of speed limit coefficient, can set as required, the present embodiment will not limit its scope.
Wherein, step 102,103,104 does not have strict time sequencing, can carry out simultaneously.
Step 105: described counter, according to described distance coefficient and described speed limit coefficient, is determined supplier's time coefficient of each unloaded taxi and is sent to comparer;
Wherein, described counter, according to described distance coefficient and described speed limit coefficient, determines that the process of supplier's time coefficient of each unloaded taxi is: supplier's time coefficient=(distance coefficient)/(speed limit coefficient)
Step 106: described comparer compares the required time degree scope of acquisition and supplier's time coefficient of each unloaded taxi, according to default selection strategy, determine target taxi and described required time degree scope and described target taxi information are sent to Information Push Server;
Wherein, described comparer compares the required time degree scope of acquisition and supplier's time coefficient of each unloaded taxi, according to default selection strategy, determines that the process of target taxi is:
If supplier's time coefficient of multiple unloaded taxi all falls into described required time degree scope, then taxi corresponding to supplier's time coefficient of minimum value is selected to be target taxi.
If supplier's time coefficient of single unloaded taxi falls into described required time degree scope, then this unloaded taxi is target taxi.
Wherein, target taxi information comprises: license plate number, this taxi contact method.
Step 107: described Information Push Server is according to the required time degree scope obtained, described target taxi information, required time degree scope and the information pushing table of comparisons, determine information to be pushed and send described information to be pushed to described passenger's client, wherein, the attribute information of target taxi is carried in described information to be pushed.
Wherein, carry the attribute information of target taxi in described information to be pushed, wherein, attribute information comprises: paying price, license plate number, target taxi contact method.
Wherein, described required time degree scope and the information pushing table of comparisons comprise the corresponding relation of required time degree scope and information to be pushed.
Required time degree scope and the information pushing table of comparisons
Table 5
Step 108: if described passenger's client refusal, then described passenger's client sends refusal response respectively to described strategy controller, described Information Push Server, counter in described strategy controller adds 1, described first preset value is more than or equal to if judge, then described strategy controller sends inhibit command to described counter, forbid that described counter again receives the reservation request of described passenger's client transmission or sends inhibit command directly to described passenger's client, forbid that described passenger's client sends reservation request again.
Wherein, if described passenger's client refusal, then described passenger's client sends refusal response respectively to described strategy controller, described Information Push Server, and the counter in described strategy controller adds 1 and judges whether refusal number of times exceedes described first preset value; If be less than described first preset value, then send authorized order to described passenger's client, allow described passenger's client again to send reservation request; If be more than or equal to described first preset value, then described strategy controller sends inhibit command to described counter, forbid that described counter again receives the reservation request of described passenger's client transmission or sends inhibit command directly to described passenger's client, forbid that described passenger's client sends reservation request again.
Illustrate below, be described in detail:
Passenger A sends authentication request by passenger's client to strategy controller, after described strategy controller receives described authentication request, by its inner counter arranged, judge whether the number of times that described passenger's client refusal pushes is less than the first preset value, if be more than or equal to, then described strategy controller sends inhibit command to described passenger's client, forbids that described passenger's client sends reservation request; If be less than described first preset value, then described strategy controller sends authorized order to described passenger's client, and allow described passenger's client to send reservation request, wherein, the first preset value is Operation system setting, such as: 3.
If be less than the first preset value, then passenger A sends reservation request by intelligent mobile phone terminal, wherein, carries the positional information W of passenger's client and affairs importance rate classified information (such as: important and urgent) in described reservation request.
After counter receives reservation request, according to the classification of affairs importance rate and transaction level coefficient vs table (table 1), determine corresponding transaction level coefficient 1.0; And according to transaction level coefficient and the required time degree scope table of comparisons (table 2), determine corresponding required time degree scope 0 < P≤0.2 and required time degree scope 0 < P≤0.2 of the correspondence determined is sent to comparer;
After counter receives reservation request, determine that each unloaded taxi positional information is (for 3 unloaded taxis (taxi 1, taxi 2, taxi 3), position is respectively W1, W2, W3) and according to the positional information (W) of passenger's client obtained, each unloaded taxi positional information (W1, W2, W3), determine distance between each unloaded taxi and passenger's client and according to distance and the distance coefficient table of comparisons (table 3), determine distance coefficient;
If there are three paths D1, D2, D3 between W1 to W, are respectively 40 km, 50 km, 60 km, get shortest path 40km, then distance coefficient is 0.2;
If there are two paths M1, M2 between W2 to W, be respectively 20km, 30km, get shortest path 20km, then distance coefficient is 0.1;
If there is a paths Q between W3 to W, distance is 70km, then distance coefficient is 0.6.
Counter is according to the road speed limit between taxi and passenger's client and according to speed limit and speed limit coefficient vs table (table 4), determine speed limit coefficient;
If D3 speed limit is 120 km/h; M1 speed limit 80 km/h; Q speed limit 100km/h, then D3 speed limit coefficient is 1.0; M1 speed limit coefficient 0.6; Q speed limit coefficient 1.0.
Counter, according to distance coefficient and speed limit coefficient, determines that the process of supplier's time coefficient of each unloaded taxi is:
Supplier's time coefficient=(distance coefficient)/(speed limit coefficient)=0.2/1.0=0.2 of taxi 1
Supplier's time coefficient=(distance coefficient)/(speed limit coefficient)=0.1/0.6=0.17 of taxi 2
Supplier's time coefficient=(distance coefficient)/(speed limit coefficient)=0.6/1.0=0.6 of taxi 3
Supplier's time coefficient of each the unloaded taxi above-mentioned determined is sent to comparer by counter.
Comparer compares required time degree scope 0 < P≤0.2 of acquisition and supplier's time coefficient of each unloaded taxi, judge to hire a car supplier's time coefficient of 1, supplier's time coefficient of taxi 2 all fall into the required time degree scope determined, according to minimum value selection strategy, select taxi corresponding to supplier's time coefficient of minimum value to be target taxi and taxi 2 and required time degree scope 0 < P≤0.2 of correspondence and the information such as the number-plate number, contact method of taxi 2 are sent to Information Push Server.
Required time degree scope 0 < P≤0.2 of Information Push Server according to acquisition and the number-plate number, the contact method of taxi 2, by searching required time degree scope and the information pushing table of comparisons (table 5), the information to be pushed determined is: this taxi (taxi 2) number-plate number is XXX; Contact method is YYYY; This taxi starting fare 3 yuan and every kilometer than normal taxi many receipts 0.3 yuan higher than normal taxi starting fare.
If passenger A refuses described propelling movement by described passenger's client, then send refusal response respectively to described strategy controller, described Information Push Server;
Counter in described strategy controller adds 1 and compares with described first preset value (if 3), if be less than described first preset value, then described strategy controller sends authorized order to described passenger's client, allows described passenger's client again to send reservation request; If be more than or equal to described first preset value, then described strategy controller sends inhibit command to described counter, forbid that described counter again receives the reservation request of described passenger's client transmission or sends inhibit command directly to described passenger's client, forbid that described passenger's client sends reservation request again.
Figure 2 shows that the structural drawing realizing scheduling controlling disposal system that preferred embodiment according to the present invention provides.As shown in Figure 2, what preferred embodiment of the present invention provided realize scheduling controlling disposal system comprises: passenger's client 101, counter 102, comparer 103, Information Push Server 104, strategy controller 105; Described passenger's client 101 is connected with comparer 103 by counter 102; Described Information Push Server 104 is connected with described passenger's client 101, described comparer 103 respectively; Described strategy controller 105 is connected with described passenger's client 101, described counter 102 respectively;
Described passenger's client 101, for sending authentication request to strategy controller 105; Also receive the authentication request of passenger's client 101 transmission for strategy controller 105 after, by its inner counter arranged, if judge, the number of times that described passenger's client 101 refusal pushes is less than the first preset value, then according to the affairs importance rate classification that passenger selectes, reservation request is sent to counter 102, wherein, positional information and the affairs importance rate classified information of passenger's client 101 is carried in described reservation request; Also for receiving the information to be pushed that described Information Push Server 104 sends; Also for sending refusal response respectively to described strategy controller 105, described Information Push Server 104; Also for receiving the inhibit command that described strategy controller 105 sends;
Described counter 102, after receiving described reservation request, according to the classification of affairs importance rate and transaction level coefficient vs table, determines corresponding transaction level coefficient; And according to transaction level coefficient and the required time degree scope table of comparisons, determine corresponding required time degree scope and be sent to comparer 103; Also for after receiving described reservation request, determine each unloaded taxi positional information and according to positional information, each the unloaded taxi positional information of passenger's client 101 obtained, determine distance between each unloaded taxi and passenger's client 101 and according to distance and the distance coefficient table of comparisons, determine distance coefficient; Also for according to speed limit and speed limit coefficient vs table, determining speed limit coefficient according to the road speed limit between taxi and passenger's client 101; Also for according to described distance coefficient and described speed limit coefficient, determine supplier's time coefficient of each unloaded taxi and be sent to comparer 103; Also for receiving the inhibit command that described strategy controller 105 sends;
Described comparer 103, for receive described counter 102 send required time degree scope and each unloaded taxi supplier's time coefficient after, the required time degree scope relatively obtained and supplier's time coefficient of each unloaded taxi, according to default selection strategy, determine target taxi and described required time degree scope and described target taxi information are sent to Information Push Server 104;
Described Information Push Server 104, for the required time degree scope according to acquisition, described target taxi information, required time degree scope and the information pushing table of comparisons, determine information to be pushed and send described information to be pushed to described passenger's client 101, wherein, the attribute information of target taxi is carried in described information to be pushed; Also for receiving the refusal response that described passenger's client sends;
Described strategy controller 105, after receiving authentication request that passenger's client 101 sends, by its inner counter arranged, judges whether the number of times that described passenger's client 101 refusal pushes is less than the first preset value; After receiving the response of described passenger's client 101 refusal, counter adds 1, described first preset value is more than or equal to if judge, then send inhibit command to described counter 102, forbid that described counter 102 again receives the reservation request of described passenger's client 101 transmission or sends inhibit command directly to described passenger's client 101, forbid that described passenger's client 101 sends reservation request again.
In sum, according to a kind of scheduling controlling disposal route provided by the invention and system, after strategy controller receives the authentication request of passenger's client transmission, by its inner counter arranged, if judge, the number of times that described passenger's client refusal pushes is less than the first preset value, the affairs importance rate that then passenger's client is selected according to passenger is classified, and sends reservation request to counter, after described counter receives described reservation request, according to the classification of affairs importance rate and transaction level coefficient vs table, determine corresponding transaction level coefficient, and according to transaction level coefficient and the required time degree scope table of comparisons, determine corresponding required time degree scope and be sent to comparer, after described counter receives described reservation request, determine each unloaded taxi positional information and according to positional information, each the unloaded taxi positional information of passenger's client obtained, determine distance between each unloaded taxi and passenger's client and according to distance and the distance coefficient table of comparisons, determine distance coefficient, described counter is according to the road speed limit between taxi and passenger's client and according to speed limit and speed limit coefficient vs table, determine speed limit coefficient, described counter, according to described distance coefficient and described speed limit coefficient, is determined supplier's time coefficient of each unloaded taxi and is sent to comparer, described comparer compares the required time degree scope of acquisition and supplier's time coefficient of each unloaded taxi, according to default selection strategy, determine target taxi and described required time degree scope and described target taxi information are sent to Information Push Server, described Information Push Server is according to the required time degree scope obtained, described target taxi information, required time degree scope and the information pushing table of comparisons, determine information to be pushed and send described information to be pushed to described passenger's client, if described passenger's client refusal, then described passenger's client is respectively to described strategy controller, described Information Push Server sends refusal response, counter in described strategy controller adds 1, described first preset value is more than or equal to if judge, then described strategy controller sends inhibit command to described counter, forbid that described counter again receives the reservation request of described passenger's client transmission or sends inhibit command directly to described passenger's client, forbid that described passenger's client sends reservation request again, achieve the individual demand according to passenger's pending transactions, the Dynamic Selection to taxi is realized by dispatching system, rational allocation taxi resource, realize the maximization of taxi maximum resource utilization and taxi driver's income, the phenomenon simultaneously preventing passenger's malice to subscribe, has saved schedules system resources.
The foregoing is only the preferred embodiments of the present invention, be not limited to the present invention, for a person skilled in the art, the present invention can have various modifications and variations.Within the spirit and principles in the present invention all, any amendment done, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (8)
1. a scheduling controlling disposal route, is characterized in that, comprises the following steps:
After strategy controller receives the authentication request of passenger's client transmission, by its inner counter arranged, if judge, the number of times that described passenger's client refusal pushes is less than the first preset value, the affairs importance rate that then passenger's client is selected according to passenger is classified, reservation request is sent to counter, wherein, positional information and the affairs importance rate classified information of passenger's client is carried in described reservation request;
After described counter receives described reservation request, according to the classification of affairs importance rate and transaction level coefficient vs table, determine corresponding transaction level coefficient; And according to transaction level coefficient and the required time degree scope table of comparisons, determine corresponding required time degree scope and be sent to comparer;
After described counter receives described reservation request, determine each unloaded taxi positional information and according to positional information, each the unloaded taxi positional information of passenger's client obtained, determine distance between each unloaded taxi and passenger's client and according to distance and the distance coefficient table of comparisons, determine distance coefficient;
Described counter is according to the road speed limit between taxi and passenger's client and according to speed limit and speed limit coefficient vs table, determine speed limit coefficient;
Described counter, according to described distance coefficient and described speed limit coefficient, is determined supplier's time coefficient of each unloaded taxi and is sent to comparer;
Described comparer compares the required time degree scope of acquisition and supplier's time coefficient of each unloaded taxi, according to default selection strategy, determine target taxi and described required time degree scope and described target taxi information are sent to Information Push Server;
Described Information Push Server is according to the required time degree scope obtained, described target taxi information, required time degree scope and the information pushing table of comparisons, determine information to be pushed and send described information to be pushed to described passenger's client, wherein, the attribute information of target taxi is carried in described information to be pushed;
If described passenger's client refusal, then described passenger's client sends refusal response respectively to described strategy controller, described Information Push Server, counter in described strategy controller adds 1, described first preset value is more than or equal to if judge, then described strategy controller sends inhibit command to described counter, forbid that described counter again receives the reservation request of described passenger's client transmission or sends inhibit command directly to described passenger's client, forbid that described passenger's client sends reservation request again;
Wherein, described comparer compares the required time degree scope of acquisition and supplier's time coefficient of each unloaded taxi, according to default selection strategy, determines that the process of target taxi is:
If supplier's time coefficient of multiple unloaded taxi all falls into described required time degree scope, if then select taxi corresponding to supplier's time coefficient of minimum value to be that supplier's time coefficient of target taxi or single unloaded taxi falls into described required time degree scope, then this unloaded taxi is target taxi.
2. method according to claim 1, is characterized in that, the classification of described affairs importance rate comprises following four classes: important and urgent, insignificant and urgent, important and non-emergent, insignificant and non-emergent.
3. method according to claim 2, is characterized in that, described counter, according to described distance coefficient and described speed limit coefficient, determines that the process of supplier's time coefficient of each unloaded taxi is:
Supplier's time coefficient=(distance coefficient)/(speed limit coefficient).
4. method according to claim 1, is characterized in that, carries the attribute information of target taxi in described information to be pushed, and wherein, attribute information comprises: paying price, license plate number, target taxi contact method.
5. method according to claim 4, it is characterized in that, described affairs importance rate classification and transaction level coefficient vs table include the corresponding relation of the classification of affairs importance rate and transaction level coefficient, wherein, affairs importance rate is higher, and transaction level coefficient is larger;
Described transaction level coefficient and the required time degree scope table of comparisons comprise the corresponding relation of transaction level coefficient and required time degree scope, and wherein, transaction level coefficient is higher, need time degree scope less;
Described distance and the distance coefficient table of comparisons comprise the corresponding relation of distance between taxi and passenger's client and distance coefficient, and wherein, the distance between taxi and passenger's client is far away, and distance coefficient is larger;
Described speed limit and speed limit coefficient vs table comprise the corresponding relation of road speed limit between taxi and passenger's client and speed limit coefficient, and wherein, the road speed limit between taxi and passenger's client is higher, and speed limit coefficient is larger.
6. method according to claim 5, is characterized in that, when having mulitpath between taxi and passenger's client, selects shortest path, as the distance between taxi and passenger's client.
7. method according to claim 6, is characterized in that, described required time degree scope and the information pushing table of comparisons comprise the corresponding relation of required time degree scope and information to be pushed.
8. a scheduling controlling disposal system, is characterized in that, comprising: passenger's client, counter, comparer, Information Push Server, strategy controller; Described passenger's client is connected with comparer by counter; Described Information Push Server is connected with described passenger's client, described comparer respectively; Described strategy controller is connected with described passenger's client, described counter respectively;
Described passenger's client, for sending authentication request to strategy controller; Also receive the authentication request of passenger's client transmission for strategy controller after, by its inner counter arranged, if judge, the number of times that described passenger's client refusal pushes is less than the first preset value, then according to the affairs importance rate classification that passenger selectes, reservation request is sent to counter, wherein, positional information and the affairs importance rate classified information of passenger's client is carried in described reservation request; Also for receiving the information to be pushed that described Information Push Server sends; Also for sending refusal response respectively to described strategy controller, described Information Push Server; Also for receiving the inhibit command that described strategy controller sends;
Described counter, after receiving described reservation request, according to the classification of affairs importance rate and transaction level coefficient vs table, determines corresponding transaction level coefficient; And according to transaction level coefficient and the required time degree scope table of comparisons, determine corresponding required time degree scope and be sent to comparer; Also for after receiving described reservation request, determine each unloaded taxi positional information and according to positional information, each the unloaded taxi positional information of passenger's client obtained, determine distance between each unloaded taxi and passenger's client and according to distance and the distance coefficient table of comparisons, determine distance coefficient; Also for according to speed limit and speed limit coefficient vs table, determining speed limit coefficient according to the road speed limit between taxi and passenger's client; Also for according to described distance coefficient and described speed limit coefficient, determine supplier's time coefficient of each unloaded taxi and be sent to comparer; Also for receiving the inhibit command that described strategy controller sends;
Described comparer, for receive described counter send required time degree scope and each unloaded taxi supplier's time coefficient after, the required time degree scope relatively obtained and supplier's time coefficient of each unloaded taxi, according to default selection strategy, determine target taxi and described required time degree scope and described target taxi information are sent to Information Push Server;
Described Information Push Server, for the required time degree scope according to acquisition, described target taxi information, required time degree scope and the information pushing table of comparisons, determine information to be pushed and send described information to be pushed to described passenger's client, wherein, the attribute information of target taxi is carried in described information to be pushed; Also for receiving the refusal response that described passenger's client sends;
Described strategy controller, after receiving authentication request that passenger's client sends, by its inner counter arranged, judges whether the number of times that described passenger's client refusal pushes is less than the first preset value; After receiving the response of described passenger's client refusal, counter adds 1, described first preset value is more than or equal to if judge, then send inhibit command to described counter, forbid that described counter again receives the reservation request of described passenger's client transmission or sends inhibit command directly to described passenger's client, forbid that described passenger's client sends reservation request again;
Wherein, described comparer compares the required time degree scope of acquisition and supplier's time coefficient of each unloaded taxi, according to default selection strategy, determines that the process of target taxi is:
If supplier's time coefficient of multiple unloaded taxi all falls into described required time degree scope, if then select taxi corresponding to supplier's time coefficient of minimum value to be that supplier's time coefficient of target taxi or single unloaded taxi falls into described required time degree scope, then this unloaded taxi is target taxi.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210517348.9A CN103021168B (en) | 2012-12-06 | 2012-12-06 | Method and system for scheduling control processing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210517348.9A CN103021168B (en) | 2012-12-06 | 2012-12-06 | Method and system for scheduling control processing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103021168A CN103021168A (en) | 2013-04-03 |
| CN103021168B true CN103021168B (en) | 2014-12-17 |
Family
ID=47969724
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210517348.9A Expired - Fee Related CN103021168B (en) | 2012-12-06 | 2012-12-06 | Method and system for scheduling control processing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103021168B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104915839B (en) * | 2015-04-22 | 2018-06-26 | 北京嘀嘀无限科技发展有限公司 | A kind of order method for pushing and device |
| CN105070038B (en) * | 2015-07-18 | 2020-11-24 | 太仓市简汇信息技术有限公司 | Public transport operation monitoring method |
| CN104992554B (en) * | 2015-07-18 | 2020-11-20 | 太仓市简汇信息技术有限公司 | Abnormal information monitoring method for car sharing system |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TW200708431A (en) * | 2005-08-19 | 2007-03-01 | Jetpo Technology Inc | Traffic information monitoring and personalized reporting system |
| CN101287157A (en) * | 2008-05-27 | 2008-10-15 | 黄国灿 | Bi-end satellite positioning communication and cab scheduling method and system by centralized scheduling |
| CN101661666A (en) * | 2008-08-27 | 2010-03-03 | 中兴通讯股份有限公司 | Taxi call center system and implementation method thereof |
| CN101510353A (en) * | 2009-01-24 | 2009-08-19 | 中国移动通信集团广东有限公司珠海分公司 | Taxi electric attraction system and method for implementing taxi electric attraction using the same |
| JP2011169620A (en) * | 2010-02-16 | 2011-09-01 | Hitachi Automotive Systems Ltd | System and method for controlling dynamic status |
| CN102737501B (en) * | 2012-06-12 | 2015-02-04 | 中国联合网络通信集团有限公司 | Taxi passenger carrying scheduling method and system and scheduling server |
-
2012
- 2012-12-06 CN CN201210517348.9A patent/CN103021168B/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN103021168A (en) | 2013-04-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103021167B (en) | Method and system for taxi information interaction | |
| CN102737501B (en) | Taxi passenger carrying scheduling method and system and scheduling server | |
| CN105761482B (en) | The real-time reserving method of taxi and system based on fairness | |
| CN103035122B (en) | Based on the taxi automatic calling system of smart mobile phone | |
| CN1165014C (en) | Method and apparatus for communication within a vehicle dispatch system | |
| CN106240385B (en) | Method and apparatus for charging station monitoring | |
| CN102340738A (en) | Point-to-point taxi taking platform based on intelligent mobile phone | |
| CN105489001A (en) | Taxi scheduling optimization method and system | |
| CN110705753A (en) | Vehicle scheduling method and device based on scheduling model, computer equipment and storage medium | |
| CN103049817B (en) | Demand type shared transportation service method combined with load balancing mechanism | |
| CN107767322B (en) | Carpooling method and device | |
| CN105096588A (en) | OBD module group-based vehicle scheduling method, apparatus and system | |
| CN103021168B (en) | Method and system for scheduling control processing | |
| CN103021172B (en) | Method and system for taxi scheduling | |
| CN109920071B (en) | Preferential parking management method, parking management terminal and readable storage medium | |
| CN103021170B (en) | Information interaction method and system | |
| CN103035118B (en) | Dispatch control method for taxis and system thereof | |
| CN204719792U (en) | A kind of taxi pooling system based on software of calling a taxi | |
| CN103035119B (en) | Dispatch control method for taxis and system thereof | |
| CN103956044A (en) | Intelligent taxi on-call system and method based on mobile internet | |
| CN111325436A (en) | Network appointment vehicle co-operation passenger matching method and system, storage medium and server | |
| CN103021169B (en) | Scheduling method and scheduling system | |
| CN103035120B (en) | Dispatch control method and system | |
| CN103020884A (en) | Information interaction control method and system | |
| CN203165207U (en) | Taxi automation paging system based on intelligent mobile phone |
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: Liu Shenghai Inventor before: Xie Jingyu |
|
| CB03 | Change of inventor or designer information | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20170918 Address after: 414000, No. 5, No. 114, G District, Zhongnan market, Yueyang Economic Development Zone, Hunan, China Patentee after: Yueyang Baide Electronic Technology Co. Ltd. Address before: Suzhou City, Jiangsu Province, Suzhou Industrial Park 215021 Xinghu Street No. 328 Chongwen Road, Guohua building A511 Patentee before: Suzhou Yibei Information Technology Co., Ltd. |
|
| TR01 | Transfer of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20141217 Termination date: 20171206 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |