Vehicle allocation management device and vehicle allocation management method

Abstract

A vehicle allocation management device 100: acquires a change allowance degree for a scheduled arrival time T0 on the basis of user schedule information; calculates an estimated arrival time and a variation degree for the estimated arrival time for each of a plurality of route candidates; assesses whether there are a plurality of recommended route candidates in which the possibility of a vehicle arriving at a destination Pg before the scheduled arrival time T0 is equal to or greater than a prescribed value; outputs information for preferentially recommending a second recommended route candidate having a second variation degree lower than a first variation degree, over a first recommended route candidate having the first variation degree, to an electronic terminal 3 in cases in which the change allowance degree is lower than a prescribed degree and there are a plurality of recommended route candidates; and generates a vehicle allocation plan when the result of selecting a route candidate is inputted to the electronic terminal 3.

Description

Vehicle allocation management device and vehicle allocation management method

[0001] The present invention relates to a vehicle allocation management device and a vehicle allocation management method.

[0002] The public bus dispatch system described in Patent Document 1 gives priority to selecting services that allow boarding and / or disembarking at times close to the desired boarding and disembarking times input by the user, and issues dispatch instructions.

[0003] Japanese Patent Application Laid-Open No. 2019-020973

[0004] However, in the shared vehicle dispatch system described in Patent Document 1, the actual boarding and disembarking times may be earlier or later than the desired times (paragraph

[0019] of Patent Document 1), which may result in the user missing plans that are difficult to change, such as a hospital appointment.

[0005] The problem to be solved by the present invention is to provide a vehicle allocation management device and a vehicle allocation management method that can present route candidates to a user so as to be on time for a schedule that is difficult to change.

[0006] The present invention solves the above problem by calculating the degree of tolerance for changes in the estimated arrival time for a user to arrive at a specified destination, calculating the estimated arrival time of route candidates and the degree of variation in the estimated arrival times, determining whether there are multiple recommended route candidates for which the probability that the vehicle will be able to arrive at the destination before the estimated arrival time is greater than a specified value, and if the degree of tolerance for changes is lower than the specified value and there are multiple recommended route candidates, outputting information to an electronic terminal that preferentially recommends a second recommended route candidate having a second degree of variation that is lower than the first degree of variation over a first recommended route candidate having a first degree of variation.

[0007] According to the present invention, it is possible to present route candidates to a user so as to be in time for a schedule that is difficult to change.

[0008] Fig. 2 is a block diagram showing the configuration of a vehicle dispatch management device according to the present embodiment. Fig. 3 is a diagram showing examples of two recommended route candidates calculated by the vehicle dispatch management device shown in Fig. 1. Fig. 4 is a graph showing the probability distribution of estimated arrival times of the two recommended route candidates shown in Fig. 2. Fig. 5 is a flowchart showing the steps of a vehicle dispatch management method executed by the vehicle dispatch management device shown in Fig. 1.

[0009] An embodiment of the present invention will now be described with reference to the drawings. As shown in FIG. 1 , a vehicle dispatch service server 1 is capable of communicating with vehicles 2 and electronic terminals 3 via the Internet 4. The vehicle dispatch service server 1 includes a vehicle dispatch management device 100, a communication device 200, and a database 300. The vehicle dispatch management device 100 generates a vehicle dispatch plan based on a vehicle dispatch request received from an electronic terminal 3 carried by a user, and manages the dispatch of vehicles 2 based on the vehicle dispatch plan. The communication device 200 also exchanges information between the vehicles 2 and the electronic terminal 3. The database 300 stores driving history information and vehicle operation information received from the vehicles 2, as well as vehicle dispatch reservation information and user schedule information received from the electronic terminal 3.

[0010] Vehicle 2 is a shared vehicle used for a vehicle dispatch service. Although only one vehicle 2 is shown in FIG. 1 , there may be multiple vehicles 2. Vehicle 2 has a movement instruction receiving unit 21, a location information receiving unit 22, and a communication device 23. The movement instruction receiving unit 21 receives movement instructions from the vehicle dispatch service server 1 via the communication device 23. Furthermore, the location information receiving unit 22 detects radio waves transmitted from multiple satellite communications via the communication device 23, and periodically acquires location information of vehicle 2.

