CN112949967B

CN112949967B - Vehicle scheduling processing device, vehicle scheduling method, and vehicle scheduling program

Info

Publication number: CN112949967B
Application number: CN202011243131.4A
Authority: CN
Inventors: 猪饲功
Original assignee: JVCKenwood Corp
Current assignee: JVCKenwood Corp
Priority date: 2019-11-26
Filing date: 2020-11-09
Publication date: 2023-08-18
Anticipated expiration: 2040-11-09
Also published as: CN112949967A

Abstract

The invention relates to a vehicle scheduling processing device, a vehicle scheduling method, and a vehicle scheduling program. A vehicle scheduling processing device includes: a dispatch instruction unit that, when a dispatch request to a dispatch location in a first one of the plurality of divided areas occurs in a business area in which a predetermined number of vehicles are allocated to each of the plurality of divided areas, executes a first dispatch mode in which a vehicle in an empty state allocated to the first divided area is dispatched to the dispatch location or a second dispatch mode in which a vehicle in an empty state existing at a location closest to the dispatch location is dispatched to the dispatch location; and an adjustment unit that adjusts, when vehicles allocated to a second divided area different from the first divided area are scheduled to the scheduling position in the second scheduling mode, between the first divided area and the second divided area such that the number of vehicles allocated to the first divided area per unit area decreases and the number of vehicles allocated to the second divided area per unit area increases.

Description

Vehicle scheduling processing device, vehicle scheduling method, and vehicle scheduling program

Technical Field

The invention relates to a vehicle scheduling processing device, a vehicle scheduling method, and a vehicle scheduling program.

Background

There is known a vehicle scheduling system that acquires and manages position information and dynamic information of a service vehicle such as a taxi equipped with a GPS (Global Positioning System ) and can schedule the vehicle to a specified position of a customer.

For example, in the vehicle scheduling system described in patent document 1, a business area is divided into a plurality of divided areas, and the divided area to which each vehicle belongs is set so that the vehicle in an empty state runs in the divided area to which the vehicle belongs. In this state, when the user makes a scheduling request to the scheduling center by telephone, the vehicle belonging to the same divided area as the scheduling position is scheduled.

In the vehicle scheduling system described in patent document 2, when there is a scheduling request from a mobile terminal having a GPS function, position information of a scheduling position is detected using the GPS, vehicles existing in the entire business area are selected, and vehicles closest to the scheduling position are scheduled.

Prior art literature

Patent document

Patent document 1: japanese patent application laid-open No. 2015-158830

Patent document 2: japanese patent application laid-open No. 2011-248848.

Disclosure of Invention

Problems to be solved by the invention

In recent years, a vehicle dispatching system has been proposed in which the vehicle dispatching system described in patent document 1 and the vehicle dispatching system described in patent document 2 are used in parallel. In this vehicle scheduling system, there is a problem in that fairness of the vehicle scheduling number between the divided areas allocated to the crews of the vehicle is impaired.

The present invention has been made in view of the above-described problems, and an object thereof is to provide a vehicle scheduling system, a vehicle scheduling method, and a vehicle scheduling program that can suppress a loss of fairness in the number of vehicle schedules between divided areas.

Means for solving the problems

The present invention relates to a vehicle scheduling apparatus including: a scheduling instruction unit configured to execute a first scheduling mode or a second scheduling mode when a scheduling request for a scheduling position in a first divided area among a plurality of divided areas of a business area is generated in the business area divided into the plurality of divided areas and a predetermined number of vehicles are allocated to each of the divided areas, the first scheduling mode being a mode in which the vehicles allocated to the first divided area are scheduled to the scheduling position, and the second scheduling mode being a mode in which the vehicles existing at a position closest to the scheduling position are scheduled to the scheduling position; and an adjustment unit that, when the vehicle allocated to a second divided area different from the first divided area in the second scheduling mode is scheduled to the scheduling position, adjusts between the first divided area and the second divided area such that the number of vehicles allocated to the first divided area per unit area is relatively reduced and the number of vehicles allocated to the second divided area per unit area is relatively increased.

The invention relates to a vehicle dispatching method, which comprises the following steps: in a business area divided into a plurality of divided areas and a prescribed number of vehicles are allocated to each of the divided areas, when a scheduling request for a scheduling position within a first divided area among the plurality of divided areas occurs, a first scheduling mode or a second scheduling mode is executed, the first scheduling mode being a mode in which the vehicle allocated to the first divided area is scheduled to the scheduling position, the second scheduling mode being a mode in which the vehicle existing at a position closest to the scheduling position is scheduled to the scheduling position; and when the vehicle allocated to a second divided area different from the first divided area in the second scheduling mode is scheduled to the scheduling position, relatively decreasing the number of vehicles per unit area allocated to the first divided area and relatively increasing the number of vehicles per unit area allocated to the second divided area between the first divided area and the second divided area.

The present invention relates to a computer-readable storage medium storing a vehicle scheduler, causing a computer to execute: in a business area divided into a plurality of divided areas and a prescribed number of vehicles are allocated to each of the divided areas, when a scheduling request for a scheduling position within a first divided area among the plurality of divided areas occurs, a first scheduling mode, which is a mode in which the vehicles allocated to the first divided area are scheduled to the scheduling position; in the business area, when a scheduling request for a scheduling position within the first divided area occurs, executing a second scheduling mode that schedules the vehicle existing at a position closest to the scheduling position; and when the vehicle allocated to a second divided area different from the first divided area is scheduled to the scheduling position in the second scheduling mode, relatively decreasing the number of vehicles per unit area allocated to the first divided area and relatively increasing the number of vehicles per unit area allocated to the second divided area between the first divided area and the second divided area.

Effects of the invention

According to the present invention, it is possible to suppress deterioration of fairness in the number of vehicle modulations between divided regions.

Drawings

