JPH10293900A - Method and device for determining allocated vehicle - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide the method for decreasing the total value of a travel distance and hours in an empty state on the whole when a vehicle to be allocated is selected when the vehicle is allocated more than once among candidate vehicles. SOLUTION: A travel time calculating means 25 calculates the time of travels from respective vehicles to a vehicle allocation request position based upon actual routes. A vehicle congestion degree arithmetic means 30 calculates the congestion degree of vehicles whose travel time are shorter than a certain value. An allocated vehicle determining means 27 selects the vehicle which has the largest degree of vehicle congestion and the shortest travel time as an allocated vehicle.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a vehicle allocation method and a vehicle allocation device for allocating vehicles such as taxis.

[0002]

2. Description of the Related Art Conventionally, this type of apparatus has been configured as shown in FIG. FIG. 8 is a block diagram showing a configuration of a vehicle management system used in a conventional vehicle allocation method.

[0003] The vehicle management system is basically a vehicle-mounted device 10 mounted on each vehicle and transmitting the position of the vehicle, and a vehicle allocation that receives the vehicle position from each vehicle-mounted device 10 and distributes and manages the vehicle to each vehicle. And a vehicle determination device 20.

[0004] The on-vehicle device 10 includes a vehicle position detecting means 11 for detecting the position of the vehicle mounted on the vehicle, and dynamic conditions such as an empty vehicle (in a state where no passengers are loaded) and an actual vehicle (in a state where passengers are loaded). Dynamic state detection means 12 for detecting
A wireless unit 13 for transmitting the position / dynamic information detected by the vehicle position detecting unit 11 and the dynamic situation detecting unit 12 by performing modulation processing such as FM or AM on a carrier wave, and
A transmission / reception antenna 14 disposed outside the vehicle.

[0005] As the vehicle position detecting device 11, a vehicle-mounted navigation device using a global positioning system (GPS) or a beacon provided along the side of the road is used. As the dynamic state detecting means 12, for example, a toll meter or the like is used. Used. Further, the vehicle allocation determining device 20 includes a transmitting / receiving antenna 21 and the transmitting / receiving antenna 2
Wireless means 22 for demodulating the transmission signal received from the in-vehicle device 10 and outputting it as vehicle position / dynamic information
And a vehicle position management unit 23 for receiving vehicle position information from the wireless unit 22 as needed and managing them. A vehicle allocation position specifying means 24 for specifying a vehicle allocation request position by inputting through a keyboard or the like;
And a travel time calculating means 25 for inputting a vehicle allocation request position obtained from the vehicle allocation request position obtained from the vehicle allocation request specifying means 24 and calculating a travel time from the vehicle allocation request position to each vehicle. Further, a map database 26 in which road information necessary for the travel time calculation means 25 to calculate the travel time is compiled into a database, and a travel time from each vehicle obtained from the travel time calculation means 25 to the dispatch request position is obtained. And vehicle allocation means 27 for determining a vehicle to be actually allocated. Further, a display means 28 for displaying a required map read from the map database 26 and displaying each vehicle managed by the vehicle position management means 23 on the map so as to be superimposed on the map; The vehicle has a dispatch instruction means 29 for communicating via the wireless means 22 that the vehicle is selected as a dispatch vehicle.

[0006] The conventional vehicle management system having such a configuration operates as follows.

The vehicle position / dynamic detection signals detected by the vehicle position detecting means 11 and the dynamic state detecting means 12 of the on-vehicle apparatus 10 of each vehicle are transmitted by the wireless means 13 to the dispatched vehicle determining apparatus 20 via the transmitting / receiving antenna 14. Is done. The vehicle allocation / vehicle determination device 20 receives a vehicle position / dynamic detection signal sequentially transmitted from a plurality of vehicles by a wireless unit 22 via a transmission / reception antenna 21, and receives the vehicle position / dynamic detection signal from the wireless unit 22. The management unit 23 is notified.