[0011] The electronic terminal 3 is, for example, a mobile terminal such as a smartphone carried by a user of the ride-hailing service. The electronic terminal 3 has an input device 31, a display device 32, and a communication device 33. The input device 31 and the display device 32 are, for example, touch panel displays of the electronic terminal 3.

[0012] Next, a detailed description will be given of the configuration of the vehicle dispatch control device 100 according to the present invention. The vehicle dispatch control device 100 has a controller 10. The controller 10 has an information acquisition unit 11, a schedule change tolerance acquisition unit 12, a route candidate calculation unit 13, an arrival time estimation unit 14, a recommended route candidate determination unit 15, a route presentation unit 16, and a vehicle dispatch plan generation unit 17.

[0013] The information acquisition unit 11 acquires vehicle dispatch reservation information, vehicle operation information, and user schedule information for the vehicle 2 from the database 300. The information acquisition unit 11 may also acquire driving history information from the database 300.

[0014] The user schedule information acquired by the information acquisition unit 11 includes the schedule details after the user arrives at the destination. For example, the user schedule information includes the name of the schedule details that the user input into the electronic terminal 3 when reserving a ride. The user may also input into the electronic terminal 3 the degree of tolerance for changes to the schedule after arriving at the destination, and the information acquisition unit 11 may acquire the input degree of tolerance for changes as the user schedule information. The degree of tolerance for changes is the degree to which changes to the time of the target schedule are permitted. The information acquisition unit 11 may also acquire the user schedule information by receiving the user's schedule from a schedule management application installed on the electronic terminal 3 via the communication device 200, or by receiving transportation connection information using MaaS (Mobility as a Service).