Fig. 1 is a schematic diagram showing an example of a vehicle scheduling system according to the present embodiment.

Fig. 2 is a functional block diagram showing an example of a vehicle.

Fig. 3 is a functional block diagram showing an example of a dispatch server.

Fig. 4 is a diagram showing an example of scheduling by the vehicle scheduling system.

Fig. 5 is a diagram showing another example of scheduling by the vehicle scheduling system.

Fig. 6 is a diagram showing an example in the case where the boundary position of the divided area is changed.

Fig. 7 is a flowchart showing an example of the vehicle scheduling method according to the present embodiment.

Fig. 8 is a diagram showing another example of scheduling by the vehicle scheduling system.

Fig. 9 is a diagram showing an example in the case where the boundary position of the divided area is changed.

Fig. 10 is a flowchart showing another example of the vehicle scheduling method according to the present embodiment.

Fig. 11 is a diagram showing another mode of adjustment by the adjustment unit.

Fig. 12 is a diagram showing another mode of adjustment by the adjustment unit.

Fig. 13 is a flowchart showing another example of the vehicle scheduling method.

Detailed Description

Embodiments of a vehicle scheduling system, a vehicle scheduling method, and a vehicle scheduling program according to the present invention are described below with reference to the drawings. The present invention is not limited to this embodiment. The constituent elements in the following embodiments include constituent elements that can be easily replaced by a person skilled in the art, or substantially the same constituent elements.

Vehicle dispatch system

Fig. 1 is a schematic diagram showing an example of a vehicle scheduling system SYS according to the present embodiment. As shown in fig. 1, the vehicle dispatching system SYS is for dispatching management of the vehicle 10, and includes a dispatching server 20 and a dispatching center 30. The vehicle 10 is a vehicle such as a taxi that participates in a business of carrying passengers. In the business area AR divided into the plurality of divided areas AR1, AR2, AR3, the vehicle 10 allocates a predetermined number of pieces for each of the divided areas AR1, AR2, AR 3. The vehicle 10 can calculate the position information (latitude and longitude on the earth, etc.) of its own vehicle by receiving the GPS signal from the GPS satellite 60. In the following description, a taxi will be described as an example of the vehicle 10.

The dispatch server 20 manages the vehicle 10. The dispatch server 20 collects the position information and the state information of each vehicle 10 and manages each vehicle 10. When there is a scheduling request from the scheduling center 30 or a direct scheduling request from the mobile terminal 50, which will be described later, the scheduling server 20 transmits a scheduling instruction to the vehicle 10.

When there is a scheduling request from the telephone 40, the scheduling center 30 operates the scheduling terminal 31 and transmits the scheduling request to the scheduling server 20.

Telephone 40 includes a landline telephone and a mobile telephone. The portable terminal 50 includes a smart phone and a tablet terminal. The portable terminal 50 can receive the GPS signal and can calculate the position information based on the GPS signal. The mobile terminal 50 is provided with a scheduling application for making a scheduling request to the scheduling server 20. The mobile terminal 50 can directly make a scheduling request to the scheduling server 20 through the scheduling application. In addition, when the mobile terminal 50 is a smart phone, the mobile terminal also has a function as the telephone 40.

Fig. 2 is a functional block diagram showing an example of the vehicle 10. As shown in fig. 2, the vehicle 10 has a GPS receiving unit 11, a meter 12, a display unit 13, a communication unit 14, and a processing unit 15. The GPS receiving unit 11 receives GPS signals from the GPS satellites 60. The GPS receiving unit 11 calculates position information of the own vehicle based on the received GPS signal. The GPS receiving unit 11 transmits the calculated position information to the processing unit 15.

The meter 12 displays dynamic information of the vehicle 10. The dynamic information includes the running state of the vehicle 10 such as an empty state, a passenger (or rental) state, a payment state, an approach state, a return state, and a waiting state. The meter 12 can display dynamic information based on at least one of an instruction from the processing unit 15 and a manual input by a crew member, for example.

The display unit 13 can display various information such as map information and contents including a scheduling instruction of a scheduling position. The display unit 13 may be provided in the vehicle 10 in advance. The display unit 13 may also be used as a display unit of another system such as a navigation system. The display portion 13 is a display including, for example, a liquid crystal display (LCD: liquid Crystal Display) or an Organic Electro-Luminescence (Organic EL) display. The display unit 13 may have an input unit such as a touch panel, buttons, switches, and dials.

The communication unit 14 performs wireless communication with the scheduling server 20. The communication unit 14 receives information transmitted from the scheduling server 20. The communication unit 14 transmits the information from the processing unit 15 to the scheduling server 20. The communication unit 14 receives the scheduling instruction, information on the boundary positions of the divided areas AR1 to AR3, and the like from the scheduling server 20. The communication unit 14 transmits the position information, the dynamic information, and the like of the vehicle 10 to the dispatch server 20.

The processing unit 15 is an arithmetic processing device (control device) including, for example, a CPU (Central Processing Unit ) and the like. The processing unit 15 loads the stored program into the memory and executes the command included in the program. The processing unit 15 includes an internal memory or the like, not shown. The internal memory stores a program for realizing each section of the processing section 15. In this case, the processing section 15 realizes the functions of the respective sections by expanding and executing programs stored in an internal memory or the like. The internal memory is also used for temporary storage of data in the processing unit 15, and the like.

In the present embodiment, for example, when the communication unit 14 receives a scheduling instruction, the processing unit 15 displays information such as the name of the user, the scheduling position, and the route to the scheduling position, on the display unit 13. For example, when the communication unit 14 receives information on the boundary position of the divided areas AR1 and AR2, the processing unit 15 displays the boundary position on the display unit 13. The processing unit 15 transmits the position information calculated by the GPS receiving unit 11 and the dynamic information acquired from the meter 12 to the scheduling server 20.