In normal times, a required map read from the map database 26 is displayed, and each vehicle managed by the vehicle position management means 23 is superimposed on the map based on the position information, and the vehicle is displayed on the display means 28. Perform mark display. At this time, the display is performed by changing the color of the vehicle mark according to the dynamic situation. The position / dynamic information from each in-vehicle device 10 is transmitted to the dispatch vehicle determining device 20 every 30 seconds, for example, and the vehicle position is displayed on the display means 28 in real time at the time interval.

[0009] When a vehicle allocation request is received from a customer, the vehicle allocation determination device 20 operates as shown in FIG. 9 below. FIG. 9 is a flowchart showing an outline of the operation of the vehicle allocation determination device 20.

In step S1, the worker in the dispatching vehicle determination device 20 confirms the dispatch requesting position, which is the position where the customer requests dispatch, the customer's name, and the like. I do. The dispatch request position obtained here is transmitted to the travel time calculating means 25.

In step S2, travel time calculating means 25
Obtains the dispatch request position from the dispatch position specifying means 24 and acquires the vehicle position of each empty vehicle from the vehicle position managing means 23.

In step S3, travel time calculating means 25
Performs a route search from the vehicle allocation request position obtained from the vehicle allocation position specifying means 24 to each empty vehicle position obtained by the vehicle position management means 23 using the map database 26. The travel time is calculated and the result is transmitted to the assigned vehicle determining means 27.

In step S4, the assigned vehicle determining means 27 obtains the minimum value of the travel time obtained from the travel time calculating means 25, selects the vehicle having the minimum travel time as the assigned vehicle, and Number display means 28
Send to.

In step S5, the vehicle number and the like of the vehicle selected as the dispatched vehicle are displayed on the display means 28.
Based on the information, the worker of the dispatching vehicle determination device 20 gives information on the location of the dispatch request position and the name of the dispatch request customer to the vehicle selected as the dispatch vehicle via the dispatch instruction means 29. The notification is made by voice, for example.

[0015]

However, in the above-mentioned conventional dispatched vehicle determining apparatus, when selecting a dispatched vehicle, a vehicle whose travel time from the dispatch request position to the empty vehicle position is minimized is simply selected as the dispatched vehicle. Therefore, in a single dispatching process, it is possible to reduce the distance and time that the vehicle travels in an empty state (with no passengers), but if multiple dispatching processes are taken into account, the vehicle will As a result, a problem occurs that the total value of the distance and the time that the vehicle runs in an empty state becomes large as a result.

That is, an empty vehicle selected as a vehicle to be allocated is in an actual vehicle state (a state where passengers are being loaded) from the time when the vehicle starts moving to the vehicle allocation request position until the passenger is disembarked, and becomes a candidate vehicle for vehicle allocation. I can't get it. Therefore, immediately after a vehicle having no other vacant vehicles in the vicinity (a vehicle distant from other vacant vehicles = a vehicle in a region where the vehicle density is low) is selected as a vehicle to be allocated, a vehicle allocation request in the vicinity of the vehicle is requested. Occurs, there is no vacant vehicle nearby, so an vacant vehicle located away from the dispatch request position must be selected as a dispatch vehicle. as a result,
The mileage in the empty state in the two dispatching processes
The total value of time increases.

An example of the above problem will be specifically described with reference to FIGS. FIG. 10 is a state diagram of a route search used for selecting a dispatched vehicle, and FIG. 11 is a state diagram showing a result of selecting a dispatched vehicle. In FIGS. 10 and 11, D
1, D2 indicates a dispatch request position from the customer, and C1 to C2
Reference numeral 5 denotes a vehicle position. R11 to R15 represent routes from the vehicles C1 to C5 to the dispatch request position D1, and R22 represents a route from C2 to the dispatch request position D2. Actually, the travel time differs even for the same route distance depending on the type of road (expressway, national road, prefectural road, etc.) and the width of the road. However, here, for simplification of explanation, the road type and width are all the same. Accordingly, the route distance is proportional to the travel time, and the shorter the route distance, the shorter the travel time.