[0015] The plan change tolerance acquisition unit 12 acquires a change tolerance level for the estimated arrival time T0 for the user to arrive at a predetermined destination based on the user plan information acquired by the information acquisition unit 11. The estimated arrival time T0 is the time the user desires to arrive at the destination Pg. Specifically, the plan change tolerance acquisition unit 12 determines whether the plan content included in the user plan information is changeable at the will of the user or other people belonging to a predetermined group including the user. Note that "other people belonging to a predetermined group including the user" refers to, for example, the person the user is meeting at the destination (the user's family or friends). If the plan content included in the user plan information is changeable at the will of the user or other people belonging to a predetermined group including the user, the plan change tolerance acquisition unit 12 calculates a higher change tolerance level than if the plan content is not changeable at the will of the user or other people. For example, when the schedule includes going home, shopping, meeting up with family, etc., the schedule change tolerance degree acquisition unit 12 calculates a higher change tolerance degree than when the schedule includes visiting a hospital, meeting someone, going to work (in the case of a non-flexible work schedule), etc. Note that the schedule change tolerance degree acquisition unit 12 may acquire a value for the change tolerance degree that is manually input by the user to the electronic terminal 3.

[0016] The route candidate calculation unit 13 calculates a plurality of route candidates based on the vehicle dispatch reservation information acquired by the information acquisition unit 11. For example, in the example shown in Fig. 2, the route candidate calculation unit 13 calculates two route candidates A and B for traveling from a departure point Ps to a destination Pg.

[0017] The arrival time estimator 14 calculates the estimated arrival time and the degree of variation of the estimated arrival time for each route candidate. The degree of variation of the estimated arrival time is, for example, a value indicating the variance or standard deviation of the estimated arrival time. Specifically, the arrival time estimator 14 acquires road link required time information, including required times corresponding to the date type and time zone of each road link, based on the driving history information of the vehicle 2, and calculates the probability distribution and degree of variation of the estimated arrival time based on the road link required time information. Furthermore, as shown in the graph of FIG. 3 , the arrival time estimator 14 calculates variation thresholds Da and Db that define an acceptable range for the degree of variation of the estimated arrival time for each of the route candidates A and B according to a predetermined standard. Note that in the example shown in FIG. 3 , the variation thresholds Da and Db are 2σ in the standard normal distribution, but are not limited thereto and may be, for example, σ. The arrival time estimator 14 then calculates the effective estimated arrival times Ta1 and Tb1 based on the variation thresholds Da and Db. The arrival time estimation unit 14 also calculates average estimated arrival times Ta0 and Tb0, which are the average values ​​of the estimated arrival times. Note that the horizontal axis of the graph in Fig. 3 represents the estimated arrival time, and the vertical axis represents the probability density function.

[0018] 2 and 3, route candidate A has a shorter travel distance than route candidate B, and therefore the average estimated arrival time Ta0 of route candidate A is earlier than the average estimated arrival time Tb0 of route candidate B. On the other hand, route candidate A passes through more intersections X1 and X2 with traffic lights than route candidate B, and therefore the degree of variation of route candidate A (variation threshold Da) is greater than the degree of variation of route candidate B (variation threshold Db).

[0019] Furthermore, the recommended route candidate determination unit 15 identifies, among the multiple route candidates, a route candidate for which the probability that the vehicle 2 can arrive at the destination Pg before the estimated arrival time T0 is equal to or greater than a predetermined value as a recommended route candidate, and determines whether multiple recommended route candidates exist. Specifically, as shown in FIG. 3 , the recommended route candidate determination unit 15 determines that the probability that the vehicle 2 can arrive at the destination Pg before the estimated arrival time T0 is equal to or greater than a predetermined value when the effective estimated arrival times Ta1 and Tb1 are earlier than the estimated arrival time T0. That is, in the example shown in FIG. 3 , route candidates A and B correspond to "recommended route candidates for which the probability that the vehicle 2 can arrive at the destination Pg before the estimated arrival time T0 is equal to or greater than a predetermined value." Furthermore, even if a route has a probability that the vehicle 2 can arrive at the destination Pg before the estimated arrival time T0 equal to or greater than a predetermined value, the recommended route candidate determination unit 15 excludes the route from the route candidates if both the average value (average estimated arrival time) and the degree of variation of the estimated arrival times are larger than the others.

[0020] Furthermore, when the user's tolerance for schedule changes is lower than a predetermined value and there are multiple recommended route candidates, the route presenting unit 16 outputs information to the electronic terminal 3 that preferentially recommends a second recommended route candidate having a second degree of variation that is smaller than the first degree of variation over a first recommended route candidate having a first degree of variation. That is, when the user's tolerance for schedule changes is lower than a predetermined value and there are multiple recommended route candidates, the route presenting unit 16 presents information such that the recommended route candidate having a smaller degree of variation is to be recommended to the user preferentially. For example, in the example shown in FIGS. 2 and 3 , route candidate B has a smaller degree of variation than route candidate A, so the route presenting unit 16 preferentially recommends route candidate B to the user over route candidate A. Note that "outputting information recommending the second recommended route candidate preferentially over the first recommended route candidate to the electronic terminal 3" means, for example, displaying the second recommended route candidate more prominently than the first recommended route candidate on the screen of the display device 32 of the electronic terminal 3 (the smaller the degree of variation, the more prominent the display), displaying the second recommended route candidate higher than the first recommended route candidate (the smaller the degree of variation, the higher the display), or displaying only the recommended route candidate with the smallest degree of variation. Furthermore, the route presenting unit 16 determines that the degree of change tolerance is lower than a predetermined value when the planned content is a hospital visit, meeting, or attendance at work (in the case of a non-flexible work schedule), which is content that is difficult to change the time of at the will of the user or other people belonging to a predetermined group including the user.

[0021] On the other hand, when the user's schedule change tolerance is equal to or greater than a predetermined value and there are multiple recommended route candidates, the route presentation unit 16 presents information to the user so that route candidates with shorter average estimated arrival times are given priority. For example, the route presentation unit 16 displays only the recommended route candidate with the shortest average estimated arrival time on the display device 32 of the electronic terminal 3. Furthermore, the route presentation unit 16 may display the recommended route candidate with the shorter average estimated arrival time more prominently on the display device 32 of the electronic terminal 3 or at the top of the screen. The route presentation unit 16 determines that the change tolerance is equal to or greater than a predetermined value when the schedule includes a trip home or shopping, and the time can be changed at the will of the user or other people belonging to a predetermined group including the user. The route presentation unit 16 also determines that the change tolerance is equal to or greater than a predetermined value even if the user has no plans after arriving at the destination Pg.

[0022] Furthermore, if there is only one recommended route candidate, the route presenting unit 16 displays only that recommended route candidate on the display device 32 of the electronic terminal 3 .

[0023] Furthermore, when there is no recommended route candidate, the route presenting unit 16 outputs information to the electronic terminal 3 notifying the user that there is a possibility that the vehicle 2 will not arrive in time for the estimated arrival time T0 desired by the user. Then, the route presenting unit 16 outputs information to the electronic terminal 3 recommending, with priority, a second route candidate having a second average estimated arrival time that is shorter than the first average estimated arrival time, over a first route candidate having a first average estimated arrival time. In other words, when there is no recommended route candidate, the route presenting unit 16 presents information such that the route candidate having a shorter average estimated arrival time is given higher priority for recommendation to the user.

[0024] 1 generates a vehicle dispatch plan based on the vehicle operation information and the route determination result when a route determination result (a result of a route candidate selection by a user) is input to the electronic terminal 3. Note that the vehicle dispatch plan generation unit 17 may generate a vehicle dispatch plan that allows a user to share a vehicle 2 when the user's tolerance for schedule changes is equal to or greater than a predetermined level.

[0025] Next, the procedure of the vehicle dispatch control method executed by the controller 10 of the vehicle dispatch control device 100 will be described with reference to the flowchart shown in FIG.

[0026] First, in step S1, the information acquisition unit 11 acquires vehicle dispatch reservation information, vehicle operation information, and user schedule information.

[0027] Next, in step S2, the schedule change tolerance obtaining unit 12 obtains the change tolerance of the estimated arrival time T0 based on the user schedule information.

[0028] Next, in step S3, the route candidate calculation unit 13 calculates a plurality of route candidates based on the vehicle reservation information.

[0029] Next, in step S4, the arrival time estimation unit 14 calculates the estimated arrival time and the degree of variation in the estimated arrival time for each of the route candidates.

[0030] Then, in step S5, the recommended route candidate determination unit 15 excludes from the route candidates those routes whose average value of estimated arrival times (average estimated arrival time) and degree of variation are larger than the others.

[0031] Then, in step S6, the recommended route candidate determination unit 15 determines, based on the estimated arrival time, whether or not there is a recommended route candidate among the multiple route candidates that allows the vehicle 2 to arrive at the destination Pg earlier than the estimated arrival time T0. Note that a "recommended route candidate that allows the vehicle 2 to arrive at the destination Pg earlier than the estimated arrival time T0" refers to a recommended route candidate for which the possibility that the vehicle 2 will arrive at the destination Pg before the estimated arrival time T0 is equal to or greater than a predetermined value.

[0032] If it is determined in step S6 that there is no recommended route candidate that can arrive at the destination Pg earlier than the estimated arrival time T0, then in step S7 the controller 10 outputs information notifying the electronic terminal 3 that the estimated arrival time T0 will not be met. Then, in step S8, the route presenting unit 16 presents the route candidate with the shortest average estimated arrival time on the display device 32 of the electronic terminal 3.

[0033] On the other hand, if it is determined in step S6 that "there is a recommended route candidate that will allow the vehicle to arrive at the destination Pg earlier than the estimated arrival time T0," then in step S9, the recommended route candidate determination unit 15 determines whether there are multiple recommended route candidates.

[0034] If it is determined in step S9 that there are no multiple recommended route candidates, i.e., there is only one recommended route candidate, then in step S10, the route presenting unit 16 presents the recommended route candidate on the display device 32 of the electronic terminal 3.

[0035] On the other hand, if it is determined in step S9 that "there are multiple recommended route candidates," then in step S11, the route presenting unit 16 determines whether the user's tolerance for schedule changes is lower than a predetermined level.

[0036] If it is determined in step S11 that the "change tolerance degree is equal to or greater than a predetermined degree," in step S12, the route presentation unit 16 outputs to the electronic terminal 3 information that gives priority to recommended route candidates with shorter average estimated arrival times.

[0037] On the other hand, if it is determined in step S11 that the "change tolerance degree is lower than the predetermined degree," in step S13, the route presentation unit 16 outputs to the electronic terminal 3 information that gives priority to recommended route candidates with smaller degrees of variation.

[0038] After the processes of steps S8, S10, S12, and S13, in step S14, the vehicle allocation plan generator 17 determines whether or not the route determination result has been input to the input device 31 of the electronic terminal 3. If the route determination result has not been input to the electronic terminal 3, the controller 10 repeats the process of step S14.

[0039] On the other hand, if it is determined in step S14 that "the route determination result has been input to the electronic terminal 3", the vehicle allocation plan generating unit 17 generates a vehicle allocation plan in step S15.

[0040] In the flowchart shown in FIG. 4, the process of step S5 may be omitted, as indicated by the dashed line.

[0041] As described above, the vehicle dispatch management device 100 according to this embodiment acquires a change tolerance for the estimated arrival time T0 for the user to arrive at a predetermined destination based on user schedule information, calculates multiple route candidates A and B based on the vehicle dispatch reservation information, and calculates the estimated arrival time and the degree of variation in the estimated arrival times for each of the route candidates A and B. The vehicle dispatch management device 100 then determines, based on the estimated arrival time, whether there are multiple recommended route candidates among the multiple route candidates A and B that have a probability of allowing the vehicle 2 to arrive at the destination Pg before the estimated arrival time T0 that is equal to or greater than a predetermined value. If the user's change tolerance for the schedule is lower than the predetermined value and there are multiple recommended route candidates, the vehicle dispatch management device 100 outputs information to the electronic terminal that preferentially recommends a second recommended route candidate having a second degree of variation that is smaller than the first degree of variation over a first recommended route candidate having a first degree of variation. That is, when the user's tolerance for schedule changes is lower than a predetermined value (when the user's schedule is difficult to change), the vehicle dispatch management device 100 presents information to the user so that the smaller the degree of variance in the recommended route candidate, the higher the priority of the recommended route candidate. As a result, when the user's schedule is difficult to change, the vehicle dispatch management device 100 prioritizes recommending to the user route candidates whose actual arrival time is less likely to be earlier or later than the estimated arrival time T0. This allows the vehicle dispatch management device 100 to present route candidates to the user so that the user can be sure to arrive on time for a schedule that is difficult to change. Furthermore, when the user's tolerance for schedule changes is lower than a predetermined value (when the user's schedule is difficult to change), the smaller the degree of variance in the estimated arrival time, the more likely the route is to be selected as the route on which the vehicle 2 will travel. The vehicle dispatch management device 100 can then arrange for the vehicle 2 to be dispatched so that the user can arrive on time for a schedule that is difficult to change. Furthermore, by selecting the route candidates that the vehicle dispatch management device 100 preferentially recommends, the user can more easily predict the time at which the vehicle 2 will arrive at the destination Pg.

[0042] The user schedule information also includes the schedule details after the user arrives at the destination Pg, and the schedule change tolerance degree acquisition unit 12 calculates the change tolerance degree based on the schedule details. This allows the vehicle dispatch management device 100 to determine whether the change tolerance degree is lower than a predetermined degree based on the specific schedule details.

[0043] Furthermore, the plan change tolerance degree acquisition unit 12 of the vehicle dispatch management device 100 calculates the change tolerance degree based on the name of the plan content input by the user to the electronic terminal 3. This allows the vehicle dispatch management device 100 to determine whether the change tolerance degree is lower than a predetermined degree based on the specific name of the plan content. For example, if the database 300 stores a list associating the name of the plan content with the change tolerance degree, the plan change tolerance degree acquisition unit 12 can acquire the change tolerance degree from the database 300 based on the name of the plan content input to the electronic terminal 3.

[0044] Furthermore, the schedule change tolerance acquisition unit 12 of the vehicle dispatch management device 100 calculates a higher change tolerance degree when the schedule contents can be changed at the will of the user or other people belonging to a predetermined group including the user than when the schedule contents cannot be changed at the will of the user or other people belonging to a predetermined group including the user. This allows the vehicle dispatch management device 100 to determine that the change tolerance degree of schedules whose times cannot be easily changed, such as facility visits (hospital visits or meetings) and work attendance (in the case of a non-flexible work schedule), is lower than the predetermined degree.

[0045] The user schedule information may include a change tolerance level input by the user to the electronic terminal 3. This allows the schedule change tolerance level acquisition unit 12 to acquire a change tolerance level that reflects the user's intention.

[0046] Furthermore, the information acquisition unit 11 of the vehicle dispatch management device 100 acquires user schedule information by receiving the user's schedule or transportation connection information from the electronic terminal 3. This allows the vehicle dispatch management device 100 to acquire user schedule information including specific details of the user's schedule even if the user does not input the schedule details or the degree of tolerance for changes into the electronic terminal 3.

[0047] Furthermore, when there is no recommended route candidate that will allow the vehicle 2 to arrive at the destination Pg in time for the estimated arrival time T0, the route presentation unit 16 of the vehicle dispatch management device 100 outputs information to the electronic terminal 3 that preferentially recommends a second route candidate whose average estimated arrival time is a second average estimated arrival time that is earlier than the first average estimated arrival time, over a first route candidate whose average estimated arrival time is the first average estimated arrival time. This allows the vehicle dispatch management device 100 to present information to the user so that a route candidate that will allow the vehicle 2 to arrive at the destination Pg as quickly as possible is preferentially recommended, even if the possibility that the vehicle 2 will not arrive at the destination Pg in time for the estimated arrival time T0 is higher than a predetermined value.

[0048] Furthermore, when the user's tolerance for schedule changes is equal to or greater than a predetermined level, the vehicle dispatch plan generation unit 17 of the vehicle dispatch management device 100 generates a vehicle dispatch plan that allows ride-sharing in the vehicle 2. As a result, when the user's schedule is one that can be easily changed due to going home or shopping, or when the user does not have another schedule, the vehicle dispatch management device 100 allows ride-sharing with other users, thereby enabling efficient operation of the vehicle 2.

[0049] Furthermore, the recommended route candidate determination unit 15 of the vehicle dispatch management device 100 excludes from the route candidates any route that has a larger average estimated arrival time and a larger degree of variation than the others. This allows the vehicle dispatch management device 100 to exclude in advance from the route candidates to be presented to the user any route that is less advantageous for the user to select than other routes.

[0050] Furthermore, the information acquisition unit 11 of the vehicle dispatch management device 100 acquires driving history information of the vehicle 2, and the arrival time estimation unit 14 acquires road link required time information including required times corresponding to the date type and time zone of each road link based on the driving history information, and calculates the estimated arrival time and degree of variation based on the road link required time information. This allows the vehicle dispatch management device 100 to calculate more accurate estimated arrival times and degrees of variation based on the driving history information of the actual vehicle 2.

[0051] Furthermore, the arrival time estimation unit 14 of the vehicle dispatch management device 100 calculates variation thresholds Da and Db that define an acceptable range for the degree of variation according to a predetermined standard, and calculates effective estimated arrival times Tb1 and Ta1 based on the variation thresholds Da and Db. If the effective estimated arrival times Tb1 and Ta1 are earlier than the estimated arrival time T0, the recommended route candidate determination unit 15 determines that the possibility that the vehicle 2 will be able to arrive at the destination Pg before the estimated arrival time T0 is equal to or greater than a predetermined value. This allows the vehicle dispatch management device 100 to determine whether the possibility that the vehicle 2 will be able to arrive at the destination Pg before the estimated arrival time T0 is equal to or greater than a predetermined value, based on the effective estimated arrival times Tb1 and Ta1.

[0052] 2 Vehicle 3 Electronic terminal 100 Vehicle dispatch management device 10 Controller 11 Information acquisition unit 12 Schedule change tolerance acquisition unit 13 Route candidate calculation unit 14 Arrival time estimation unit 15 Recommended route candidate determination unit 16 Route presentation unit 17 Vehicle dispatch plan generation unit

Claims

1. A vehicle dispatching management device that generates a vehicle dispatching plan based on a vehicle dispatching request received from an electronic terminal possessed by a user and manages the vehicle dispatching based on the vehicle dispatching plan, comprising: an information acquisition unit that acquires vehicle reservation information, vehicle operation information, and user schedule information; a scheduled change tolerance acquisition unit that acquires a change tolerance for the scheduled arrival time for the user to arrive at a predetermined destination based on the user schedule information; a route candidate calculation unit that calculates a plurality of route candidates based on the vehicle reservation information; an arrival time estimation unit that calculates an estimated arrival time and a degree of variation of the estimated arrival time for each of the route candidates; a recommended route candidate determination unit that determines, based on the estimated arrival time, whether there are a plurality of recommended route candidates among the plurality of route candidates, in which the possibility that the vehicle can arrive at the destination before the scheduled arrival time is equal to or greater than a predetermined value; a route presentation unit that outputs, to the electronic terminal, information preferentially recommending a second recommended route candidate having a second degree of variation smaller than the first degree of variation of a first recommended route candidate having the first degree of variation when the change tolerance is lower than a predetermined degree and there are a plurality of recommended route candidates; and a vehicle dispatching plan generation unit that generates the vehicle dispatching plan based on the vehicle operation information and the route determination result when a route determination result is input to the electronic terminal.

2. The vehicle dispatching management device according to claim 1, wherein the user schedule information includes the schedule content after the user arrives at the destination, and the scheduled change tolerance acquisition unit calculates the change tolerance based on the schedule content.

3. The vehicle dispatching management device according to claim 2, wherein the scheduled change tolerance acquisition unit calculates the change tolerance based on the name of the schedule content input by the user to the electronic terminal.

4. The vehicle dispatching management device according to claim 2, wherein the scheduled change tolerance acquisition unit determines whether the schedule content is content that can be changed in time according to the intention of the user or another person belonging to a predetermined group including the user, and when the schedule content can be changed according to the intention of the user or the other person, calculates a higher change tolerance than when the schedule content cannot be changed according to the intention of the user or the other person.

5. The vehicle allocation management device according to claim 1, wherein the user schedule information includes the degree of allowable change input by the user to the electronic terminal.

6. The vehicle allocation management device according to claim 1, 2, or 4, wherein the information acquisition unit acquires the user schedule information by receiving the user's schedule or transfer information of transportation means from the electronic terminal.

7. The vehicle allocation management device according to any one of claims 1 to 6, wherein when there is no candidate for the recommended route, the route presentation unit outputs to the electronic terminal information preferentially recommending a second route candidate having a second average arrival estimation time, which is earlier than a first average arrival estimation time of a first route candidate that is the average value of the arrival estimation times, rather than the first average arrival estimation time.

8. The vehicle allocation management device according to any one of claims 1 to 7, wherein when the degree of allowable change is equal to or greater than a predetermined degree, the vehicle allocation plan generation unit generates the vehicle allocation plan so as to allow boarding the vehicle.

9. The vehicle allocation management device according to any one of claims 1 to 8, wherein the recommended route candidate determination unit excludes from the route candidates a route having both an average arrival estimation time, which is the average value of the arrival estimation times, and a degree of variation greater than others.

10. The information acquisition unit acquires the driving history information of the vehicle. The arrival time estimation unit acquires road link required time information including required times corresponding to the date type and time zone of each road link based on the driving history information. Based on the road link required time information, the arrival estimation time and the degree of variation are calculated. The vehicle allocation management device according to any one of claims 1 to 9.

11. The arrival time estimation unit calculates a variation threshold that defines an allowable range for the degree of variation according to a predetermined criterion, calculates an effective arrival estimation time based on the variation threshold, and the recommended route candidate determination unit determines that when the effective arrival estimation time is earlier than the scheduled arrival time, the possibility that the vehicle can arrive at the destination before the scheduled arrival time is equal to or greater than a predetermined value. The vehicle allocation management device according to any one of claims 1 to 10.

12. A vehicle allocation management method that uses a controller to generate a vehicle allocation plan based on a vehicle allocation request received from an electronic terminal owned by a user, and manages the vehicle allocation based on the vehicle allocation plan, wherein the controller: obtains vehicle reservation information, vehicle operation information, and user schedule information; obtains a degree of allowable change in the estimated arrival time for the user to arrive at a predetermined destination based on the user schedule information; calculates a plurality of route candidates based on the vehicle reservation information; calculates the estimated arrival time and the degree of variation of the estimated arrival time for each of the route candidates; determines, based on the estimated arrival time, whether there are a plurality of recommended route candidates among the plurality of route candidates that have a possibility of the vehicle arriving at the destination before the estimated arrival time that is equal to or greater than a predetermined value; when the degree of allowable change is lower than a predetermined degree and there are a plurality of recommended route candidates, outputs information to preferentially recommend a second recommended route candidate having a second degree of variation that is smaller than the first degree of variation of a first recommended route candidate having the first degree of variation to the electronic terminal; and generates the vehicle allocation plan based on the vehicle operation information and the selection result when a selection result of the route candidate is input to the electronic terminal.

Images