Fig. 3 is a functional block diagram showing an example of the scheduling server 20. As shown in fig. 3, the schedule server 20 includes a database unit 21 and a schedule processing unit 22. The database unit 21 stores and manages various data related to the operation of the vehicle dispatching system SYS. The database unit 21 includes a divided area information management unit 23, a vehicle information management unit 24, and a user information management unit 25.

The divided area information management unit (storage unit) 23 stores and manages information related to the divided areas AR1 to AR 3. The information related to the divided areas AR1 to AR3 includes, for example, identification information identifying the divided areas AR1 to AR3, adjacent information about adjacent divided areas, boundary position information indicating boundary positions of the divided areas with each other, movement direction information indicating a direction in which the boundary positions are moved when the divided areas are enlarged or reduced, and the like. The boundary position may be, for example, a position of a boundary line of the divided regions with each other.

The vehicle information management unit 24 stores and manages information related to the vehicle 10. The information related to the vehicle 10 includes, for example, vehicle identification information (e.g., a vehicle number or the like) for distinguishing each vehicle 10, position information of the vehicle 10, dynamic information of the vehicle 10, allocation information related to allocation of the divided areas of the vehicle 10, and the like. The position information, the dynamic information, and the assignment information are updated appropriately in response to a communication with the vehicle 10 or an instruction from the schedule processing unit 22.

The user information management unit 25 stores and manages information related to the user. The information related to the user includes, for example, identification information of the user, a name or a name of the user, a contact address of the user, location information of the dispatch location, and the like. The user information management unit 25 is updated appropriately by communication with the dispatch center 30 or the mobile terminal 50. The location information of the scheduling location when the scheduling request is made from the mobile terminal 50 may be, for example, location information calculated by the mobile terminal 50.

The schedule processing unit 22 performs various processes related to the operation of the vehicle scheduling system SYS. The scheduling processing unit 22 is an arithmetic processing device constituted by a CPU or the like, for example. The schedule processing section 22 loads the stored program into the memory and executes the command included in the program. The schedule processing unit 22 includes an internal memory or the like, not shown. The internal memory stores a program for realizing each section of the schedule processing section 22. In this case, the schedule processing section 22 realizes the functions of the respective sections by expanding and executing programs stored in the internal memory or the like. The internal memory is also used for temporary storage of data in the schedule processing section 22, and the like.

The schedule processing unit 22 includes a vehicle search unit 26, a schedule instruction unit 27, and an adjustment unit 28. When a scheduling request from the scheduling terminal 31 is received, the vehicle search unit 26 refers to the divided area information management unit 23, the vehicle information management unit 24, and the user information management unit 25 to search for a schedulable vehicle 10. At this time, the vehicle search unit 26 searches for the empty vehicle 10 allocated to the divided area where the dispatch position exists, for example, from among the plurality of vehicles 10. When a dispatch request from the mobile terminal 50 is received, the vehicle search unit 26 refers to the vehicle information management unit 24 and the user information management unit 25 to search for a dispatchable vehicle 10. At this time, the vehicle search unit 26 searches for the empty vehicle 10 existing at the position closest to the dispatch position, for example, from among the plurality of vehicles 10.

The schedule instruction unit 27 schedules the vehicle 10 to the scheduling position based on the search result of the vehicle search unit 26. Specifically, when receiving a scheduling request from the scheduling terminal 31 of the scheduling center 30, the scheduling instruction unit 27 executes a first scheduling mode in which the vehicle 10 allocated to the divided area where the scheduling position exists is scheduled to the scheduling position. When receiving a scheduling request from the mobile terminal 50, the scheduling instruction unit 27 executes a second scheduling mode for scheduling the vehicle 10 in the empty state existing at the position closest to the scheduling position. The schedule instruction unit 27 transmits a schedule instruction to the vehicle 10 to be scheduled. In addition, when the second scheduling mode is executed, the scheduling instruction unit 27 transmits the identification information of the vehicle 10 to be scheduled to the portable terminal 50.

When a second scheduling mode (hereinafter, referred to as a cross-region scheduling mode) is executed in which the vehicles 10 allocated to a different divided region (hereinafter, referred to as a first divided region) from the divided region (hereinafter, referred to as a second divided region) where the scheduling position exists is scheduled to the scheduling position, the adjustment unit 28 adjusts the number of vehicles 10 allocated to the first divided region per unit area to be relatively reduced and the number of vehicles 10 allocated to the second divided region per unit area to be relatively increased between the first divided region and the second divided region. In the present embodiment, when the inter-region scheduling mode is executed, the adjustment unit 28 changes the boundary position of the divided regions between the first divided region and the second divided region so that the first divided region is relatively enlarged and the second divided region is relatively reduced.

The adjustment unit 28 may change the boundary position every time the inter-region scheduling mode is executed. The adjustment unit 28 may set the change amount of the boundary position according to the number of times the cross-region mode is executed within the predetermined period. At this time, the adjustment unit 28 increases the amount of change in the boundary position as the number of times the cross-region scheduling mode is executed increases in a predetermined period, for example. The adjustment unit 28 reduces the amount of change in the boundary position as the number of times the cross-region scheduling mode is executed within the predetermined period decreases.

When a scheduling request to a scheduling position within an enlarged area of the first divided area is generated and a first scheduling mode (hereinafter referred to as an enlarged area scheduling mode) for the scheduling request is executed after changing the boundary position between the first divided area and a second divided area different from the first divided area so that the first divided area is relatively enlarged and the second divided area is relatively reduced, the adjusting unit 28 changes the boundary position of the divided area between the first divided area and the second divided area so that the first divided area is relatively reduced and the second divided area is relatively enlarged.

The adjustment unit 28 may change the boundary position every time the extended area scheduling mode is executed. The adjustment unit 28 may set the amount of change in the boundary position according to the number of times the extended area scheduling mode is executed within the predetermined period. In this case, the adjustment unit 28 increases the amount of change in the boundary position as the number of times the extended area scheduling mode is executed within the predetermined period increases, for example. The adjustment unit 28 reduces the amount of change in the boundary position as the number of times the expanded area scheduling mode is executed within the predetermined period decreases.