First, it is assumed that a dispatch request has occurred at the dispatch request position D1 in FIG. When selecting a vehicle to be dispatched, the travel time is calculated by the route searching means 25 based on the actual route from each of the empty vehicles C1 to C5 to the dispatch request position D1, and the result is shown by R11 in FIG. To R15.

Here, for simplicity of explanation, the road type,
Since the widths are all the same, R11 having the shortest route distance minimizes the travel time, and therefore, C1 is selected as the vehicle to be dispatched to the dispatch request position D1. Next, it is assumed that a dispatch request has been issued to the dispatch request position D2. Since the vehicle C1 is selected as a dispatch vehicle to the dispatch request position D1 and is in the actual vehicle state, the candidate vehicles for dispatch are C2 to C5, and the actual routes from the vacant vehicles C2 to C5 to the dispatch request position D2. The travel time calculation based on the travel time is performed by the route search means 25 in the same manner as in the case of the dispatch request position D1. In this case, C2 with the shortest route distance is selected as the dispatched vehicle.

As a result, as shown in FIG. 11, the vehicle dispatched to the dispatch request position D1 is C1, and the route from the vehicle C1 to the dispatch request position D1 is R11. Similarly, the vehicle dispatched to the dispatch request position D2 is C2, and the route from the vehicle C2 to the dispatch request position D2 at that time is R22. As is clear from the figure, it can be seen that the route of R22 is very long, which indicates that the moving distance of the vehicle in a state where no passengers can be loaded (= empty state) is long, For a customer, they would have to wait a long time before arriving at a taxi, and for a taxi company, they would waste fuel.

As described above, in the conventional dispatched vehicle determination device, the vehicle whose travel time from the dispatch request position to the vacant vehicle position is the minimum is simply selected as the dispatched vehicle. If you go, the total value of the mileage and time in the empty state will be large, and the dispatcher will have to wait a long time before arriving at the taxi, and at the same time, the fuel cost for the taxi company There was a problem of wasting.

The present invention solves the above-mentioned conventional problem. When selecting a vehicle to be dispatched from a plurality of candidate vehicles when dispatching the vehicle a plurality of times, the vehicle as a whole is assumed to be empty. An object of the present invention is to provide a dispatched vehicle determination method and a dispatched vehicle determination device that can reduce the total value of the traveling distance and time.

[0023]

In order to achieve the above object, according to the first aspect of the present invention, the total number of vehicles existing within a certain range around a specific vehicle position is calculated as a vehicle density. A configuration is adopted in which vehicles to be dispatched are selected based on the vehicle density and the travel time from the specific vehicle position to the dispatch destination position.

According to a sixth aspect of the present invention, there is provided a vehicle position detecting means for specifying each vehicle position, and a total number of vehicles existing within a certain range around the specific vehicle position detected by the vehicle position detecting means. Is calculated as a vehicle density, a travel time calculating means for calculating a travel time from the specific vehicle position to the allocation target position, and a vehicle to be dispatched is selected based on the calculated vehicle density and the travel time. And a vehicle allocation means.

According to these configurations, even if the travel time is not the shortest, a vehicle existing in an area where the vehicle density is high can be selected as a dispatched vehicle from among the vehicles having the shortest travel time. When the vehicle allocation processing is performed, the total value of the travel distance and time in the empty state can be reduced as a whole. Specifically, as in the second aspect of the present invention, a vehicle whose vehicle density is equal to or more than a certain value and whose travel time is equal to or less than a certain value may be selected as a dispatch vehicle.

Further, the invention according to claim 3 is configured to calculate the vehicle density based on the distance from the specific vehicle position to the candidate vehicle position or the estimated travel time. The distance may be an actual distance along the road or a straight distance. According to the latter, the calculation becomes easier.

With this configuration, a specific reference for calculating the vehicle density is provided. In this case, in particular,
There is an advantage that the vehicle density can be easily obtained with almost no load on the vehicle density calculation.

