Taxi dispatching to a region

• US 8,469,153 B2
• Filed: 06/24/2010
• Issued: 06/25/2013
• Est. Priority Date: 07/03/2009
• Status: Active Grant

• Current Assignee: SHIH Hua Technology Limited
• Original Assignee: SHIH Hua Technology Limited
• Inventors: Wu, Jen-Chang
• Primary Examiner(s): SALATA, ANTHONY J
• Application Number:
  US12/822,752
• Publication Number:
  US 20110000747A1
• Time in Patent Office: 1,097 Days
• Field of Search: 187/247, 187380-389, 187391-393, 705 711- 714, 705/7.22, 705/13, 701116-119, 701/32.3, 701/33.4, 701/410, 701/411, 701420-422, 701/482, 701/532, 701/533, 340/8.1, 340988-994
• US Class Current: 187/383
• CPC Class Codes: G06Q 10/04 Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" market predictions or forecasting for commercial activities G06Q30/0202

Abstract

The present invention is related to a dispatching system for car assignment method. The method includes: (a) setting a set number based a history data, wherein the history data records a time and a location of each dispatching car event happening, the set number is an average number of dispatching car events that happen in a special time segment and in the region; (b) determining whether or not the first number is larger than the set number; (c) not issuing a dispatching car information when the first number is larger than the set number; and (d) issuing a dispatching car information and assigning a second number of cars to the region when the first number is less than the set number. Moreover, a dispatching apparatus to perform the dispatching car method is also provided.

Claims

1. A car assignment method for assigning a car to a region, wherein the region includes a first number of cars, comprising:

(a) setting a set number based a history data, wherein the history data records a time and a location of each dispatching car event happening, the set number is an average number of dispatching car events that happen in a special time segment and in the region;

(b) determining whether or not the first number is larger than the set number, wherein a dispatching car information is not issued when the first number is larger than the set number, and wherein a dispatching car information is issued and assigns a second number of cars to the region when the first number is less than the set number;

(c) determining whether or not a dispatching car event happens in the region, wherein a dispatching car information is not issued when the dispatching car event does not happen in the region, and wherein the step (b) is performed again when the dispatching car event happens in the region; and

(d) determining whether or not a response is made to the dispatching car event, wherein a dispatching car information is not issued when a response to the dispatching car event is made, and wherein a dispatching car information is issued and assigned a third number of cars to the region when a response to the dispatching car event is not made.

2. The car assignment method of claim 1, wherein the second number of cars is determined by the formula:

insufficient number×

parameter +N

wherein the insufficient number is the difference between the set number and the first number, the N is the basic number to assign cars to this region, wherein the N and the parameter are related to the region.

3. The car assignment method of claim 1, wherein the third number of cars is determined by the formula:

unsuccessful response number×

parameter +N

wherein the unsuccessful response number is a number of dispatching car events that is not made response to in a time segment, the N is the basic number to assign cars to this region, wherein the N and the parameter are related to the region.

4. The car assignment method of claim 1, wherein the unsuccessful response number is two dispatching car events that are not responded to in five minutes.

5. A car assignment apparatus for assigning a car to a region, comprising:

a plurality of car machines disposed in a plurality of cars respectively, wherein the car machines detect location data of the cars;

a receiving/sending server communication with the car machines through a base station, the car machines send the location data to the receiving/sending server;

a car position calculation unit timely gathering the positions from the receiving/sending server to identify positions of the cars;

a parameter database for storing the positions of the cars;

a calculation server timely gathers the positions of the cars from the parameter database to calculate a first number of the cars in a region and compares the first number with a set number to decide a difference number between the first number and the set number;

a dispatching center assigning a second number of cars to the region when the first number is less than the set number; and

a dispatching database to store a history data and a dispatching car event, wherein the history data records a time and a location of each dispatching car event happening, the set number is an average number of dispatching car events happens in a special time segment and in the region.

6. The car assignment apparatus of claim 5, wherein the difference number is sent back to the parameter database and the difference number is applied to a formula to decide a number of cars that are informed dispatching car information, wherein the number of cars that are informed dispatching car information is determined by the formula:

difference number×

parameter +N

wherein the difference number is the difference between the set number and the first number, the N is the basic number to assign cars to this region, wherein the N and the parameter are related to the region.

7. The car assignment apparatus of claim 6, wherein the car machines communicate with the calculation server through the receiving/sending server and the base station.

8. The car assignment apparatus of claim 7, wherein the first number, the set number and the difference number are shown in a display of the car machine.

9. The car assignment apparatus of claim 5, wherein the special time segment is one hour.

10. The car assignment apparatus of claim 5, wherein when the calculation server detects the dispatching database has a dispatching car event happen in a region, the calculation server gathers the positions of the cars from the parameter database to calculate a second number of the cars in the region and compares the second number with the set number to decide a difference number between the second number and the set number.

11. The car assignment apparatus of claim 5, wherein when the calculation server detects the dispatching database has a dispatching car event happens in a region and a response to the real time dispatching car event is not made, the calculation server assigns a third number of cars to the region.

12. The car assignment apparatus of claim 11, wherein the third number of cars is determined by the formula:

unsuccessful response number×

parameter +N

wherein the unsuccessful response number is a number of dispatching car events that is not responded to in a time segment, the N is the basic number to assign car to this region, wherein the N and the parameter are related to the region.

13. The car assignment apparatus of claim 12, wherein the unsuccessful response number is two dispatching car events that are not responded to in five minutes.