Vehicle dispatching method

Next, a vehicle scheduling method according to the present embodiment will be described. In the vehicle scheduling method according to the present embodiment, the vehicle 10 is scheduled to the user by using the vehicle scheduling system SYS.

Fig. 4 is a diagram showing an example of scheduling by the vehicle scheduling system SYS. As shown in fig. 4, for example, when a scheduling request is made from the telephone 41 in the divided area AR1 to the scheduling center 30 (the scheduling position is set to the position of the telephone 41), the operator of the scheduling center 30 transmits the scheduling request to the scheduling server 20 via the scheduling terminal 31. When the dispatch server 20 receives a dispatch request from the dispatch terminal 31, the vehicle search unit 26 searches for the empty vehicle 10 allocated to the divided area AR1 where the dispatch location exists from among the plurality of vehicles 10. For example, the vehicle search unit 26 searches for the vehicle 10a closest to the dispatch location. The schedule instruction unit 27 schedules the vehicle 10a to the scheduling position based on the search result of the vehicle search unit 26. In this example, the schedule instruction unit 27 executes a first schedule mode for scheduling the vehicle 10a allocated to the divided area AR1 where the scheduling position exists, in response to the schedule request from the scheduling terminal 31.

As shown in fig. 4, for example, when a scheduling request is made from the telephone 42 in the divided area AR2 to the scheduling center 30 (the scheduling position is set to the position of the telephone 42), the operator of the scheduling center 30 transmits the scheduling request to the scheduling server 20 via the scheduling terminal 31. When the dispatch server 20 receives a dispatch request from the dispatch terminal 31, the vehicle search unit 26 searches for the empty vehicle 10 allocated to the divided area AR2 where the dispatch location exists from among the plurality of vehicles 10. For example, the vehicle search unit 26 searches for the vehicle 10d closest to the dispatch location. The schedule instruction unit 27 schedules the vehicle 10d to the scheduling position based on the search result of the vehicle search unit 26. In this example, the schedule instruction unit 27 executes a first schedule mode for scheduling the vehicle 10d allocated to the divided area AR2 where the scheduling position exists, in response to the schedule request from the scheduling terminal 31.

In this way, when the schedule instruction unit 27 executes the first schedule mode, the schedule instruction unit 28 does not move the boundary position of the divided areas because the vehicle 10 of each divided area does not lose the opportunity to schedule by the vehicles 10 of other divided areas.

As shown in fig. 4, for example, when a dispatch request is made from the mobile terminal 51 in the divided area AR1 to the dispatch server 20 (the dispatch location is set to the location of the mobile terminal 51), the vehicle search unit 26 searches for the empty vehicle 10 existing at the location closest to the dispatch location from among the plurality of vehicles 10. For example, the vehicle search unit 26 searches for the vehicle 10b existing in the same divided area AR1 as the dispatch location. The schedule instruction unit 27 schedules the vehicle 10b to the scheduling position based on the search result of the vehicle search unit 26. In this example, the schedule instruction section 27 executes the second schedule mode of scheduling the vehicle 10b closest to the scheduled position with respect to the schedule request from the portable terminal 51.

In this way, when the schedule instruction unit 27 executes the second schedule mode, if the schedule position is the same as the divided area in which the schedule position exists, the vehicle 10 in each divided area does not lose the opportunity of schedule by the vehicles 10 in other divided areas, and therefore the boundary position of the divided area is not moved.

Fig. 5 is a diagram showing another example of scheduling by the vehicle scheduling system SYS. As shown in fig. 5, for example, when a dispatch request is made from the mobile terminal 52 in the divided area AR1 to the dispatch server 20 (the dispatch location is set to the location of the mobile terminal 52), the vehicle search unit 26 searches for the empty vehicle 10 existing at the location closest to the dispatch location from among the plurality of vehicles 10. For example, the vehicle search unit 26 searches for the vehicle 10d existing in the divided area AR2 different from the dispatch location. The schedule instruction unit 27 schedules the vehicle 10d to the scheduling position based on the search result of the vehicle search unit 26. In this example, the schedule instruction section 27 executes the second schedule mode of scheduling the vehicle 10d closest to the scheduled position with respect to the schedule request from the portable terminal 52.

In this way, when the vehicle 10 allocated to the divided area AR2 different from the divided area AR1 existing at the scheduling position is scheduled to the scheduling position in the second scheduling mode, that is, when the cross-regional scheduling mode is executed, the vehicle 10 (the vehicle 10 d) of the second divided area receives a benefit according to the scheduling request of the mobile terminal 50 (the mobile terminal 52), but the opportunity of scheduling is lost for the vehicle 10 of the first divided area.

Therefore, the adjustment unit 28 changes the boundary position of the divided region between the divided region AR1 and the divided region AR2 so that the divided region AR1 is relatively enlarged and the divided region AR2 is relatively reduced. The adjustment unit 28 changes the boundary position based on the boundary position information and the movement direction information of the divided region information management unit 23. By this modification, the range in which the scheduling request by the telephone 40 can be accepted becomes large in the divided area AR1, and the range in which the scheduling request by the telephone 40 can be accepted becomes small in the divided area AR 2.