Further, the invention described in claim 4 is configured such that the calculation of the vehicle density is performed based on the total sum of the distances from the specific vehicle position to the candidate vehicle position or the total sum of the estimated travel time.

According to this configuration, although the load of the vehicle density calculation is slightly generated, the vehicle density can be obtained in detail.

According to a fifth aspect of the present invention, in the first aspect of the present invention, the vehicle density is calculated only for the candidate vehicles whose travel time to the vehicle allocation destination position is equal to or less than a predetermined threshold. The configuration was adopted.

According to this configuration, the candidate vehicles to be dispatched are narrowed down according to the magnitude of the travel time to the dispatch location, instead of calculating the vehicle density for all the vehicles.
Since the vehicle density can be calculated only for those vehicles, the calculation load can be reduced.

[0032]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS A dispatched vehicle deciding device for implementing the dispatched vehicle deciding method and the dispatched vehicle deciding device of the present invention will be described below with reference to the drawings.

FIG. 1 is a block diagram showing a configuration of a dispatched vehicle determining apparatus using the dispatched vehicle determining method of the present invention. The same means as in the conventional example shown in FIG. 8 will be described using the same reference numerals.

In FIG. 1, the on-vehicle device 10 includes a vehicle position detecting means 11, a dynamic state detecting means 12, and a radio transmitting apparatus 1.
3 and a transmission / reception antenna 14, and their configurations are the same as in the conventional example. In addition, the vehicle allocation determining device 20
Is a transmitting / receiving antenna 21, a radio means 22, a vehicle position management means 23, a vehicle allocation position specifying means 24, a travel time calculation means 25, a map database 26, a vehicle allocation vehicle determination means 27,
A display means 28 and a dispatch instruction means 29 are provided, and their configurations are the same as those of the conventional example. The present embodiment is different from the conventional example in that the assigned vehicle determining device 20 is further provided with a vehicle density calculating unit 30 for calculating the vehicle density.

Next, the operation of the dispatched vehicle determining device configured as described above will be described.

The vehicle position / dynamic detection signal detected by the vehicle position detecting means 11 and the dynamic state detecting means 12 of the on-vehicle apparatus 10 mounted on each vehicle is transmitted by the wireless means 13 via the transmitting / receiving antenna 14 to the dispatching vehicle determining apparatus 20. Sent to. The dispatching vehicle determination device 20 receives a vehicle position / dynamic detection signal sequentially transmitted from a plurality of vehicles by a wireless unit 22 via a transmission / reception antenna 21, and transmits the vehicle position / dynamic information to the vehicle position management unit 23 from the wireless unit 22. A movement detection signal is transmitted.

Normally, each vehicle managed by the vehicle position management means 23 is superimposed on the map data read from the map database 26 on the display means 28 based on the position information received from each in-vehicle device 10. The vehicle mark is displayed. At this time, the display is performed by changing the color of the vehicle mark according to the dynamic situation. The position / dynamic information from each in-vehicle device 10 is transmitted to the dispatching vehicle determination device 20, for example, every 30 seconds, and the vehicle position is displayed on the display means 28 in real time at the time interval. The above operation is the same as in the conventional example.

Next, the operation of the dispatched vehicle determination device 20 when there is a dispatch request from a customer will be described with reference to the flowchart shown in FIG.

In step S1, the dispatched vehicle determining device 20
The worker confirms the dispatch request position, which is the position at which the customer is requesting the dispatch, the name of the customer, etc., and performs an input operation on the dispatch location specifying means 24. The dispatch request position obtained here is transmitted to the travel time calculating means 25.

In step S2, the travel time calculating means 25
Obtains the dispatch request position from the dispatch position specifying means 24 and acquires the vehicle position of each empty vehicle from the vehicle position managing means 23.