Fig. 6 is a diagram showing an example of a case where the boundary position of the divided region is changed. As shown in fig. 6, in the present embodiment, the divided area AR1 and the divided area AR2 are adjacent. In this case, the adjustment unit 28 changes, for example, the position of the boundary line shared by the divided area AR1 and the divided area AR 2. This effectively achieves a situation in which the divided area AR1 is relatively enlarged and the divided area AR2 is relatively reduced. In fig. 6, the boundary positions of the divided area AR1 and the divided area AR2 that are set at the beginning are indicated by broken lines. In the example shown in fig. 6, the adjustment unit 28 adjusts the boundary position so that the position of the boundary line L1 moves toward the divided area AR2, and shortens the lengths of the boundary lines L2 and L3 in accordance with the movement of the boundary line L1. The adjustment unit 28 is not limited to this embodiment, and may adjust the boundary position in other manners. For example, a plurality of candidate boundary positions that are moved to the divided area AR1 and the divided area AR2 side in stages with respect to the boundary position set at the beginning may be set in advance and stored in the divided area information management unit 23. At this time, the adjustment unit 28 can set the boundary position by selecting one candidate boundary position from among the candidate boundary positions stored in the divided region information management unit 23 when changing the boundary position.

An example of the vehicle scheduling method according to the present embodiment will be described with reference to fig. 7. Fig. 7 is a flowchart showing an example of the vehicle scheduling method according to the present embodiment. As shown in fig. 7, the dispatch server 20 receives a dispatch request from the dispatch center 30 or the portable terminal 50 (step S101). When the transmission destination of the dispatch request is the dispatch center 30 (no in step S102), the vehicle search unit 26 searches for the empty vehicle 10 allocated to the divided area where the dispatch location exists. The schedule instruction unit 27 schedules the vehicle 10 to the scheduling position based on the search result of the vehicle search unit 26. That is, the first scheduling mode of scheduling the vehicle 10 allocated to the divided area where the scheduling position exists to the scheduling position is executed (step S103). After that, the process ends.

On the other hand, when the transmission destination of the dispatch request is the mobile terminal 50 in step S102 (yes in step S102), the vehicle search unit 26 searches for the empty vehicle 10 existing at the position closest to the dispatch position. The schedule instruction unit 27 schedules the vehicle 10 to the scheduling position based on the search result of the vehicle search unit 26. That is, the second scheduling mode is executed in which the vehicle 10 in the empty state existing at the position closest to the scheduling position is scheduled to the scheduling position (step S104).

When the second scheduling mode is executed, the adjustment unit 28 determines whether or not the divided area in which the scheduled position exists is different from the divided area to which the scheduled vehicle 10 belongs (step S105). When it is determined that the two divided areas are different (yes in step S105), the adjustment unit 28 moves the boundary area between the two divided areas so that the divided area where the scheduled position exists is enlarged and the divided area to which the scheduled vehicle 10 belongs is reduced (step S106). After that, the process ends. If it is determined in step S105 that the two divided areas are the same (no in step S105), the process ends.

Fig. 8 is a diagram showing another example of scheduling by the vehicle scheduling system SYS. In the example shown in fig. 8, the boundary position between the divided area AR1 and the divided area AR2 is changed from the initially set position. Specifically, the divided area AR1 is set to be relatively large and the divided area AR2 is set to be relatively small. As described above, the case where the boundary position between the divided areas AR1 and AR2 is changed is not limited to the case where the vehicle 10 allocated to the divided area AR2 different from the divided area AR1 existing at the scheduling position is scheduled to the scheduling position in the second scheduling mode as described above, and includes, for example, a case where the boundary position is automatically changed according to the time, season, or the like, and a case where the boundary position of the divided area is changed in a manner different from the above.

In this state, for example, when a scheduling request is made from the telephone 43 of the divided area AR1 to the scheduling center 30 (the scheduling position is set to the position of the telephone 43), the operator of the scheduling center 30 transmits the scheduling request to the scheduling server 20 via the scheduling terminal 31. When the dispatch server 20 receives a dispatch request from the dispatch terminal 31, the vehicle search unit 26 searches for the empty vehicle 10 allocated to the divided area AR1 where the dispatch location exists from among the plurality of vehicles 10. For example, the vehicle search unit 26 searches for the vehicle 10b closest to the dispatch location. The schedule instruction unit 27 schedules the vehicle 10b to the scheduling position based on the search result of the vehicle search unit 26. In this example, the schedule instruction unit 27 executes a first schedule mode for scheduling the vehicle 10b allocated to the divided area AR1 where the scheduling position exists, with respect to the schedule request from the schedule terminal 31.

The telephone 43 is located in an area of the divided area AR1 that is enlarged by the change of the boundary position. The adjustment unit 28 can identify, as an area that is enlarged by the change of the boundary position, an area obtained by subtracting the divided area AR1 at the time of the scheduling request by the telephone 43 from the divided area AR1 that was set most recently before the change.

In this way, when a scheduling request to a scheduling position in an enlarged area in the divided area AR1 is generated after the boundary position is changed so that the divided area AR1 is relatively enlarged and the divided area AR2 is relatively reduced and the first scheduling mode for the scheduling request, that is, the enlarged area scheduling mode is executed, the boundary position is changed, and the vehicle 10 on the side of the divided area AR1 obtains a scheduling opportunity result. On the other hand, in the divided area AR2, the scheduling opportunity is lost due to the change of the boundary position.

Therefore, the adjustment unit 28 changes the boundary position of the divided region between the divided region AR1 and the divided region AR2 so that the divided region AR1 is relatively reduced and the divided region AR2 is relatively enlarged. The adjustment unit 28 changes the boundary position based on the boundary position information and the movement direction information of the divided region information management unit 23.

Fig. 9 is a diagram showing an example of a case where the boundary position of the divided region is changed. As shown in fig. 9, in the present embodiment, the divided area AR1 and the divided area AR2 are adjacent. In this case, the adjustment unit 28 changes the position of the boundary line shared by the divided areas AR1 and AR2, for example, as in the case shown in fig. 6. This effectively reduces the divided area AR1 and enlarges the divided area AR 2. In fig. 9, the boundary positions of the divided area AR1 and the divided area AR2 set previously are indicated by broken lines. In the example shown in fig. 9, the adjustment unit 28 adjusts the boundary position so that the position of the boundary line L1 moves toward the divided area AR1, and the lengths of the boundary lines L2 and L3 become longer in accordance with the movement of the boundary line L1. The adjustment unit 28 is not limited to this embodiment, and may adjust the boundary position in other manners.

Another example of the vehicle scheduling method according to the present embodiment will be described with reference to fig. 10. Fig. 10 is a flowchart showing another example of the vehicle scheduling method according to the present embodiment. As shown in fig. 10, the scheduling server 20 determines whether or not the boundary position of the divided area is moved from the position set at the beginning (step S201). If it is determined that there is no movement (no in step S201), the process ends. When it is determined that the mobile terminal has moved (yes in step S201), the dispatch server 20 receives a dispatch request from the dispatch center 30 or the mobile terminal 50 (step S202). When the transmission destination of the dispatch request is the mobile terminal 50 (no in step S203), the vehicle search unit 26 searches for the empty vehicle 10 existing at the position closest to the dispatch position. The schedule instruction unit 27 schedules the vehicle 10 to the scheduling position based on the search result of the vehicle search unit 26. That is, the second scheduling mode is executed in which the vehicle 10 in the empty state existing at the position closest to the scheduling position is scheduled to the scheduling position (step S204). After that, the process ends.

On the other hand, in step S203, when the transmission destination of the dispatch request is the dispatch center 30 (yes in step S203), the vehicle search unit 26 searches for the empty vehicle 10 allocated to the divided area where the dispatch location exists. The schedule instruction unit 27 schedules the vehicle 10 to the scheduling position based on the search result of the vehicle search unit 26. That is, the first scheduling mode of scheduling the vehicle 10 allocated to the divided area where the scheduling position exists to the scheduling position is executed (step S205).

When the first scheduling mode is executed, the adjustment unit 28 determines whether or not the scheduling position is within an area of the divided area that is enlarged due to the change of the boundary position (step S206). When it is determined that the area is within the expanded area (yes in step S206), the adjustment unit 28 moves the boundary area between the two divided areas so that the divided area where the scheduling position exists is reduced and the divided area where the scheduling position does not exist is expanded (step S207). After that, the process ends. If it is determined in step S206 that the expanded area is not located (no in step S206), the process ends.

As described above, in the vehicle scheduling system SYS, the vehicle scheduling method, and the vehicle scheduling program according to the present embodiment, when a scheduling request for scheduling a vehicle 10 in a first divided area among the plurality of divided areas occurs in the business area AR divided into the plurality of divided areas AR1 to AR3 and a predetermined number of vehicles 10 are allocated to each divided area, the scheduling instruction unit 27 executes the first scheduling mode for scheduling the vehicle 10 in the empty state allocated to the first divided area to the scheduling position or the second scheduling mode for scheduling the vehicle 10 in the empty state existing in the position closest to the scheduling position, and when the vehicle 10 allocated to a second divided area different from the first divided area is scheduled to the scheduling position in the second scheduling mode, the number of vehicles 10 per unit area allocated to the first divided area is relatively decreased and the number of vehicles 10 per unit area allocated to the second divided area is relatively increased between the first divided area and the second divided area by the adjusting unit 28.

Specifically, the plurality of divided regions can change the boundary position, and the adjusting unit 28 changes the boundary position between the first divided region and the second divided region so that the first divided region is relatively enlarged and the second divided region is relatively reduced.

According to the above configuration, the range of acceptable scheduling requests by the telephone 40 can be enlarged for the first divided area, and the range of acceptable scheduling requests by the telephone 40 can be reduced for the second divided area. Therefore, the scheduling opportunity in the first divided area can be relatively increased, and the scheduling opportunity in the second divided area can be relatively reduced. Therefore, benefit adjustment can be achieved on the second divided area side that obtains benefit by the cross-area scheduling mode and on the first divided area side that loses scheduling opportunity. This can suppress the deterioration of fairness in the number of vehicle modulations between the divided regions.

In the vehicle scheduling system SYS, the vehicle scheduling method, and the vehicle scheduling program according to the present embodiment, when a scheduling request to a scheduling position in a first divided area among the plurality of divided areas occurs in the business area AR of the vehicle 10 divided into the plurality of divided areas AR1 to AR3 and a predetermined number of divided areas are allocated to each divided area, the scheduling instruction unit 27 executes a first scheduling mode in which the vehicle 10 in the empty state allocated to the first divided area is scheduled to the scheduling position or a second scheduling mode in which the vehicle 10 in the empty state existing at the position closest to the scheduling position is scheduled to the scheduling position, and when the scheduling request is executed in the first scheduling mode in which the boundary position between the first divided area and a second divided area different from the first divided area is changed so that the first divided area is relatively enlarged and the second divided area is relatively reduced, the boundary position between the first divided area and the second divided area is relatively reduced by the adjustment unit 28.

According to the above configuration, the range of acceptable scheduling requests by the telephone 40 can be enlarged for the second divided area, and the range of acceptable scheduling requests by the telephone 40 can be reduced for the first divided area. Therefore, the scheduling opportunity in the second divided area can be relatively increased, and the scheduling opportunity in the first divided area can be relatively reduced. Therefore, benefit adjustment can be realized on the first divided area side in which benefit is obtained by changing the boundary position and on the second divided area side in which scheduling opportunities are lost. This can suppress the deterioration of fairness in the number of vehicle modulations between the divided regions.

The vehicle scheduling system SYS according to the present embodiment includes a divided area information management unit 23 that stores a plurality of candidates for the changed boundary position, and the adjustment unit 28 sets the changed boundary position by selecting one candidate from the plurality of candidates. This enables the boundary position to be smoothly set.

In the vehicle scheduling system SYS according to the present embodiment, the adjustment unit 28 sets the amount of change in the boundary position according to the number of times the cross-region scheduling mode or the extended-region scheduling mode is executed within the predetermined period. Thus, the amount of change in the boundary position is set according to the number of times the scheduling opportunity is acquired or lost, and thus, the benefit adjustment between the divided areas can be more appropriately realized.