In step S3, the travel time calculation means 25
Performs a route search from the vehicle allocation request position obtained from the vehicle allocation position specifying means 24 to each empty vehicle position obtained by the vehicle position management means 23 using the map database 26. Calculate the travel time up to.

In step S4, the travel time calculating means 25
Stores the minimum value of the travel time determined in step S3 in the shortest travel time register MIN_T, and sets 300 seconds (5 minutes) as the value of the threshold value k for vehicle density calculation determination.

In step S5, the travel time calculating means 25
Performs a search for vehicles satisfying T (i) <MIN_T + k (vehicles with a travel time to the dispatch request position that are shortest to some extent), and finds the vehicle number of the vehicle that satisfies the condition and the travel time to the dispatch request position. It is transmitted to the vehicle density calculating means 30.

In step S6, the vehicle density calculating means 3
0 determines whether or not a plurality of vehicle numbers and travel times to the dispatch request position have been received from the travel time calculation means 25. If there are a plurality of travel times, the process proceeds to step S7, and only information for one vehicle is received. If not, the process proceeds to step S11.

In step S7, the vehicle density calculating means 3
In the case of “0”, the vehicle density D (i) of the vehicle received from the travel time calculation unit 25 is obtained by calculating the vehicle position information from the vehicle position management unit 23, and is transmitted to the dispatched vehicle determination unit 27.

In step S8, the dispatched vehicle determining means 27
Sets the maximum value of the vehicle density received from the vehicle density calculating means 30 in the vehicle density maximum value register MAX_D.

In step S9, the vehicle allocation determining means 27
In step S10, it is determined whether there are a plurality of vehicles having a vehicle density equal to the value set in the maximum vehicle density register MAX_D.
The process proceeds to step S11 if there is a plurality.

In step S10, since the number of vehicles with D (i) = MAX_D (= the vehicle with the highest vehicle density) has been reduced to one, the vehicle is selected as a vehicle to be dispatched, and the vehicle number of the vehicle is selected. And the like are transmitted to the display means 28.

In step S11, a vehicle satisfying D (i) = MAX_D and T (i) = MIN_T is selected as a dispatched vehicle, and the vehicle number of the vehicle is transmitted to the display means 28. That is, the vehicle with the highest vehicle density and the shortest travel time to the dispatch request position is selected as the dispatch vehicle.

In step S12, the number of vehicles satisfying T (i) = MIN_T is reduced to one (when there is an opening in the second shortest travel time compared to the shortest travel time to the dispatch request position). The vehicle is selected as a dispatch vehicle, and the vehicle number and the like of the vehicle are transmitted to the display means 28.

In step S13, the vehicle number and the like of the vehicle selected as the vehicle to be dispatched are displayed on the display means 28. Based on the information, the worker of the dispatched vehicle determination device 20 transmits the information via the dispatch instruction means 29. For the vehicle selected as the vehicle allocation vehicle, information about the location of the vehicle allocation request position and the name and the like of the vehicle allocation request customer are reported, for example, by voice.

The vehicle density is small when there are few other vehicles around the own vehicle (the vehicle density is low), and there are many other vehicles around the own vehicle (the vehicle density is high). ) May be used. Three calculation methods for the vehicle density will be described with reference to FIGS. 3, 4, and 5. FIG. In the figure, C
Represents a vehicle.

First, FIG. 3 is a conceptual diagram showing a method of calculating the number of other vehicles existing in a certain area around the own vehicle position as the vehicle density. For example, the number of other vehicles existing in a rectangular area centered on the own vehicle position is defined as the vehicle density. In FIG. 9, the areas A10, A20, A
Reference numeral 30 denotes a rectangular area centered on the vehicles C10, C20, and C30, respectively. The vehicle C is counted by counting the number of vehicles other than C10 existing in the rectangular area A10.
Ten vehicle densities are determined.

Similarly, the vehicle density of the vehicles C20 and C30 can be obtained, and the vehicle density of C10 =
4, vehicle density of C20 = 3, vehicle density of C30 =
3, which results in the highest vehicle density of C10.

According to this method, the vehicle density can be obtained simply by comparing the magnitude relationship between the X coordinate and the Y coordinate of each vehicle position. It has features that can be calculated. Note that, for example, a circle or the like can be used as the shape of the area centered on the own vehicle position.

Next, FIG. 4 is a conceptual diagram showing a method of calculating the sum of the linear distances from the own vehicle position to another vehicle as the vehicle density. In FIG. 4, D11 to D14 represent the linear distances from the vehicles C11, C12, C13, and C14 to C10, and similarly, D21 to D23 represent the vehicle Cs.
21, C22, and C23 represent the linear distance from D20, and D31 to D33 are the respective vehicles C31, C32, C
Represents the linear distance from 33 to C30.

For example, regarding the vehicle density of C10,
Calculate the respective linear distances (D11, D12, D13, D14) from C10 to C11, C12, C13, C14, and sum them (= D11 + D12 + D13 + D14)
Is multiplied by a negative value as the vehicle density.
The vehicle density of C20 and C30 can be calculated in the same manner as C10.

When the method of calculating the number of other vehicles existing in a certain area centered on the own vehicle position described in FIG. 3 as the vehicle density is used, the result is that the vehicle density of C10 is the highest. However, when the sum of the linear distances from the own vehicle position to the other vehicle is calculated as the vehicle density, the sum of the linear distances from C20 to the other vehicle is small, and the result is that the vehicle density of C20 is the highest.

To calculate the linear distance, the X coordinate of each vehicle position,
It is necessary to calculate the sum of squares of the differences between the Y coordinates, which places some load on the device for calculating the vehicle density. However, the number of other vehicles existing in a certain area centered on the own vehicle position is determined by the vehicle density. According to the method of calculating the degree, the obtained vehicle density becomes highly accurate.

Finally, FIG. 5 is a conceptual diagram showing a method of calculating the total travel time along the route from the own vehicle position to another vehicle as the vehicle density. In FIG. 5, T11 to T14 represent travel time along the route from each vehicle C11, C12, C13, C14 to C10, and similarly, T2
1 to T23 are the respective vehicles C21, C22, C23 to C2.
Represents the travel time along the route to 0, from T31 to T
Reference numeral 33 denotes a travel time along a route from each of the vehicles C31, C32, C33 to C30.

For example, regarding the vehicle density of C10,
As shown in FIG. 5, C10 to C11, C12, C1
3, a route search for C14 is performed, and the other vehicles C11, C12, C13, and C1 are searched from C10 by the route search.
Each travel time along the route up to 4 (T11, T12, T
13, T14), and sum the sum (T11 + T12 +
The value obtained by multiplying T13 + T14) by a negative value is used as the vehicle density. The vehicle density of C20 and C30 can be calculated in the same manner as C10.

Since the present method has to perform a route search between vehicles, a higher load is applied to the device for calculating the vehicle density than the above two methods, but the actual vehicle moves along the route. Therefore, this method using the total travel time along the route can obtain the most accurate value as the vehicle density. Further, instead of the total travel time along the route, a total distance along the route can be used.

Hereinafter, the selection of a specific vehicle in the vehicle allocation method and apparatus according to the present invention will be described with reference to FIGS. 2, 6, 7, and 10. FIG. Here, the calculation of the vehicle density is performed based on the number of other vehicles existing in a rectangular area centered on the own vehicle position. FIG. 6 is a conceptual diagram in the case where the number of other vehicles existing in a rectangular area centered on the own vehicle position is calculated as the vehicle density, and FIG. 7 is a conceptual diagram illustrating a traveling route of a dispatched vehicle. The areas A1, A2, and A3 correspond to the vehicles C1, C2, and C, respectively.
3 represents a rectangular area for calculating the vehicle density with the center at 3.

First, in step S1, a dispatch request position D1
Are identified, and in steps S2, the positions C1, C
2, C3, C4, and C5 are obtained.