In the vehicle scheduling system SYS according to the present embodiment, the scheduling instruction unit 27 executes the first scheduling mode when a scheduling request is received from the scheduling terminal 31 of the scheduling center 30, and executes the second scheduling mode when a scheduling request is received from the mobile terminal 50, and the mobile terminal 50 is a terminal different from the scheduling terminal 31 and can grasp the position of the vehicle 10. This can realize benefit adjustment on the second divided area side that obtains benefit from the scheduling request of the mobile terminal 50 and on the first divided area side that loses scheduling opportunity.

In the above-described embodiment, the case where the inter-region scheduling mode is executed is exemplified by, but not limited to, changing the boundary position of the divided regions between the first divided region and the second divided region so that the first divided region is relatively enlarged and the second divided region is relatively reduced. For example, when the inter-regional dispatch mode is executed, the adjustment unit 28 may adjust the number of vehicles 10 allocated to the first divided region to be relatively small and the number of vehicles 10 allocated to the second divided region to be relatively large between the first divided region and the second divided region.

Fig. 11 is a diagram showing another mode of adjustment by the adjustment unit 28. Fig. 11 is an example of a case where the vehicle 10 (for example, the vehicle 10 d) allocated to the divided area AR2 is scheduled to the inter-area scheduling mode existing at the scheduling position (for example, the position of the mobile terminal 52) of the divided area AR1. In this case, the vehicle 10d in the divided area AR2 receives benefit according to the scheduling request of the mobile terminal 52, but the vehicle 10 (vehicles 10a to 10 c) in the divided area AR1 loses scheduling opportunity.

Therefore, as shown in fig. 11, the adjustment unit 28 causes a part (for example, 1 or several pieces) of the vehicle 10 belonging to the divided area AR1 to belong to the divided area AR2. In fig. 11, the vehicle 10a is made to belong to the divided area AR2 as an example, but the present invention is not limited thereto, and the vehicles 10b and 10c may be made to belong to the divided area AR1. By changing the attribution of the vehicle 10 in this way, the number of vehicles 10 allocated to the divided area AR1 is relatively reduced, and the number of vehicles allocated to the divided area AR2 is relatively increased. Then, when there is a scheduling request from the telephone 40 in the divided area AR2, the scheduling instruction unit 27 gives a scheduling instruction to the vehicle 10 (vehicle 10 a) whose attribution is changed to the divided area AR2 with priority.

Thus, in the divided area AR1, the number of vehicles 10 per unit area is reduced. Therefore, the expected value for each vehicle 10 belonging to the divided area AR1 to receive scheduling can be increased for the scheduling request by the telephone 40. On the other hand, in the divided area AR2, the number of vehicles 10 per unit area increases. Therefore, the expected value for each vehicle 10 belonging to the divided area AR2 to receive scheduling can be reduced for the scheduling request by the telephone 40. Therefore, the scheduling opportunity can be relatively increased for each vehicle 10 belonging to the divided area AR1, and the scheduling opportunity can be relatively reduced for each vehicle 10 belonging to the divided area AR 2.

Fig. 12 is a diagram showing another mode of adjustment by the adjustment unit 28. Fig. 12 is an example of a case where, after the attribution of the vehicle 10 according to fig. 11 is changed, the vehicle 10 (for example, the vehicle 10 b) allocated to the divided area AR1 is scheduled to the transregional scheduling mode existing at the scheduling position (for example, the position of the mobile terminal 53) of the divided area AR 2. In this case, the vehicle 10 in the divided area AR1 receives benefit according to the scheduling request of the mobile terminal 50, but the scheduling opportunity is lost for the vehicle 10 in the divided area AR 2.

Therefore, as shown in fig. 12, the adjustment unit 28 causes a part (for example, 1 or several pieces) of the vehicle 10 belonging to the divided area AR2 to belong to the divided area AR1. In fig. 12, the vehicle 10a is made to belong to the divided area AR1 as an example, but the present invention is not limited thereto, and the vehicles 10d, 10e, and 10f may be made to belong to the divided area AR1. By changing the attribution of the vehicle 10 in this way, the number of vehicles 10 allocated to the divided area AR2 is relatively reduced, and the number of vehicles allocated to the divided area AR1 is relatively increased. Then, when there is a scheduling request from the telephone 40 in the divided area AR1, the scheduling instruction unit 27 gives a scheduling instruction to the vehicle 10 (vehicle 10 a) whose attribution is changed to the divided area AR1 with priority.

Thus, in the divided area AR2, the number of vehicles 10 per unit area becomes small. Therefore, the expected value for each vehicle 10 belonging to the divided area AR2 to receive scheduling can be increased for the scheduling request by the telephone 40. On the other hand, in the divided area AR1, the number of vehicles 10 per unit area increases. Therefore, the expected value for each vehicle 10 belonging to the divided area AR1 to receive scheduling can be reduced for the scheduling request by the telephone 40. Therefore, the scheduling opportunity can be relatively increased for each vehicle 10 belonging to the divided area AR2, and the scheduling opportunity can be relatively reduced for each vehicle 10 belonging to the divided area AR1.

The vehicle scheduling method shown in fig. 11 and 12 will be described with reference to fig. 13. Fig. 13 is a flowchart showing another example of the vehicle scheduling method. As shown in fig. 13, the dispatch server 20 receives a dispatch request from the dispatch center 30 or the portable terminal 50 (step S301). In the case where the transmission destination of the scheduling request is the scheduling center 30 (no in step S302), the first scheduling mode is executed (step S303), and then the processing is ended.