Next, in step S3, each empty vehicle C1
The travel time is calculated by the route search means based on the actual route from the vehicle to C5 to the dispatch request position D1, and the result of the route search is calculated from R11 to R11 shown in FIG.
It becomes 15. Here, T (R11) is defined as the travel time of the route R11. Similarly, T (R12), T (R13), T (R
14), T (R15) is defined. Here, since the road type and the width are all the same for the sake of simplicity, the route R11 with the shortest distance becomes the route with the shortest travel time,
The minimum travel time to the dispatch request position D1 is T (R1
1), the vehicle is C1.

Next, at step S4, MIN_T = T (R
11), and k = 300 seconds.

In step S5, each of the vehicles C1, C2, C
Travel times T (R11), T (R12), T (R13), T along the route from 3, C4, C5 to the dispatch request position D1
(R14) and T (R15) having a value smaller than MIN_T + k are searched. Here, T (R11), T (R
12) It is assumed that the value of T (R13) is smaller than MIN_T + k. That is, the vehicle numbers of the vehicles C1, C2, and C3 and the travel time T (R11) to the dispatch request position of each vehicle,
T (R12) and T (R13) are transmitted to the vehicle density calculating means.

In step S6, the vehicle density calculating means calculates the vehicle numbers of the plurality of vehicles (C1, C2, C3) and the travel time (T (R11), T (R11)) of the travel time to the dispatch request position of each vehicle.
(R12) and T (R13)), and the process proceeds to step S7.

In step S7, each vehicle (C1, C2,
Regarding C3), the calculation of the vehicle density is performed. In the calculation of the vehicle density, as shown in FIG. 6, the number of other vehicles existing in a rectangular area centered on the own vehicle position is set as the vehicle density, and the vehicle C1 is calculated.
Is counted by counting the number of vehicles other than C1 existing in the rectangular area A1 centered on the vehicle density D (C1) =
0 can be obtained. Similarly, by counting the number of other vehicles existing in the rectangular areas A2, A3, C2, C
3, the vehicle density D (C2) = 3 and D (C3) = 2 can be obtained. The maximum value of the vehicle density is D (C2) = 3.

In step S8, MAX_D = D (C2)
And

In step S9, the vehicle satisfying D (i) = MAX_D is only D (C2), and it is determined that a plurality of vehicles do not exist. Therefore, the process proceeds to step S10, and C2 is selected as a vehicle allocation vehicle.

Next, it is assumed that a dispatch request has been issued to the dispatch request position D2. Since the vehicle C2 is selected as a vehicle to be dispatched to the dispatch request position D1 and is in an actual vehicle state, the candidate vehicles for dispatch are C1, C3, C4, and C5, and the actual route from those vehicles to the dispatch request position D2. Is calculated in the same manner as in the case of the dispatch request position D1 (step 3).

Here, the routes from the vehicles C1, C3, C4, C5 to the dispatch request position D2 are indicated by R21, R2, respectively.
3, R24, R25, and the travel times along those routes are T (R21), T (R23), T (R24), T (R25)
And Since the length of R21 is overwhelmingly shorter than R23, R24, and R25, the value of the travel time T (R21) from the vehicle C1 to the dispatch request position D2 is also the value of the travel to the dispatch request position D2 of another vehicle. Obviously, it is much smaller than time.

Accordingly, in step S4, T (R21) is set as MIN_T, and k = 300 seconds is set.

In step S5, T (i) <MIN_T +
The search for vehicles satisfying the condition of k is performed. However, since the vehicles other than C1 (C3, C4, and C5) are too far from the dispatch request position D2, only the vehicle satisfying this condition is C1. In S12, C1 is used as the dispatch vehicle.
Is selected.

As a result, as shown in FIG. 7, the vehicle dispatched to the dispatch request position D1 becomes C2 and the dispatch request position D
The vehicle assigned to 2 is C1. The route from the vehicle C2 to the dispatch request position D1 at this time is R12, and the vehicle C1
Assuming that the route from to the dispatch request position D2 is R21, the distance traveled by the vehicle selected as the dispatch vehicle to reach the dispatch request position is R12 + R21.