On the other hand, in the case where the transmission destination of the scheduling request is the mobile terminal 50 in step S302 (yes in step S302), the second scheduling mode is executed (step S304). When the second scheduling mode is executed, the adjustment unit 28 determines whether or not the divided area in which the scheduled position exists is different from the divided area to which the scheduled vehicle 10 belongs (step S305). When it is determined that the two divided areas are different (yes in step S305), the adjustment unit 28 changes the number of the vehicles 10 allocated to the two divided areas between the two divided areas so that the number of the vehicles 10 belonging to the divided area where the scheduled position exists is relatively reduced, and the number of the vehicles 10 belonging to the divided area where the scheduled vehicle 10 belongs is relatively increased (step S306). After that, the process ends. If it is determined in step S305 that the two divided areas are the same (no in step S305), the process ends.

In this way, when the inter-region scheduling mode is executed, the adjustment unit 28 relatively decreases the number of vehicles 10 allocated to the first divided region and relatively increases the number of vehicles allocated to the second divided region between the first divided region and the second divided region. Thus, benefit adjustment can be achieved on the second divided area side, which obtains benefit by the cross-regional scheduling mode, and on the first divided area side, which loses scheduling opportunity. This can suppress the deterioration of fairness in the number of vehicle modulations between the divided regions.

Symbol description

L1, L2, L3..boundary line, ar..business area, AR1, AR2, AR 3..division area, sys..vehicle dispatching system, 10 a-10 g..vehicle, 11..gps receiving section, 12..meter, 13..display section, 14 … communication section, 15..processing section, 20..dispatching server, 21..database section, 22..dispatching processing section, 23..division area information management section, 24..vehicle information management section, 25..user information management section, 26..vehicle retrieval section, 27..dispatching instruction section, 28..adjustment section, 30..dispatching center, 31..dispatching terminal, 40, 41, 42, 43..telephone, 50, 51, 52..portable terminal, 60..satellite GPS.

Claims

1. A vehicle dispatch processing device comprising:

a scheduling instruction unit configured to execute a first scheduling mode or a second scheduling mode when a scheduling request to a scheduling position in a first divided area among a plurality of divided areas of a business area is generated in the business area divided into the plurality of divided areas and a predetermined number of vehicles are allocated to each of the divided areas, the first scheduling mode being a mode in which the vehicles allocated to the first divided area are scheduled to the scheduling position, and the second scheduling mode being a mode in which the vehicles existing at a position closest to the scheduling position are scheduled to the scheduling position; and

and an adjustment unit configured to adjust, when the vehicle assigned to a second divided area different from the first divided area is scheduled to the scheduling position in the second scheduling mode, between the first divided area and the second divided area such that the number of vehicles per unit area assigned to the first divided area is relatively reduced and such that the number of vehicles per unit area assigned to the second divided area is relatively increased.

2. The vehicle dispatch processing device of claim 1, wherein,

a plurality of the divided regions can change boundary positions,

the adjustment unit changes the boundary position between the first divided region and the second divided region so that the first divided region is relatively enlarged and the second divided region is relatively reduced.

3. The vehicle dispatch processing device of claim 2, wherein,

after changing the boundary position between a first divided area and a second divided area among the plurality of divided areas so that the first divided area is relatively enlarged and the second divided area is relatively reduced, when a scheduling request to a scheduling position within an enlarged area of the first divided area occurs and the first scheduling mode is executed with respect to the scheduling request, the adjustment unit changes the boundary position between the first divided area and the second divided area so that the first divided area is relatively reduced and the second divided area is relatively enlarged.

4. The vehicle dispatch processing device of claim 2 or 3, wherein,

comprising the following steps: a storage unit for storing a plurality of candidates of the boundary position after the modification,

The adjustment unit sets the boundary position after the change by selecting one of the plurality of candidates.

5. The vehicle dispatch processing device of claim 1, wherein,

the adjustment unit relatively reduces the number of vehicles allocated to the first divided region between the first divided region and the second divided region, and relatively increases the number of vehicles allocated to the second divided region.

6. The vehicle dispatch processing device of claim 2, wherein,

the adjustment unit sets the amount of change in the boundary position according to the number of times the second scheduling mode in which the vehicle allocated to the second divided area is scheduled to the scheduling position is executed.

7. The vehicle dispatch processing device of claim 3, wherein,

the adjustment unit sets the amount of change in the boundary position according to the number of times the first scheduling pattern is executed for the scheduling position in the enlarged area in the first divided area.

8. The vehicle dispatch processing device of claim 1, wherein,

the scheduling instruction unit executes the first scheduling mode when a scheduling request is received from an external scheduling center, and executes the second scheduling mode when a scheduling request is received from an external portable terminal.

9. A vehicle scheduling method, comprising:

in a business area divided into a plurality of divided areas and a predetermined number of vehicles are allocated to each of the divided areas, when a scheduling request to a scheduling position within a first divided area among the plurality of divided areas occurs, a first scheduling mode or a second scheduling mode is executed, the first scheduling mode being a mode in which the vehicles allocated to the first divided area are scheduled to the scheduling position, the second scheduling mode being a mode in which the vehicles existing at a position closest to the scheduling position are scheduled to the scheduling position; and

when the vehicle allocated to a second divided area different from the first divided area is scheduled to the scheduling position in the second scheduling mode, the number of vehicles per unit area allocated to the first divided area is relatively reduced and the number of vehicles per unit area allocated to the second divided area is relatively increased between the first divided area and the second divided area.

10. A computer-readable storage medium storing a vehicle scheduler, causing a computer to execute:

In a business area divided into a plurality of divided areas and a predetermined number of vehicles are allocated to each of the divided areas, when a scheduling request to a scheduling position within a first divided area among the plurality of divided areas occurs, executing a first scheduling mode that schedules the vehicles allocated to the first divided area to the scheduling position;

in the business area, when a scheduling request to a scheduling position within the first divided area occurs, executing a second scheduling mode that schedules the vehicle existing at a position closest to the scheduling position; and