As is clear from the comparison between FIG. 6 and FIG. 11, according to the present invention, the moving distance R11 + R22 obtained by simply selecting the vehicle to be dispatched based on the travel time to the dispatch request position becomes shorter. I have.

[0078]

As is apparent from the above description, according to the present invention, the vehicle which travels to the dispatch request position is not simply selected as the dispatch vehicle with the shortest travel time to the dispatch request position. Since the vehicles to be dispatched are selected based on the time and the vehicle density of each vehicle, the vehicles can be kept in a flickering state as much as possible, and it is possible to quickly respond to dispatch requests from any position. become. As a result, the total value of the mileage and time when the vehicle is empty can be reduced, the waiting time until the taxi arrives for the dispatcher, the improvement of service to the customer and the reduction of fuel cost for the taxi company. This can lead to reductions and more efficient use of vehicles.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a configuration of a vehicle allocation determination device of the present invention.

FIG. 2 is a flowchart of the operation of the vehicle allocation determination device of the present invention.

FIG. 3 is a conceptual diagram of a method for calculating a vehicle density according to the present invention.

FIG. 4 is a conceptual diagram of a method for calculating a vehicle density according to the present invention.

FIG. 5 is a conceptual diagram of a method for calculating a vehicle density according to the present invention.

FIG. 6 is a conceptual diagram of a method for calculating a vehicle density according to the embodiment of the present invention.

FIG. 7 is a diagram showing a result of selecting a dispatched vehicle according to the present invention.

FIG. 8 is a block diagram showing a configuration of a conventional vehicle allocation determination device.

FIG. 9 is a flowchart of the operation of the conventional vehicle allocation determination device.

FIG. 10 is a conceptual diagram of a route search when selecting a dispatched vehicle.

FIG. 11 is a diagram showing a result of conventional vehicle allocation.

[Explanation of symbols]

 REFERENCE SIGNS LIST 10 vehicle-mounted device 20 dispatched vehicle determination device 25 travel time calculation means 27 dispatched vehicle determination means 30 vehicle density calculation means A rectangular area around each vehicle C vehicles D1, D2 dispatch request position D vehicles C11 to C14 to C10 R Distance from the dispatch request position to each vehicle T Travel time

Claims (6)

[Claims] 1. The method according to claim 1, further comprising calculating a total number of vehicles existing within a certain range centered on the specific vehicle position as a vehicle density, and determining a vehicle allocation based on the vehicle density and a travel time from the specific vehicle position to a vehicle allocation target position. A vehicle allocation method for selecting vehicles. 2. The vehicle density is equal to or higher than a predetermined value, and
2. The dispatch vehicle determination method according to claim 1, wherein a vehicle whose travel time is equal to or less than a predetermined value is selected as a dispatch vehicle. 3. The method according to claim 2, wherein the calculation of the vehicle density is performed based on a distance from a specific vehicle position to a candidate vehicle position or an estimated travel time. 4. The vehicle allocation method according to claim 2, wherein the calculation of the vehicle density is performed based on the sum of the distances from the specific vehicle position to the candidate vehicle position or the sum of the estimated travel time. 5. The vehicle allocation method according to claim 1, wherein the vehicle density is calculated only for candidate vehicles whose travel time to the vehicle allocation destination position is equal to or less than a predetermined threshold. 6. A vehicle position detecting means for specifying each vehicle position, and a vehicle for calculating as a vehicle density the total number of vehicles existing within a certain range around the specific vehicle position detected by the vehicle position detecting means. A density calculating means, a travel time calculating means for calculating a travel time from the specific vehicle position to the allocation destination position, and a dispatched vehicle selecting means for selecting a dispatched vehicle based on the calculated vehicle density and the travel time. A vehicle allocation determining device, wherein: