Information processing method, information processing device, and program

Abstract

To provide an information processing method or the like for reflecting a cost required for operation on a burden of each person who wishes to ride.SOLUTION: In an information processing method, a computer executes processing for: receiving a plurality of vehicle allocation requests 41 specifying pick-up points and drop-off points corresponding to a plurality of users, respectively; generating a shared ride route 42 for picking up and dropping off each user at each pick-up point and drop-off point based on the plurality of vehicle allocation requests 41; obtaining a first fare for pick-up and drop-off on the shared ride route 42 and a second fare for pick-up and drop-off for each user individually on an individual route connecting the pick-up point and drop-off point specified by each user; acquiring a detour time or a detour distance for each user based on the shared ride route 42 and the individual route; and calculating a shared-ride discount rate or a shared-ride discount amount for each user based on the first fare, the second fare for each user, and the detour time or detour distance.SELECTED DRAWING: Figure 1

Description

[Technical Field]

[0001] The present invention relates to an information processing method, an information processing device, and a program. [Background technology]

[0002] An information processing device has been proposed that dynamically generates an operation plan for an on-demand bus or the like in response to requests from passengers wishing to board the bus (Patent Document 1). [Prior art documents] [Patent documents]

[0003] [Patent Document 1] International Publication No. 2020 / 262673 Summary of the Invention [Problem to be solved by the invention]

[0004] When a route is dynamically generated, the cost of operation also changes dynamically. However, in Patent Document 1, the cost of operation cannot be reflected in the burden of each passenger who wishes to board the vehicle.

[0005] In one aspect, an object of the present invention is to provide an information processing method etc. that reflects the costs required for operation in the burden on each passenger wishing to board. [Means for solving the problem]

[0006] The information processing method receives a plurality of dispatch requests each specifying a boarding point and a drop-off point corresponding to a plurality of users, generates a shared ride route for picking up and dropping off each user at each boarding point and a drop-off point based on the plurality of dispatch requests, obtains a first fare for picking up and dropping off using the shared ride route, and a second fare which is the travel distance of an individual route that is a route connecting the boarding points and a drop-off points specified by each user when picking up and dropping off each user individually, or the fare for the individual route, and calculates the amount of the first fare to be paid for each user by dividing the first fare proportionally based on the travel distance of the individual route or the fare for the individual route. The ride-sharing fee paid by each user using the ride-sharing route is determined by adjusting the amount of the payment based on a ride-sharing discount rate or a ride-sharing discount amount determined for each user and a predetermined basic discount rate or a basic discount amount. The processing is performed by a computer. [Effects of the Invention]

[0007] In one aspect, it is possible to provide an information processing method or the like that reflects the cost required for operation in the burden on each passenger wishing to board. [Brief explanation of the drawings]

[0008] [Figure 1] FIG. 1 is an explanatory diagram illustrating an overview of a vehicle dispatch system. [Figure 2] FIG. 1 is an explanatory diagram illustrating a configuration of a vehicle dispatch system. [Figure 3] FIG. 2 is an explanatory diagram illustrating the record layout of a vehicle dispatch request DB. [Figure 4] 10 is a flowchart illustrating the flow of processing of a program. [Figure 5] 10 is a flowchart illustrating the flow of processing of a program. [Figure 6] 10 is an example of a screen of a second information processing device. [Figure 7] 10 is an example of a screen of a first information processing device. [Figure 8] 10 is an example of a screen of a second information processing device according to the first modification. [Figure 9] 10 is an example of a screen of a second information processing device according to a second modification. [Figure 10] 13 is an example of a screen of a second information processing device in Modification 3. [Figure 11] 10 is a diagram illustrating an example of a screen of a second information processing device according to the second embodiment. [Figure 12] 10 is a diagram illustrating an example of a screen of a second information processing device according to the second embodiment. [Figure 13] 13 is an example of a screen of a second information processing device according to the fourth embodiment. [Figure 14] FIG. 13 is an explanatory diagram schematically showing a carpooling route according to the fifth embodiment and an example screen of a second information processing device. [Figure 15] FIG. 13 is an explanatory diagram showing a schematic diagram of a carpooling route according to variant example 7. [Figure 16] FIG. 13 is an explanatory diagram illustrating the configuration of a vehicle dispatch system according to a sixth embodiment. [Figure 17] FIG. 13 is a functional block diagram of an information processing device according to a seventh embodiment. DETAILED DESCRIPTION OF THE INVENTION

[0009] [Embodiment 1] Fig. 1 is an explanatory diagram illustrating an overview of a vehicle dispatch system 10 (see Fig. 2). The vehicle dispatch system 10 of this embodiment dispatches a vehicle 15 in response to a request from a passenger wishing to board. The operation of one vehicle 15 will be described as an example.

[0010] The vehicle 15 dispatched by the vehicle dispatch system 10 is, for example, a shared taxi or shared bus driven by a driver. The vehicle dispatch system 10 notifies the driver of the vehicle dispatch plan 43 via a mobile terminal such as a smartphone or tablet used by the driver. The mobile terminal may also serve as a car navigation device installed in the vehicle 15. The vehicle 15 may be a so-called self-driving vehicle that travels autonomously based on instructions from the vehicle dispatch system 10.

[0011] The vehicle allocation plan 43 will now be described. In the example shown in Fig. 1, the vehicle 15 travels along the carpooling route 42 "S01" from time T01 to time T02. Similarly, the vehicle 15 travels along the carpooling route 42 "S02" from time T03 to time T04, and travels along the carpooling route 42 "S03" from time T05 to time T06. The vehicle allocation plan 43 means a plan in which one vehicle 15 travels along a plurality of carpooling routes 42 in sequence as described above.

[0012] The time period from time T02 to time T03 and the time period from time T04 to time T05 are allocated to the transportation time of the vehicle 15, the driver's rest time, the time to refuel the vehicle 15, and the time for maintenance of the vehicle 15. Here, the transportation time means the travel time for moving the vehicle 15 from the end point of the previous carpooling route 42 to the starting point of the next carpooling route 42.

[0013] Using "S02" as an example, the carpooling route 42 will be described. The carpooling route 42 is generated based on a car dispatch request 41 of "R1" heading from point P1 to point P2 and a car dispatch request 41 of "R2" heading from point P3 to point P4. As shown by the thick line, the vehicle 15 travels in the order of point P1, point P3, point P2, and point P4. At point P1, the user who made the car dispatch request 41 of "R1" gets on, and at point P3, the user who made the car dispatch request 41 of "R2" gets on. At point P2, the user who made the car dispatch request 41 of "R1" gets off, and at point P3, the user who made the car dispatch request 41 of "R2" gets off.

[0014] The carpooling route 42 is generated based on the boarding points, disembarking points, desired travel time periods, number of people, and the like, received from multiple users. A method for generating the carpooling route 42 is disclosed in, for example, Patent Document 1, and therefore a description thereof will be omitted. The carpooling route 42 may be generated by the vehicle dispatching system 10, or may be generated by another system connected to the vehicle dispatching system 10 via a network.

[0015] The ride-sharing route 42 is generated, for example, the day before or several days before the vehicle 15 travels, and each user is notified of the boarding and disembarking points, boarding times, and disembarking times. The scheduled boarding and disembarking times for each user are notified within a range of, for example, 15 to 30 minutes. An example of a method for calculating the costs borne by each user will be described later.

[0016] The following explanation will be given by taking as an example a case where a ride-hailing request 41 for "R3" heading from point P5 to point P6 is added during the time period when "S02" is scheduled to travel along the ride-sharing route 42. Note that "R3" may be added before the vehicle 15 starts traveling, or while the vehicle 15 is traveling. "R3" may be added before the scheduled boarding time and other information for "S02"'s ride-sharing route 42 are notified to each user.

[0017] A more detailed explanation will be given below. The carpooling route 42 may be completed before the vehicle 15 starts traveling along the carpooling route 42. For example, for the carpooling route 42 "departing from within the 23 wards and arriving at Narita Airport at 1:00 PM on October 31st," all users who will board the route are confirmed by the time the vehicle 15 departs, and no additional users are accepted after that. By not allowing changes to stopovers and routes during the ride, it is possible to provide a vehicle dispatch system 10 that does not cause anxiety to users who are concerned about their flight boarding times.

[0018] A ride-sharing user may be added even after vehicle 15 has started traveling. For example, while vehicle 15 is traveling with user "X" who has made a ride-sharing request 41 "R1" on board, vehicle dispatch system 10 may accept a ride-sharing request 41 "R2" and travel along vehicle dispatch route 42 "S02" shown in FIG. 1. If vehicle dispatch request 41 "R3" is further accepted while vehicle 15 is traveling, vehicle dispatch request 41 is updated to "S02b." In this way, vehicle dispatch system 10 may accept ride-sharing requests 41 at any time and update vehicle dispatch route 42 even while vehicle 15 is traveling.

[0019] For example, in areas with high population density and many users, such as within the 23 wards, it is easy to accept additional dispatch requests 41 while vehicle 15 is traveling without significantly affecting the boarding and disembarking times of users who have already confirmed their rides.

[0020] When an additional dispatch request 41 is received while the vehicle 15 is traveling and the ride-sharing route 42 is updated, the fares for existing users may be updated each time. As the number of users sharing the same vehicle 15 increases, the fares become cheaper, which is an advantage. This makes it possible to provide a ride-sharing system 10 that makes it easy for users to accept route changes and an increase in passengers while riding.

[0021] A new carpool route 42 for "S02b" is generated, which runs between time T03b and time T04b. In "S02b," as shown by the thick line, the vehicle 15 runs through points P1, P3, P5, P6, P2, and P4 in this order.

[0022] At point P1, a user who has made a dispatch request 41 for "R1" gets on, at point P3, a user who has made a dispatch request 41 for "R2" gets on, and at point P5, a user who has made a dispatch request 41 for "R3" gets on. At point P6, a user who has made a dispatch request 41 for "R3" gets off, at point P2, a user who has made a dispatch request 41 for "R1" gets off, and at point P4, a user who has made a dispatch request 41 for "R2" gets off.

[0023] When the ride-share route 42 changes from "S02" to "S02b," the travel distance and travel time of the vehicle 15 change. Therefore, the operating costs, such as fuel costs and driver working hours, change. The boarding times, alighting times, and travel times of the users of "R1" and "R2" may also change.

[0024] It is desirable that the new shared ride route 42 be set so that the change in the boarding times of the users "R1" and "R2" is within the originally planned time range. The car system 10 may notify each user of schedule changes. A large basic discount rate D may be applied to users who agree to accept changes in boarding and disembarking times after a reservation is confirmed. The basic discount rate D will be described later.

[0025] In this embodiment, an example will be described in which each user makes a dispatch request 41 for one passenger to board and disembark. By each user making an individual dispatch request 41, multiple passengers can board and disembark at the same location. The dispatch system 10 may accept multiple passengers boarding and disembarking with a single dispatch request 41. In such a case, the dispatch system 10 accepts the number of passengers in addition to the boarding and disembarking points.

[0026] The vehicle dispatch system 10 calculates the fare for each vehicle dispatch request 41, regardless of the number of passengers corresponding to each vehicle dispatch request 41. In this way, the fare does not change whether one person or two people board a vehicle for one vehicle dispatch request 41.

[0027] The vehicle dispatch system 10 may calculate the fare according to the number of passengers corresponding to the vehicle dispatch request 41. For example, if two people board one vehicle dispatch request 41, the vehicle dispatch system 10 calculates the fare for two vehicle dispatch requests 41 having the same boarding and dropping off points, and charges the user who sent the vehicle dispatch request 41 the fare for two people.

[0028] If a passenger satisfies certain conditions, such as a child, the fare for one person may be discounted to 0.5 people, etc. If two people board in one dispatch request 41, the fare for two people may not be charged, but an amount discounted from the fare for two people boarding in two dispatch requests 41 (for example, 1.5 people) may be charged.

[0029] 2 is an explanatory diagram illustrating the configuration of the vehicle dispatch system 10. The vehicle dispatch system 10 includes a first information processing device 20 and a plurality of second information processing devices 30. The first information processing device 20 includes a control unit 21, a main memory device 22, an auxiliary memory device 23, a communication unit 24, an input unit 251, an output unit 252, and a bus.

[0030] The control unit 21 is an arithmetic and control device that executes the program of this embodiment. The control unit 21 uses one or more CPUs (Central Processing Units), GPUs (Graphics Processing Units), TPUs (Tensor Processing Units), multi-core CPUs, etc. The control unit 21 is connected to each hardware unit constituting the first information processing device 20 via a bus.

[0031] The main memory device 22 is a memory device such as an SRAM (Static Random Access Memory), a DRAM (Dynamic Random Access Memory), or a flash memory. Information required during processing performed by the control unit 21 and programs currently being executed by the control unit 21 are temporarily stored.

[0032] The auxiliary storage device 23 is a storage device such as an SRAM, a flash memory, a hard disk, or a magnetic tape. The auxiliary storage device 23 stores the dispatch request DB 51, the programs to be executed by the control unit 21, and various data required for executing the programs. The communication unit 24 is an interface for communication between the first information processing device 20 and the network.

[0033] The input unit 251 is, for example, a keyboard and a mouse. The output unit 252 is, for example, a liquid crystal display panel or an organic EL (Electro Luminescence) panel. The input unit 251 may be stacked on the output unit 252 to form a touch panel. The output unit 252 may be a display device connected to the first information processing device 20.

[0034] The first information processing device 20 is a general-purpose personal computer, a tablet, a mainframe, or a virtual machine running on a mainframe. The first information processing device 20 may be configured with hardware such as multiple personal computers or mainframes that perform distributed processing. The first information processing device 20 may also be configured with a cloud computing system or a quantum computer.

[0035] The second information processing device 30 includes a control unit 31, a main storage device 32, an auxiliary storage device 33, a communication unit 24, an input unit 351, an output unit 352, and a bus. The control unit 31 is an arithmetic and control device that executes the program of this embodiment. The control unit 31 uses one or more CPUs, GPUs, multi-core CPUs, etc. The control unit 31 is connected to each hardware unit that constitutes the second information processing device 30 via the bus.

[0036] The main memory device 32 is a memory device such as an SRAM, a DRAM, a flash memory, etc. The main memory device 32 temporarily stores information required during processing performed by the control unit 31 and programs being executed by the control unit 31.

[0037] The auxiliary storage device 33 is a storage device such as an SRAM, a flash memory, a hard disk, or a magnetic tape. The auxiliary storage device 33 stores programs to be executed by the control unit 31 and various data required for executing the programs. The communication unit 34 is an interface for communication between the second information processing device 30 and a network.

[0038] The output unit 352 is, for example, a liquid crystal display panel or an organic EL panel. The input unit 351 and the output unit 252 are stacked to form a touch panel 35. The input unit 351 may be a microphone for voice input, and the output unit 352 may be a speaker. The second information processing device 30 is an information device used by an individual user, such as a general-purpose smartphone, personal computer, or tablet.

[0039] 3 is an explanatory diagram illustrating the record layout of the vehicle allocation request DB 51. The vehicle allocation request DB 51 is a DB that records vehicle allocation requests 41 received from individual users in association with carpooling routes 42 generated based on the vehicle allocation requests 41. The vehicle allocation request DB 51 includes a vehicle allocation request ID (Identifier) ​​field, a user ID field, a boarding location field, a drop-off location field, a desired boarding time field, a carpooling route ID field, and a status field.

[0040] The vehicle allocation request ID field stores a vehicle allocation request ID that is uniquely assigned to each vehicle allocation request 41 made by a user. The user ID field stores a user ID that is uniquely assigned to the user who made the vehicle allocation request 41. The user ID may be, for example, a mobile phone number or email address designated by the user.

[0041] The boarding point field records the boarding point designated by the user. The disembarking point field records the disembarking point designated by the user. The boarding point and disembarking point are recorded, for example, by latitude and longitude. The boarding point and disembarking point may also be recorded by a boarding / disembarking location ID assigned to a predetermined boarding / disembarking location such as a bus stop.

[0042] The desired boarding time field stores the desired boarding time specified by the user. As mentioned above, the desired boarding time is recorded within a predetermined range. Note that the dispatch request DB 51 may have a desired drop-off time field instead of or in addition to the desired boarding time field.

[0043] The carpool route ID field contains the carpool route ID uniquely assigned to carpool route 42. The "-" in the carpool route ID field indicates that the carpool route 42 has not been generated.

[0044] The status field records the status of the ride-sharing request 41. "Confirmed" means that it is confirmed that the user will use the carpooling route 42. "Unconfirmed" means that it is not confirmed that the user will use the carpooling route 42. "-" indicates that the carpooling route 42 has not been generated.

[0045] For example, when the control unit 21 transmits the ride-sharing route 42 generated based on the vehicle dispatch request 41 to the second information processing device 30, it records "unconfirmed" in the status field. When the control unit 21 receives approval from the user via the second information processing device 30, it records "confirmed" in the status field. The status field may also record the payment status of the fare and whether the user has boarded or disembarked. The vehicle dispatch request DB 51 has one record for each vehicle dispatch request 41.

[0046] An example of a method for calculating the fees borne by users of the carpooling route 42 will be described below. In the following explanation, an example will be given in which an operating company that operates the vehicle dispatch system 10 collects fees from users of the carpooling route 42 and pays the vehicle operating costs to the operator of the vehicle 15. Note that when the operating company operates the vehicle 15 itself, the vehicle operating costs are the total amount of the maintenance costs of the vehicle 15, depreciation costs, labor costs of the vehicle operating personnel, etc.

[0047] The ride-sharing fee U charged by the operating company to users using the ride-sharing route 42 is the amount obtained by subtracting the total discount rate C from the basic fee B. The total discount rate C is the sum of the ride-sharing discount rate S, the basic discount rate D, and the additional discount rate A. However, there is an upper limit to the total discount rate C. The additional discount rate A may be a negative value, i.e., a "subtractive discount rate."

[0048] The control unit 21 calculates the ride-sharing fee Ui to be charged to the ith user based on, for example, equations (1) and (2). Ui=Bi×(1-Ci) ‥‥‥ (1) Ci=Di+Ai+Si ‥‥‥ (2) Bi is the basic charge for the i-th user. Ci is the total discount rate for the i-th user. Di is the basic discount rate for the i-th user. Ai is the additional discount rate for the i-th user. Si is the carpool discount rate for the i-th user.

[0049] By calculating the product of the ride-sharing discount rate Si and the basic fee Bi, the control unit 21 can calculate the ride-sharing discount amount corresponding to the ride-sharing discount rate Si for each user.

[0050] The basic fare Bi of the i-th user is determined, for example, by the route from the boarding point to the drop-off point specified in the i-th user's dispatch request 41. For example, the basic fare Bi is the taxi fare from the boarding point to the drop-off point. The taxi fare is, for example, the taxi meter fare. The meter fare is calculated, for example, based on distance and time. The meter fare may be calculated based only on distance or only on time. The meter fare may be an amount that includes a late-night surcharge.

[0051] The basic fee Bi may be an amount to which a baggage fee determined according to the number and size of baggage, etc. is added. The basic fee Bi may also be a flat rate determined according to conditions such as region, day of the week, or ride time. The basic fee Bi is the second ride fare when each user is individually picked up and dropped off on an individual route connecting the pick-up point and drop-off point specified by the user in the ride request 41. This is an example of:

[0052] The basic discount rate Di of the i-th user is a discount rate applied to users who use the vehicle dispatch system 10. The basic discount rate Di is, for example, a discount rate common to all users. The basic discount rate Di may be determined for each condition, such as region, day of the week, or ride time.

[0053] For example, the basic discount rate Di is set for each period so that it is a small value when there is a high demand for the carpooling route 42 and a large value when there is a low demand for the carpooling route 42. Specifically, the basic discount rate Di is set to a small value during periods when there is expected to be a high demand for the carpooling route 42 due to consecutive holidays or when a large event is being held in the neighborhood.

[0054] The basic discount rate Di may be set to vary depending on the weather. For example, on bad weather days, the number of users who want to avoid walking and use the carpool route 42 increases, so the basic discount rate Di is set to a small value.

[0055] The basic discount rate Di may be set to vary depending on the boarding location or the disembarking location. For example, just before the start of an event, the number of users who want to disembark near the event venue increases. Therefore, the basic discount rate Di for disembarking near the event venue is set to a small value. As illustrated above, the basic discount rate may be set to vary depending on demand.

[0056] The basic discount rate Di may be determined according to the attributes of the driver, such as being a small value when a highly rated driver is in charge and being a large value when a low-rated driver or a less experienced driver is in charge. The basic discount rate Di may be determined according to the attributes of the vehicle 15, such as being a small value when a vehicle 15 with a good ride quality is used and being a large value when a vehicle 15 with a poor ride quality is used.

[0057] The basic discount rate D may be set to a different value for each user. For example, the control unit 21 can set the basic discount rate D for each user based on the user's usage history. By setting a large value for a user who has used the vehicle dispatch system 10 many times, it is possible to secure regular customers. For example, the basic discount rate D may be set to a large value for a user who has entered a discount coupon code such as "first time user."

[0058] The basic discount rate D may be determined based on the time between the time the user inputs the dispatch request 41 and the desired boarding time and the number of remaining seats in the vehicle 15. For example, if the desired boarding time is approaching and there are many remaining seats in the vehicle 15 scheduled to operate, the basic discount rate D can be set to a large value, thereby providing a dispatch system 10 in which the remaining seats are more likely to be purchased.

[0059] Instead of varying the basic discount rate D based on various conditions such as weather, an additional discount rate may be set that varies the basic discount rate D. In this case, the basic discount rate D may be fixed to a constant value.

[0060] The additional discount rate Ai for the i-th user is a discount rate that is added according to the user's conditions. For example, the additional discount rate Ai is set to a larger value the later the user decides to board. The additional discount rate Ai may be zero for users who reserve their boarding by a specified date, such as the day before boarding, and may be a positive value for users who decide to board on the day. The additional discount rate Ai may also be set according to the number of remaining vacant seats.

[0061] A user to whom a large additional discount rate Ai is applied can use the carpooling route 42 at a lower cost than other users. By appropriately setting the additional discount rate Ai, the operator of the vehicle dispatch system 10 can induce users to board the carpooling route 42 for which they want to fill vacant seats. By appropriately setting the additional discount rate Ai and consolidating users onto specific carpooling routes 42, the operator can reduce the overall cost of the vehicle dispatch system 10 and reduce environmental impacts such as carbon dioxide emissions.

[0062] As is clear from equations (1) and (2), even users to whom the additional discount rate Ai and the ride-sharing discount rate Si do not apply can receive a discount on the fare based on the basic discount rate Di. Therefore, even if, for example, no other users can be found and the user rides alone in vehicle 15, the user can still enjoy the benefits of ride-sharing.

[0063] In the above formula (2), the total discount rate C is calculated by adding the basic discount rate D, the additional discount rate A, and the shared discount rate S, but the basic discount rate D may also be adjusted by the additional discount rate A. In this case, the total discount rate can be calculated using formula (2'). Ci=D´i+Si ‥‥‥ (2´) Di is the basic discount rate adjusted by the additional discount rate Ai.

[0064] The basic discount rate D may be adjusted by the additional discount rate A, and then the overall discount rate C may be calculated using equation (2). This makes it possible to increase the influence of the additional discount rate A on the overall discount rate C.

[0065] The ride-sharing discount rate Si of the i-th user is the discount rate at which the distribution resource rate X is distributed and returned to each user. The distribution resource rate X is calculated, for example, by subtracting the ratio corresponding to the operating expenses of the vehicle dispatch system 10 and the expenses corresponding to the basic discount rate Di from the cost reduction rate resulting from using the ride-sharing route 42. The control unit 21 calculates the distribution resource rate X, for example, based on equation (3).

[0066]

number

[0067] The vehicle operating cost PT is, for example, a cost paid by an operating company to a vehicle operator, and is set to vary based on the conditions of the ride-sharing route 42, such as the planned distance or time of travel of the vehicle 15. The vehicle operating cost PT may include tolls for toll roads along the ride-sharing route 42. The vehicle operating cost PT may be set to a fixed amount regardless of the distance and time traveled. The vehicle operating cost PT may also be a rental fee for renting a vehicle 15, such as a taxi, for a specified period of time.

[0068] A specific example will be described using a case where the vehicle 15 is a taxi. For example, it is the taxi fare when the vehicle 15 actually travels along the carpooling route 42. The vehicle operating cost PT may be a taxi fare calculated by a simulation before the vehicle 15 actually travels along the carpooling route 42. The vehicle operating cost PT may be a standard fare set in advance for each carpooling route 42.

[0069] The vehicle operating cost PT may include a fee paid by the operating company to a payment service provider such as a credit card company. The vehicle operating cost PT may also include an insurance premium paid by the operating company to an insurance company. The vehicle operating cost PT is an example of a first fare when a user is picked up or dropped off using the shared route 42.

[0070] The operating expense rate E of the operating company includes the ratio of expenses required for the operating company to operate the vehicle dispatch system 10 and the ratio of profits obtained by the operating company. The distribution resource rate X may be calculated for each shared ride route 42, for each vehicle dispatch plan 43 for a predetermined period such as one day or half a day, or for all vehicles 15 dispatched by the vehicle dispatch system 10 for each predetermined period.

[0071] The control unit 21 calculates the ride-sharing discount rate Si of the i-th user based on, for example, equations (4) and (5).

[0072] Si=min{(X-Di)NWi,L} ‥‥‥ (4)

number

[0073] Wi is determined based on the increase in travel time required by each user due to using the shared route 42, for example. For example, the cost Q of time and energy incurred by the ith user due to a detour is quantified as cost Qi. The weight Wi can be defined as the ratio of the cost Q incurred by each user to the total cost Q, for example, as in equation (6).

[0074]

number

[0075] A specific explanation will be given using the carpool route 42 of "S02b" explained using Figure 1 as an example. In the following explanation, the user "R1" is the first user, the user "R2" is the second user, and the user "R3" is the third user. The number of users N is 3.

[0076] The first user boards the bus at point P1, takes a detour route that passes through points P3, P5, and P6, and gets off at the destination point P2. The second user boards the bus at point P3, takes a detour route that passes through points P5, P6, and P2, and gets off at the destination point P4. The third user boards the bus at point P5 and gets off at point P6 without taking a detour.

[0077] The explanation will continue using an example in which the cost Q borne by the first, second, and third users by using the carpooling route 42 is scored as 3 points, 2 points, and 1 point, respectively. Note that the cost Q is determined based on, for example, the increase in ride time or travel distance for each user due to a detour, or both the ride time and travel distance. Based on equation (6), the control unit 21 calculates that the weights W of the first, second, and third users are 3 / 6, 2 / 6, and 1 / 6, respectively.

[0078] When the distribution resource rate X shown in formula (3) is 40 percent, the basic discount rate D of all users is 10 percent, and the upper limit discount rate L is 35%, the control unit 21 calculates the piggyback discount rate Si of each user as follows: Si is expressed in percent. S1=min{(40-10)×3×3 / 6,35}=35 S2=min{(40-10)×3×2 / 6,35}=30 S3=min{(40-10)×3×1 / 6,35}=15

[0079] If the additional discount rate A1 for the first user is set to 0 percent, and the additional discount rates A2 and A3 for the second and third users are set to 5 percent, the control unit 21 calculates the total discount rate Ci for each user using equation (2) as follows: The unit of the total discount rate Ci is percent. C1=10+0+35=45 C2=10+5+30=45 C3=10+5+15=30

[0080] Therefore, as explained using equation (1), the control unit 21 calculates that the ride-sharing fees U1 and U2 paid by the first and second users are 45 percent off the basic fee B for those users, and the ride-sharing fee U3 paid by the third user is 30 percent off the basic fee B for those users.

[0081] As explained above, each user's total discount rate C and the ride-sharing discount amount based on the total discount rate C are calculated based on the first fare, the second fare, and the cost Q, such as detour time or detour distance, that the user incurs by using the ride-sharing route 42.

[0082] Here, the detour time refers to the additional time compared to when a user travels alone without using the carpooling route 42. The detour time includes both the increase in the travel time of the vehicle 15 due to using the carpooling route 42 and the time it takes for other users to get on and off. For example, when another user gets on or off along the same route as when a user travels alone, the detour distance is zero, but the detour time is not zero. Therefore, even for such a user, cost Q is incurred by using the carpooling route 42, and a discount is received for using the carpooling route 42.

[0083] In more detail, the total discount rate C for each user and the discount amount based on the total discount rate C are calculated based on the total second fare, which is the sum of the first fare and the second fare of each user, and the cost Q, such as detour time or detour distance, that the user incurs by using the shared route 42.

[0084] For example, if the weight W is set to increase as the increase in travel time increases, a larger total discount rate C will be applied to users with a larger increase in travel time. Similarly, if the weight W is set to increase as the increase in travel distance increases, a larger total discount rate C will be applied to users with a larger increase in travel distance. A vehicle dispatch system 10 can be provided that reduces the fare burden for users who incur large non-monetary costs such as increased travel time.

[0085] The fare calculation method described using equations (1) to (6) is merely an example. For example, the fare for all users using the carpool route 42 may be set to the same fare, regardless of the travel distance, etc.

[0086] A basic discount amount G may be determined instead of the basic discount rate D. The control unit 21 calculates the ride-sharing fare Ui to be charged to the i-th user based on, for example, equations (7) and (8) instead of equations (1) and (2). Ui=(Bi-Gi)×(1-Ci) ‥‥‥ (1) Ci=Ai+Si ‥‥‥ (2) Gi is the basic discount amount for the i-th user.

[0087] The basic discount amount G is a discount amount applied to users who use the vehicle dispatch system 10. The basic discount amount G is, for example, a discount amount common to all users. The basic discount amount G may be determined for each condition such as region, day of the week, or ride time. The basic discount amount G may be determined to be a different value for each user. The basic discount amount G may be determined according to the basic fare B.

[0088] Instead of varying the basic discount amount G based on various conditions such as region, day of the week, time, etc., an additional discount amount may be determined to vary the basic discount amount G. In this case, the basic discount amount G may be fixed to a certain value.

[0089] 4 is a flowchart illustrating the flow of program processing. The control unit 21 executes the program described with reference to FIG. 4 periodically or when the number of unprocessed records recorded in the vehicle dispatch request DB 51 exceeds a predetermined threshold.

[0090] The control unit 21 reads from the vehicle dispatch request DB 51 records in which "-" is recorded in the carpool route ID field, i.e., records for which no corresponding carpool route 42 has been generated (step S501). Note that the control unit 21 does not need to read vehicle dispatch requests 41 that are more than a predetermined number of days in the future.

[0091] The control unit 21 generates a vehicle allocation plan 43 (step S502) using, for example, the method disclosed in Patent Document 1. Specifically, the control unit 21 clusters the records acquired in step S501 based on the desired boarding date and time, boarding point, and disembarking point, and generates an operation plan for a carpooling route 42 that can be operated efficiently for each cluster.

[0092] In addition, for example, if vehicle 15 cannot be forwarded between the time when one carpooling route 42 ends and the time when the next carpooling route 42 begins, if the driver cannot ensure the required rest time, if time to refuel vehicle 15 cannot be ensured, or if the required leeway time in preparation for traffic congestion, etc. cannot be ensured, control unit 21 will regenerate vehicle dispatch plan 43.

[0093] If the travel distance of one ride-sharing route 42 exceeds the travelable distance of the vehicle 15, the control unit 21 may regenerate the vehicle allocation plan 43. A carpool route 42 like this may be generated.

[0094] The control unit 21 calculates the ride-sharing fare for each user based on the calculation method explained using equations (1) to (6) (step S503). Note that, for example, if the total discount rate Ci does not satisfy a predetermined condition, the control unit 21 may return to step S502 and regenerate the vehicle allocation plan 43.

[0095] The control unit 21 transmits information such as the boarding point, disembarking point, boarding time, disembarking time, fare, and discount rate to the second information processing device 30 used by each user who has made the vehicle dispatch request 41 (step S504). The control unit 31 receives the transmitted information (step S601). The control unit 31 displays the received information on the touch panel 35 (step S602). The control unit 31 accepts an operation by the user to confirm or reject the reservation (step S603). The control unit 31 may also accept an operation by the user to pay the reservation fee or to cancel the application. The control unit 31 transmits the accepted operation to the first information processing device 20 (step S604).

[0096] The control unit 21 receives the transmitted operation content (step S505). The control unit 21 records the received operation content in the status field of the corresponding record in the vehicle allocation request DB 51 (step S506). The control unit 21 ends the process.

[0097] 5 is a flowchart illustrating the flow of program processing. Using FIG. 5, the flow of processing for adding a new vehicle dispatch request 41 to an already generated ride-sharing route 42 will be described. The control unit 31 accepts input of a vehicle dispatch request 41 by a user (step S611). The control unit 31 transmits the accepted vehicle dispatch request 41 to the first information processing device 20 (step S612).

[0098] The control unit 21 receives the vehicle allocation request 41 (step S511). The control unit 21 determines whether or not a vehicle allocation plan 43 for the cluster corresponding to the received vehicle allocation request 41 has already been generated (step S512). If it is determined that the vehicle allocation plan 43 has not already been generated (NO in step S512), the control unit 21 creates a new record in the vehicle allocation request DB 51 and records the vehicle allocation request 41 received in step S511 (step S513).

[0099] The control unit 21 transmits a notification to the second information processing device 30 indicating that the dispatch request 41 has been accepted and a notification of the expected time for creating the dispatch plan 43, etc. (step S514). The control unit 21 returns to a state of waiting for receipt of the dispatch request 41. The control unit 31 receives the notification (step S621). The control unit 31 displays the received notification on the touch panel 35 (step S622). The control unit 31 ends the processing.

[0100] If it is determined that the route has been generated (YES in step S512), the control unit 21 selects a first carpooling route 42 for the cluster corresponding to the dispatch request 41 (step S521). The control unit 21 generates a second carpooling route by adding the dispatch request 41 received in step S511 to the first carpooling route (step S522).

[0101] If the time interval between the generated second shared route and the preceding or following shared route 42 is shorter than a predetermined threshold, the control unit 21 regenerates the dispatch plan 43. The predetermined threshold is, for example, the time required for the driver's rest time, the time required for the vehicle 15 to be forwarded, the time required for refueling the vehicle 15, and the time required for maintenance of the vehicle 15.

[0102] The travel distance between the end point of the previous carpooling route 42 and the start point of the generated second carpooling route, or the travel distance between the end point of the generated second carpooling route and the start point of the next carpooling route 42 is longer than a predetermined threshold, the control unit 21 may regenerate the vehicle allocation plan 43. While the vehicle allocation plan 43 is being regenerated, the accepted vehicle allocation request 41 is not permitted to be incorporated into the carpool route 42.

[0103] The control unit 21 calculates the ride-sharing fee for the second ride-sharing route (step S523). For example, the control unit 21 recalculates the ride-sharing fees for all the dispatch requests 41 included in the ride-sharing route 42 based on equations (1) to (6). The control unit 21 may calculate the ride-sharing fee for the added dispatch request 41 by adding a predetermined amount to the increase in the operation cost without changing the fee for the existing dispatch request 41.

[0104] The control unit 21 transmits information such as the boarding point, disembarking point, boarding time, disembarking time, fare, and discount rate to the second information processing device 30 for the dispatch request 41 in which conditions such as the ride-sharing fare and boarding time are changed (step S504). The subsequent processing is the same as the processing described using FIG. 4, and therefore description thereof will be omitted.

[0105] For example, for each dispatch request 41 in the first shared ride route, the control unit 21 generates a second shared ride route under the condition that each user can board and disembark within the range of boarding times and disembarking times that have been notified to the users. For example, for a user who has approved changes to the boarding time and disembarking time, the control unit 21 may generate a second shared ride route taking into account the condition.

[0106] Fig. 6 is an example of a screen of the second information processing device 30. Fig. 6 shows an example of a screen that the control unit 31 displays on the touch panel 35 in step S602 described using Fig. 4. A map field 61 is displayed in the upper half of the screen. A shuttle button 641 and a taxi button 642 are displayed in the center of the screen. Fig. 6 shows a state in which the shuttle button 641 is selected. A candidate field 65 is displayed below the shuttle button 641. An application button 691 is displayed at the bottom of the screen.

[0107] The map section 61 displays a boarding location mark 621 indicated by a black circle, a disembarking location mark 622 indicated by a white circle, and a route mark 628 connecting the boarding location mark 621 and the disembarking location mark 622. The estimated boarding time, which has a 25-minute time window, is displayed near the boarding location mark 621. The estimated arrival time, which has a 1-hour time window, is displayed near the disembarking location mark 622.

[0108] The candidate column 65 displays the scheduled boarding time, scheduled disembarking time, and fare. The fare, "9,086 yen," indicates the fare for a shared ride via the dispatch system 10. The "12,980 yen for a single person in a taxi" at the bottom of the candidate column 65 indicates the approximate fare for a regular taxi from the boarding point to the disembarking point.

[0109] The "30% OFF" on the right side of the option column 65 means that by using a rideshare, the fare will be 30% cheaper than the estimated taxi fare. The control unit 31 uses the "Great Deal" mark on the right side to inform the user that a fare cheaper than the taxi fare is being offered.

[0110] The "3 seats remaining" below the "Great Deal" mark indicates the number of remaining seats on the shared car route 42. When the user selects the application button 691, "Confirmed" is recorded in the status field of the car allocation request DB 51, and the reservation is confirmed.

[0111] The control unit 21 may display values ​​used to calculate the ride-sharing fare, such as the basic discount rate D, the additional discount rate A, the ride-sharing discount rate S, the total discount rate C, or the ride-sharing discount amount, in the candidate field 65. This makes it possible to provide the vehicle dispatch system 10 that allows each user to understand what discount is being applied to them.

[0112] Fig. 7 is an example of a screen of the first information processing device 20. In Fig. 7, a daily vehicle dispatch plan 43 for five vehicles 15 is displayed in a schematic manner. The vertical direction indicates time. The leftmost column in Fig. 7 indicates a state in which no vehicle operation is scheduled.

[0113] Let's take the rightmost column as an example. "Yamaguchi Taro" at the top indicates the name of the driver in charge. This vehicle 15 is scheduled to operate three shared-ride routes 42, departing at 4:00, 10:00, and 17:00. The destinations of each shared-ride route 42 and the number of passengers scheduled to ride are displayed.

[0114] Although not shown in the figure, when the operator of the vehicle dispatch system 10 clicks on the rectangle representing the ride-sharing route 42, the control unit 21 displays a map of the route and detailed information such as contact information for the passengers. The operator can rearrange the vehicle dispatch plan 43 and change the driver in charge as necessary. An experienced operator can appropriately modify the ride-sharing route 42 and vehicle dispatch plan 43 automatically generated by the control unit 21 based on their experience.

[0115] According to this embodiment, it is possible to provide a vehicle dispatch system 10 that determines the fare for each user by reflecting the vehicle operating costs required to operate the vehicle 15. According to this embodiment, it is possible to provide a vehicle dispatch system 10 that reflects non-monetary costs, such as detour time or detour distance, that each user incurs by using the carpooling route 42 in the fare for each user. According to this embodiment, it is possible to provide a vehicle dispatch system 10 that reflects the supply and demand situation of the carpooling route 42 in the fare for each user.

[0116] Since the user is notified of boarding times and disembarking times with a range, it is possible to provide a vehicle dispatch system 10 that can accept additional vehicle dispatch requests 41 and change the shared ride route 42.

[0117] For example, the control unit 21 sets the detour time or detour distance of each user to a default allowable range of up to 50% longer than when traveling directly from the boarding point to the disembarking point. That is, the control unit 21 generates a carpooling route 42 within a range of 1.5 times the time or 1.5 times the travel distance when traveling directly.

[0118] The control unit 21 may accept a user's specification of an upper limit for the detour time or detour distance. If the user sets the detour time or detour distance to, for example, up to 20% longer, the control unit 21 creates a carpooling route within a range of 1.2 times the time or 1.2 times the travel distance of a direct route. In this way, for a user who sets stricter conditions than the default, the carpooling route 42 is more likely to not be established, but if it is established, the carpooling route 42 can be used with a shorter detour time or detour distance.

[0119] For example, if a carpooling route 42 cannot be generated within the range of the 20% additional detour time or distance specified by the user, but a carpooling route 42 can be generated if a 40% additional detour time or distance is allowed, the control unit 21 will display, instead of "Great Deal" on the screen described using Figure 6, a message such as "This will take 1.4 times longer than traveling by taxi. Is that okay?", and if the user agrees, the carpooling route 42 will be established.

[0120] If the user sets the detour time or detour distance to, for example, 100%, the control unit 21 creates a carpooling route that is twice the time or twice the distance of a direct route. In this way, for users who set conditions that are more lenient than the default, the carpooling route 42 is more likely to be established.

[0121] The control unit 21 may determine the basic discount rate D or the basic discount amount G based on the detour time or detour distance value set by the user. The control unit 21 may also accept a designation of an upper limit value for the detour time or detour distance each time the user uses the vehicle dispatch system 10.

[0122] Instead of the user inputting the vehicle allocation request 41 in step S611 described with reference to FIG. 5, an operator may accept the vehicle allocation request 41 by telephone or the like and register it in the vehicle allocation request DB 51.

[0123] 5, the operator or the driver in charge of driving the second shared-ride route may approve the second shared-ride route generated in step S522 and the shared-ride fare calculated in step S523. The control unit 21 may omit the processing of steps S504 to S505 and record the second shared-ride route generated in step S522 in the dispatch request DB 51.

[0124] The control unit 21 may acquire a generation prediction of a vehicle dispatch request 41, and if the generation prediction is greater than a predetermined threshold, generate a provisional vehicle dispatch request, which is a dummy vehicle dispatch request 41. The generation prediction is a prediction based on, for example, statistical data, the operator's experience, or event information, and is input by, for example, the operator to the control unit 21. The control unit 21 may generate the generation prediction based on predetermined conditions.

[0125] 4, the control unit 21 combines the actual vehicle allocation request 41 and the tentative vehicle allocation request received from the user to generate a tentative vehicle allocation plan 43. Thereafter, in step S522 described using FIG. 5, the control unit 21 deletes the tentative vehicle allocation request in accordance with the additionally received vehicle allocation request 41, and generates a second ride-sharing route.

[0126] If the actual vehicle dispatch request 41 received from the user is less than the provisional vehicle dispatch request, the fare corresponding to the provisional vehicle dispatch request will be insufficient. However, it is desirable that the shortfall amount is not passed on to the user, but is borne by the operator that generated the carpool route 42. It is possible to provide a vehicle dispatch system 10 that guarantees the user that they can ride for the proposed fare, regardless of whether a vehicle dispatch request 41 corresponding to the provisional vehicle dispatch request is generated.

[0127] When there are more vehicle allocation requests 41 than provisional vehicle allocation requests, the control unit 21 may recalculate the fee to be charged to the user based on the actual vehicle allocation requests 41, or may charge the user the fee calculated based on the provisional vehicle allocation requests. In the latter case, the profitability of the operator of the vehicle allocation system 10 can be increased.

[0128] As described above, it is possible to provide a vehicle dispatch system 10 that generates a tentative vehicle dispatch plan 43 based on a prediction of the occurrence of vehicle dispatch requests 41 and appropriately modifies the vehicle dispatch plan 43 in accordance with user requests. By generating a tentative vehicle dispatch plan 43 before a sufficient number of vehicle dispatch requests 41 are received, it is possible to provide a vehicle dispatch system 10 that promptly presents a carpooling route 42 to a user who has submitted a vehicle dispatch request 41.

[0129] Instead of generating the tentative vehicle allocation plan 43, the control unit 21 may calculate a discounted ride-sharing fare by applying a predetermined discount to the ride-sharing fare calculated based on the actual vehicle allocation request 41, and present the calculated discounted ride-sharing fare to the user. The control unit 21 may also present to the user an added ride-sharing discount amount or added ride-sharing discount rate by applying a predetermined amount to the ride-sharing discount amount or ride-sharing discount rate.

[0130] If the ride-sharing fee is calculated simply based on only existing dispatch requests 41, the ride-sharing fee calculated at an early stage will be high. For a ride-sharing route 42 where additional dispatch requests 41 are expected, by presenting a discounted ride-sharing fee, it becomes easier for users to make a formal application. By determining the operation of the ride-sharing route 42 at an early stage, the vehicle 15 and the driver It will also be easier to secure supplies.

[0131] If the expected number of dispatch requests 41 is not added, the ride-sharing fare calculated based on the actual dispatch requests 41 will be higher than the discounted ride-sharing fare already presented to the user. However, even in such a case, the control unit 21 charges the user the discounted ride-sharing fare already presented. This makes it possible to provide a dispatch system 10 that gives users who make reservations early the peace of mind that the fare once presented will not be increased.

[0132] If more dispatch requests 41 than expected are added, the ride-sharing fare calculated based on the actual dispatch requests 41 will be lower than the discounted ride-sharing fare already presented to the user. However, even in such a case, the control unit 21 charges the user the discounted ride-sharing fare already presented to the user. By collecting a high fare within the range agreed to by the user, it is possible to provide a dispatch system 10 that stabilizes the business of the operator of the dispatch system 10.

[0133] If more vehicle dispatch requests 41 than expected are added, the user may be charged a further discount on the already-discounted ride-sharing fare. This provides a vehicle dispatch system 10 that gives users who make reservations early hope that an even cheaper fare may be offered.

[0134] The control unit 21 does not have to present the discounted ride-sharing fare to the user. In this case, for example, a predetermined flat rate for users who apply early can be displayed in a pamphlet distributed to users in advance or on a World Wide Web (WEB) site. By allowing users to know the flat rate in advance, it is possible to provide a vehicle dispatch system 10 that reduces the possibility of cancellation after application.

[0135] 5, if the vehicle dispatch request 41 received in step S511 can be accommodated during a time slot that is available in the vehicle dispatch plan 43, the control unit 21 may generate (step S522) a second carpooling route configured by the vehicle dispatch request 41. For example, if the vehicle dispatch request 41 received in step S511 is substantially the same as a route from the end point of one carpooling route 42 to the starting point of the next carpooling route 42, the vehicle 15 can run with the user instead of being dispatched.

[0136] In this way, the control unit 21 may set a discounted fare that is cheaper than usual for the generated ride-sharing route 42 instead of forwarding the vehicle. This is because the route needs to be traveled regardless of whether a user is present, and offering a discounted fare does not adversely affect profitability.

[0137] [Variation 1] This modification relates to a vehicle dispatch system 10 that requests existing users to accept a second carpooling route when a new carpooling request 41 is added to an existing carpooling route 42. Explanation of parts common to the first embodiment will be omitted.

[0138] Fig. 8 is an example of a screen of the second information processing device 30 in Modification 1. In step S504 described using Fig. 5, the first information processing device 20 also transmits information to the second information processing device 30 used by an existing user. Fig. 8 is an example of a screen that the control unit 31 displays on the touch panel 35 based on the transmitted information.

[0139] A map field 61 is displayed in the upper half of the screen. Below the map field 61, a summary field 67, an added person field 66, an approve button 692, and a disapprove button 693 are displayed. The summary field 67 displays a summary of the reserved carpool route 42. The added person field 66 displays information about the ride request 41 that has been added to the carpool route 42. The user can add additional passengers to the carpool route 42. You can check the photo and nickname of the user, as well as the fare, etc.

[0140] The user checks the added user column 66 and selects an approval button 692 indicating that the user is approved to be added, or a disapproval button 693 indicating that the user is not approved. For example, when all existing users select the approval button 692, the control unit 21 determines that the ride-sharing route 42 including the added user has been finalized, and records this in the vehicle allocation request DB 51.

[0141] For example, when a predetermined percentage or a predetermined number of existing users select the approval button 692, the control unit 21 may determine that the ride-sharing route 42 including the additional user has been confirmed, and record this in the vehicle allocation request DB 51. The control unit 21 may not display the approval button 692 or the disapproval button 693, but may simply notify the existing users that a user using the ride-sharing route 42 has been added.

[0142] [Variation 2] This modification relates to a vehicle dispatch system 10 that notifies existing users that their fares will be reduced when a user is added to a reserved shared route 42. Explanations of parts common to the first embodiment will be omitted.

[0143] Fig. 9 is an example of a screen of the second information processing device 30 in Modification Example 2. When a user is added to an existing carpooling route 42, the first information processing device 20 transmits information about the changed carpooling route 42 to the second information processing device 30 used by the existing user. Fig. 9 is an example of a screen that the control unit 31 displays on the touch panel 35 based on the transmitted information.

[0144] At the top of the screen, a notification field 678 is displayed showing the message "The fare has been reduced because the number of passengers has been increased." Below the notification field 678, a map field 61, a summary field 67, and a fare field 671 are displayed. In the map field 61, an intermediate boarding location mark 623 indicating the boarding location of the added person "ko," and an intermediate drop-off location mark 624 indicating the drop-off location of "ko" are displayed.

[0145] The summary section 67 displays the address of the location where the user boards, the addresses of the locations where other users stop to board or disembark, and the address of the location where the user disembarks. The word "New" is displayed to the right of the added location. The address of the added location may be displayed prominently in any format, such as bold, italic, underlined, or flashing.

[0146] The summary section 67 displays that the fare has been reduced from 6,400 yen to 5,200 yen. The screen shown in Figure 9 allows the user to realize the benefit of the vehicle dispatch system 10, in which the fare is reduced as the number of users using the same vehicle 15 increases.

[0147] [Variation 3] This modification relates to a vehicle dispatch system 10 that presents a user with a plurality of available ride-sharing routes 42. Explanation of parts common to the first embodiment will be omitted.

[0148] 10 is an example of a screen of the second information processing device 30 in Modification 3. In steps S521 and S522 described using FIG. 5, the vehicle dispatch system 10 adds a vehicle dispatch request 41 to each of the plurality of first carpooling routes to generate a plurality of second carpooling routes. In step S504, the control unit 21 transmits the generated plurality of second carpooling routes to the second information processing device 30.

[0149] FIG. 10 shows the control unit 31 that has received a plurality of second shared routes and displays them on the touch panel 35. 10 shows an example of a screen in which a map field 61 is displayed at the top of the screen. A taxi share button 643, a shuttle button 641, and a public transport button 644 are displayed below the map field 61. FIG. 10 shows a state in which the shuttle button 641 is selected. Three candidate fields 65 are displayed below the shuttle button 641. An apply button 691 is displayed at the bottom of the screen.

[0150] The three candidate fields 65 correspond to three second shared routes generated in response to the user-specified ride-hailing request 41. However, the fares differ depending on conditions such as the number of users planning to ride.

[0151] The user compares the displayed candidate fields 65, selects the desired candidate field 65, and then selects the application button 691. When the user selects the application button 691, the control unit 21 records information about the selected ride-sharing route 42 and "confirmed" in the status field of the vehicle allocation request DB 51. This confirms the reservation for the user's vehicle allocation request 41.

[0152] The control unit 21 can guide users to a specific carpooling route 42 by adjusting the various parameters described using equations (1) to (6) so that the fare will be lower when using the carpooling route 42 that is desired to increase the number of passengers. The operator may instruct the adjustment of the parameters.

[0153] [Embodiment 2] This embodiment relates to a vehicle dispatch system 10 that allows a user to set conditions to increase the possibility of establishing a shared ride route 42. Explanation of parts common to the first embodiment will be omitted.

[0154] In the first embodiment, there are cases where it is not possible to generate an appropriate carpooling route 42 that includes the user's desired dispatch request 41. For example, if the carpooling fare U calculated based on equations (1) to (6) is higher than the basic fare B, which is the fare for using a taxi alone, it is generally considered that there is no advantage to using the carpooling route 42.

[0155] 11 and 12 are examples of screens displayed on the second information processing device 30 according to the second embodiment. FIG. 11 shows an example of a screen displayed on the touch panel 35 by the control unit 31 when a suitable carpooling route 42 is not established. In the center of the screen, a message saying "Unfortunately, no match... Sorry" is displayed. This message is displayed to notify the user that the control unit 21 has determined that the vehicle dispatch request 41 input by the user cannot be permitted.

[0156] At the bottom of the screen, a message stating "Increasing the amount to be paid will increase the chances of a match" is displayed, along with a re-propose button 694. When the user selects the re-propose button 694, the control unit 31 displays the screen of Fig. 12 on the touch panel 35. The screen shown in Fig. 12 displays a fare setting field 676 for inputting a fare that the user is willing to pay, a time setting field 677 for inputting a time that the user is willing to pay, and a confirm button 695.

[0157] The user inputs acceptable conditions in the fare setting field 676 and the time setting field 677, and selects the confirm button 695. For example, if it is predicted that it will be difficult to take a taxi due to a large-scale event, the user may be willing to accept a higher fare than if they were to take a taxi alone.

[0158] When the user selects the confirm button 695, the control unit 31 transmits the conditions input by the user to the first information processing device 20. When the control unit 21 has generated a shared ride route 42 that satisfies the conditions specified by the user, the control unit 21 notifies the user of the shared ride route 42 via, for example, the screen described with reference to FIG. Notify me of ride route 42.

[0159] According to this embodiment, it is possible to provide a vehicle dispatch system 10 that presents a carpooling route 42 that meets the user's desired conditions.

[0160] If one of two ride-sharing requests 41 is incorporated into the carpooling route 42 but the other cannot be incorporated into the carpooling route 42, the control unit 21 may generate a carpooling route 42 that prioritizes the ride-sharing request 41 of a user who has set a high fare in the fare setting field 676 and agreed to pay the additional fee.

[0161] Note that the control unit 21 presents the carpooling route 42 to the user only when, for example, the difference between the carpooling fee U and the basic fee B is greater than a predetermined reference discount amount. The control unit 21 may present the carpooling route 42 to the user only when the discount amount of the carpooling fee U relative to the basic fee B is greater than a predetermined reference discount rate. The control unit 21 may present the carpooling route 42 to the user only when the increase in the required time when using the carpooling route 42 is less than or equal to a predetermined amount.

[0162] If the benefit to the user is small, the control unit 21 does not suggest the ride-sharing route 42, thereby increasing the user's trust in the vehicle dispatch system 10. The control unit 21 may accept from each user a specification of a base discount amount, a base discount rate, or an upper limit of the increase in required time. The user can set conditions for receiving the ride-sharing route 42 according to their own needs.

[0163] [Embodiment 3] This embodiment relates to a vehicle dispatch system 10 that proposes changes to boarding locations, etc. Explanation of parts common to the first embodiment will be omitted.

[0164] For example, if the boarding point or disembarking point specified in the dispatch request 41 is changed to the opposite side of the road, etc., it may be possible to generate a carpooling route 42 that satisfies the requests of many users. Similarly, if the boarding time or disembarking time specified in the dispatch request 41 is changed, it may be possible to generate a carpooling route 42 that satisfies the requests of many users. In this embodiment, the control unit 21 suggests to the user to change the conditions specified in the dispatch request 41.

[0165] An example will be described in which a user sets the arrival time to 10:00 in the dispatch request 41. If changing the arrival time of the user to 10:30 can generate a carpooling route 42 that satisfies the dispatch requests 41 of many other users, the control unit 21 outputs a message such as "Are you sure you want to change the arrival time from 10:00 to 10:30?" If the user approves the change, the control unit 21 decides to adopt the carpooling route 42 with the changed arrival time of the user.

[0166] For a user who approves the change in conditions, the control unit 21 may increase the basic discount rate or the basic discount amount. The control unit 21 may output a message to the user such as, "If you change the arrival time from 10:00 to 10:30, we will give you a 1,000 yen discount on the fare." Providing an incentive such as a fare discount can increase the possibility of obtaining cooperation from the user.

[0167] According to this embodiment, it is possible to provide a vehicle dispatch system 10 that makes it easier to establish an appropriate carpool route 42 by requesting cooperation from users.

[0168] [Embodiment 4] This embodiment relates to a vehicle dispatch system 10 that queries a user who is currently riding on a vehicle about whether or not the conditions can be changed to conditions different from those when the user submitted the vehicle dispatch request 41. Explanation of parts common to the first embodiment will be omitted.

[0169] 13 is an example of a screen in the fourth embodiment. A specific example will be given. Two users are sharing a vehicle 15 scheduled to arrive at Narita Airport at 16:30. In the following description, the two users will be referred to as user A and user B. Both user A and user B are scheduled to board a domestic flight departing at 17:30.

[0170] While vehicle 15 is traveling, user C issues a new vehicle dispatch request 41. The control unit 21 cannot generate a ride-sharing route 42 that satisfies the conditions of each user. However, if user C rides in vehicle 15 with users A and B, they are expected to arrive at Narita Airport at 5 p.m.

[0171] For example, if user C agrees to pay an additional fee of 5,000 yen for each existing user, totaling 10,000 yen, the control unit 21 displays the screen shown in FIG. 13 on the second information processing device 30 of the user currently riding.

[0172] 13, the user learns that if the estimated arrival time is allowed to be delayed by 30 minutes, the fare will be significantly reduced. The user decides whether to accept User C's ride-sharing, taking into consideration the time required for check-in, etc. The user operates the approve button 692 or the disapprove button 693 to notify the control unit 21 of the result of the decision.

[0173] If both user A and user B are approved, the control unit 21 changes the carpooling route 42 to allow user C to ride along.

[0174] According to this embodiment, it is possible to provide a vehicle allocation system 10 that accepts a user's decision as to whether or not to accept conditions different from the initial vehicle allocation request 41.

[0175] [Embodiment 5] This embodiment relates to a vehicle dispatch system 10 that displays the commission of the operating company that operates the vehicle dispatch system 10 and the vehicle operating costs separately.

[0176] The Travel Agency Act defines two types of tours: "packaged tours" and "arranged tours." Travel agents are not required to display a breakdown of the fees to travelers for packaged tours, but are required to display a breakdown of the fees, such as actual expenses and fees, for arranged tours. For example, in the example screen shown in Figure 6, the breakdown of the fees is not displayed, but if the breakdown of the fees is not displayed at all after that, the provision of the shared route 42 can be interpreted as equivalent to the provision of a packaged tour under the Travel Agency Act.

[0177] In contrast, the vehicle dispatch system 10 of this embodiment provides users with information equivalent to arranged tours under the Travel Agency Act. It should be noted that displaying details of packaged tours is not prohibited. Therefore, this embodiment can be used in both cases where the provision of the ride-sharing route 42 is an arranged tour and where it is a packaged tour.

[0178] 14 is an explanatory diagram schematically illustrating a carpooling route 42 according to the fifth embodiment and an example screen of a second information processing device. In the carpooling route 42 according to the present embodiment, the vehicle 15 travels from point P7 to point P10 via points P8 and P9. User E gets on at point P7 and gets off at point P10. User F gets on at point P8 and gets off at point P9.

[0179] Vehicle 15 is a taxi, and the fare from point P7 to point P10 is 1,000 yen. This 1,000 yen corresponds to the cost required to operate ride-sharing route 42. As mentioned above, the cost may include credit card fees, actual costs such as communication fees, insurance fees, etc.

[0180] If the ratio of the travel distances of user E and user F is 3:2, the fare for user E can be calculated as 600 yen and the fare for user F as 400 yen, which are allocated in proportion to the travel distances. User E's 600 yen and user R's 400 yen are examples of allocated expenses that are allocated between users as expenses required to operate carpool route 42.

[0181] The operator of the vehicle dispatch system 10 charges each user an operation fee of 100 yen in addition to the fare. The control unit 21 displays to the second information processing device 30 of user E, as shown in the upper part of FIG. 14, that "the fare is 600 yen, the fee is 100 yen, and the total is 700 yen." Similarly, the control unit 21 displays to the second information processing device 30 of user F, as shown in the lower part of FIG. 14, that "the fare is 400 yen, the fee is 100 yen, and the total is 500 yen."

[0182] For example, as illustrated in FIG. 6, the control unit 21 may display the fare and the number of remaining seats when riding in a taxi alone.

[0183] [Variation 4] The following describes a case where the above user F does not actually exist, but is a temporary vehicle dispatch request generated by the control unit 21. If no vehicle dispatch request 41 that can be added to the carpooling route 42 occurs until the vehicle 15 finishes traveling, the actual fare for user F is 1,000 yen. However, it is not desirable to charge a fee of 1,000 yen to a user who is presented with a fee of 700 yen and decides to use the carpooling route 42.

[0184] The vehicle dispatch system 10 guarantees operation at the initially proposed fare of 700 yen to user E, and adjusts the difference with a handling fee. That is, the vehicle dispatch system 10 notifies the user via the second information processing device 30 of the fare of "1,000 yen for the fare, -300 yen for the handling fee, totaling 700 yen." As a result, a vehicle dispatch system 10 that users can use with peace of mind can be provided.

[0185] The display of "Handling Fee -300 yen" does not matter as long as it indicates a 300 yen discount from the 1,000 yen shipping fee. For example, it may be displayed as "Discount 300 yen" or "Promotional Fee 300 yen." Here, we have explained the case where the business operator pays the entire 300 yen, but it is also possible for the business operator to pay only a portion of it.

[0186] [Variation 5] This description will discuss a vehicle dispatch system 10 that does not change the fees charged to existing users when a vehicle dispatch request 41 occurs that can be added to a shared route 42 after the fees have been presented to user E and user F without affecting the taxi fare and the travel time required by each user.

[0187] The control unit 21 recalculates the operating expenses of each user, including the new vehicle dispatch request 41. Here, an example will be described in which the operating expenses of user E have changed to 400 yen. The control unit 21 notifies the user via the second information processing device 30 that the fare is 400 yen, the handling fee is 300 yen, and the total is 700 yen.

[0188] In addition, if user E is affected by an increase in the required travel time or the like due to the incorporation of the new vehicle dispatch request 41 into the shared route 42, it is desirable for the control unit 21 to lower user E's fare.

[0189] As described above, even if there is a change in the users using the shared route 42, by adjusting the fee, it is possible to provide a vehicle dispatch system 10 that does not change the fee charged to the user from the fee initially presented.

[0190] [Variation 6] This description explains a vehicle dispatch system 10 that reduces the fee charged to existing users when a vehicle dispatch request 41 occurs that can be added to a shared route 42 after the fee has been presented to user E and user F without affecting the taxi fare and the travel time required by each user.

[0191] A specific example will be described below in which a ride-sharing fare of 700 yen is offered to user E, and then user G, who boards at point P7 and gets off at point P9, is added, as shown in Figure 14. The operating expenses of vehicle 15 remain unchanged at 1,000 yen.

[0192] The control unit 21 recalculates the fare for each user based on the riding distance of each user. A case will be described where the fare for user E changes from 600 yen to 400 yen. If the ride-sharing fee for user E remains at 700 yen, the commission for the operator of the vehicle dispatch system 10 changes from 100 yen to 300 yen.

[0193] However, in this modified example, the amount equivalent to the increased fee is allocated between User E and the operating company. In the above example, the amount equivalent to the increased fee is 200 yen. This is divided, for example, in half between User E and the operating company. The fee collected by the operating company will be 200 yen, and User E's ride-sharing fee will be 600 yen, which is the fare of 400 yen plus the fee of 200 yen.

[0194] The above method of allocating the amount equivalent to the fee increase is an example. The allocation ratio is not limited to 50 / 50. The operating company's fee increase may be a fixed amount, with the remainder distributed to users. The user's fee increase may be a fixed amount, with the remainder distributed to the operating company.

[0195] The amount equivalent to the increase in the fee is also the reduction in the operating expenses borne by the users. In other words, with the addition of user G, the operating expenses borne by user E will decrease by 200 yen. This modification can be interpreted as the reduction in the operating expenses borne by user E being shared between user E and the operating company.

[0196] According to this modification, a vehicle dispatch system 10 can be provided that allows existing users to enjoy the benefit of reduced ride-sharing fees when the number of passengers riding together on the ride-sharing route 42 increases.

[0197] [Variation 7] FIG. 15 is an explanatory diagram that schematically shows a carpooling route 42 of Modification 7. In the carpooling route 42 of this modification, similar to FIG. 14, the vehicle 15 travels from point P7 to point P10 via points P8 and P9. Points P7 and P8 are off the route that travels directly from point P7 to point P10. User E boards the vehicle at point P7 and gets off at point P10. User F boards the vehicle at point P8 and gets off at point P9.

[0198] We will explain this using an example where the distance when vehicle 15 travels directly from point P7 to point P10 is 2 kilometers, the distance when travelling directly from point P8 to point P9 is 1 kilometer, and the distance when travelling from point P7 to point P8 and point P9 to point P10 is 3 kilometers, and the operating costs of vehicle 15 are 1,200 yen.

[0199] The riding distance of user E is 3 kilometers. The riding distance of user F is 1 kilometer. Therefore, if the operating costs are allocated in proportion to the distance traveled by each user as described above, the fares borne by users E and F are calculated as follows:

[0200] User E: 1200 x 3 / (3 + 1) = 900 yen User F: 1200 x 1 / (3 + 1) = 300 yen

[0201] According to the above allocation, user E will end up paying a higher fare than user F, even though he or she is taking a longer route to share the ride. With such allocation, user E may decide that it is more profitable to take a taxi alone than to use the shared route 42. As a result, if the shared route 42 does not work out, user F will also be unable to use the shared route 42.

[0202] In this modification, the fare is calculated based on the distance traveled by each user when traveling directly from the boarding point to the disembarking point. Since the travel distance of user E is 2 km and the travel distance of user F is 1 km, the fares borne by user E and user F are calculated as follows:

[0203] User E: 1200 x 2 / 3 = 800 yen User F: 1200 x 1 / 3 = 400 yen

[0204] According to this modification, a vehicle dispatch system 10 can be provided that increases the likelihood of a shared ride route 42 being established by presenting cost sharing that is easy for each user to accept.

[0205] The control unit 21 may distribute the operating expenses of the ride-sharing route 42 in proportion to the fare that each user would pay if they were riding in a taxi alone. Also, in FIG. 15 , for example, if the distance from point P9 to point P10 is long, user F may not be able to appropriately receive the benefit of a reduction in the fare that he or she would otherwise pay. In this case, user E and user F may be matched, or the fare calculation method according to this modified example may be applied, only when a predetermined condition is met, such as the fare burden being lower if user F rides with user E than if user F rides alone.

[0206] [Embodiment 6] 16 is an explanatory diagram illustrating the configuration of a vehicle dispatch system 10 according to a sixth embodiment. The vehicle dispatch system 10 according to the present embodiment includes a computer 90. The computer 90 includes a control unit 21, a main memory device 22, an auxiliary memory device 23, a communication unit 24, an input unit 251, an output unit 252, a reading unit 29, and a bus. The computer 90 is an information device such as a general-purpose personal computer, a tablet, a smartphone, or a server computer.

[0207] The program 97 is recorded on a portable recording medium 96. The control unit 21 reads the program 97 via the reading unit 29 and stores it in the auxiliary storage device 23. The control unit 21 may also read the program 97 stored in a semiconductor memory 98, such as a flash memory, implemented in the computer 90. Furthermore, the control unit 21 may download the program 97 from another server computer (not shown) connected via the communication unit 24 and a network (not shown) and store it in the auxiliary storage device 23.

[0208] The program 97 is installed as a control program for the computer 90, and is loaded into the main storage device 22 and executed. The portion of the program 97 that is executed by the second information processing device 30 is transmitted to each second information processing device 30 via the network and installed as a control program for the second information processing device 30. As described above, the computer 90 performs the functions of the first information processing device 20 that constitutes the vehicle dispatch system 10 described above. Program 97 is an example of a program product.

[0209] [Embodiment 7] 17 is a functional block diagram of an information processing device 20 according to embodiment 7. The information processing device 20 includes a reception unit 81, a route generation unit 82, a fee acquisition unit 83, a detour acquisition unit 84, and a calculation unit 85.

[0210] The reception unit 81 receives a plurality of dispatch requests, each of which specifies a boarding point and a drop-off point, corresponding to a plurality of users. The route generation unit generates a shared route for picking up and dropping off each user at each boarding point and a drop-off point based on the plurality of dispatch requests.

[0211] The fare acquisition unit 83 acquires a first fare for when a ride-sharing route is used for transportation, and a second fare for when each user is individually transported along an individual route connecting the boarding point and disembarking point designated by each user. The detour acquisition unit 84 acquires the detour time or detour distance for each user based on the ride-sharing route and the individual route. The calculation unit 85 calculates a ride-sharing discount rate or a ride-sharing discount amount for each user based on the first fare, each user's second fare, and the detour time or detour distance.

[0212] The technical features (constituent elements) described in each embodiment can be combined with each other, and by combining them, new technical features can be formed. The embodiments disclosed herein are to be considered as illustrative in all respects and not restrictive. The scope of the present invention is defined by the claims, not by the above meaning, and is intended to include all modifications within the meaning and scope of the claims. [Explanation of symbols]

[0213] 10. Vehicle dispatch system 15 vehicles 20 First information processing device (information processing device) 21 Control section 22 Main storage 23 Auxiliary storage device 24 Communications Department 251 Input section 252 Output section 29 Reading unit 30 Second information processing device 31 Control Unit 32 Main storage 33 Auxiliary storage device 34 Communications Department 35 Touch Panel 351 Input section 352 Output section 41 Ride Request 42 Carpooling Routes 43 Vehicle Allocation Planning 51 Vehicle dispatch request DB 61 Map section 621 Boarding location mark 622 Drop-off point mark 623 Intermediate boarding point mark 624 Stopover mark 628 Route Mark 641 Shuttle Button 642 Taxi Button 643 Taxi Share Button 644 Public Transport Button 65 Candidate column 66 Adder column 67 Summary column 671 Fee column 676 Fare setting column 677 Time setting field 678 Notification column 691 Application button 692 Approval button 693 Reject button 694 Re-propose button 695 Confirm button 81 Reception 82 Route generation section 83 Fee Acquisition Department 84 Detour acquisition part 85 Calculation Unit 90 Computer 96 Portable recording media 97 Programs 98 Semiconductor Memory

Claims

1. Accepting multiple vehicle dispatch requests specifying pick-up and drop-off locations for multiple users, respectively; Based on the plurality of vehicle dispatch requests, a shared ride route is generated that picks up and drops off each user at each boarding point and alighting point; acquire a first fare for the case of picking up or dropping off along the shared route, and a second fare which is a ride distance or a fare for an individual route which is a route when picking up or dropping off each user individually along a route connecting a boarding point and a drop-off point designated by each user, calculating a payment amount of the first fare for each user by dividing the first fare proportionately based on the travel distance of the individual route or the fare for the individual route; The ride-sharing fee paid by each user using the ride-sharing route is determined by adjusting the amount of the payment based on a ride-sharing discount rate or a ride-sharing discount amount determined for each user and a predetermined basic discount rate or a basic discount amount. An information processing method in which processing is performed by a computer.

2. Outputting information about the carpooling route to a user whose profit calculated based on the carpooling fee paid by each user using the carpooling route and the expenses required for operating the carpooling route is greater than a predetermined threshold. The information processing method according to claim 1 .

3. The ride-sharing fee paid by each user using the ride-sharing route is divided into an allocated expense obtained by allocating the expense required for operating the ride-sharing route among the users, and a handling fee, and is presented to each user.

3. The information processing method according to claim 1.

4. Accepting multiple vehicle dispatch requests specifying pick-up and drop-off locations for multiple users, respectively; Based on the plurality of vehicle dispatch requests, a shared ride route is generated that picks up and drops off each user at each boarding point and alighting point; acquire a first fare for the case of picking up or dropping off along the shared route, and a second fare which is a ride distance or a fare for an individual route which is a route when picking up or dropping off each user individually along a route connecting a boarding point and a drop-off point designated by each user, calculating a payment amount of the first fare for each user by dividing the first fare proportionately based on the travel distance of the individual route or the fare for the individual route; Outputting information about the carpooling route to a user whose profit calculated based on the carpooling fee paid by each user using the carpooling route and the expenses required for operating the carpooling route is greater than a predetermined threshold. An information processing method in which processing is performed by a computer.

5. The ride-sharing fee paid by each user using the ride-sharing route is divided into an allocated expense obtained by allocating the expense required for operating the ride-sharing route among the users, and a handling fee, and is presented to each user. The information processing method according to claim 4.

6. Accepting multiple vehicle dispatch requests specifying pick-up and drop-off locations for multiple users, respectively; Based on the plurality of vehicle dispatch requests, a shared ride route is generated that picks up and drops off each user at each boarding point and alighting point; acquire a first fare for the case of picking up or dropping off along the shared route, and a second fare which is a ride distance or a fare for an individual route which is a route when picking up or dropping off each user individually along a route connecting a boarding point and a drop-off point designated by each user, calculating a payment amount of the first fare for each user by dividing the first fare proportionately based on the travel distance of the individual route or the fare for the individual route; The ride-sharing fee paid by each user using the ride-sharing route is divided into an allocated expense obtained by allocating the expense required for operating the ride-sharing route among the users, and a handling fee, and is presented to each user. An information processing method in which processing is performed by a computer.

7. A user who agrees to pay an additional fee to be added to the shared ride fee is given priority over other users in outputting information about the shared ride route.

7. The information processing method according to claim 1.

8. outputting information about the shared ride route to a user who agrees to pay a fare higher than the second fare, even if the shared ride fare paid by the user exceeds the second fare; For other users, if the ride-sharing fare paid by each user exceeds the second ride fare, information about the ride-sharing route is not output. The information processing method according to claim 7.

9. Obtaining the predicted occurrence of vehicle dispatch requests; If the occurrence prediction exceeds a predetermined threshold, the shared ride route is generated based on the received plurality of vehicle dispatch requests and a provisional vehicle dispatch request generated based on the occurrence prediction.

9. The information processing method according to claim 1.

10. If the number of vehicle dispatch requests generated after the shared ride route is generated is smaller than the temporary vehicle dispatch requests, the business operator that generated the shared ride route will bear the shortfall in costs. The information processing method according to claim 9.

11. If there is a cost shortfall, the business operator will notify each user that it will cover all or part of the shortfall. The information processing method according to claim 10.

12. Recording a ride-sharing discount rate or a ride-sharing discount amount calculated based on the ride-sharing route for each user who has already accepted the ride-sharing request before generating the ride-sharing route; Even if the number of vehicle allocation requests generated after the generation of the carpooling route is less than the number of provisional vehicle allocation requests, the recorded carpooling discount rate or the carpooling discount amount is presented.

12. The information processing method according to claim 9.

13. Even if the number of vehicle allocation requests generated after the generation of the carpooling route is greater than the number of provisional vehicle allocation requests, the recorded carpooling discount rate or the carpooling discount amount is presented. The information processing method according to claim 12.

14. Recording a vehicle dispatch plan in which one vehicle sequentially travels along the plurality of said carpooling routes; When the vehicle dispatch request is newly received, a second carpooling route is generated by incorporating the received vehicle dispatch request into a first carpooling route selected from the carpooling routes; Acquire a travel time or a travel distance between each of the carpooling routes before and after the first carpooling route in the vehicle dispatch plan and the second carpooling route; determining whether to permit the vehicle dispatch request based on the acquired travel time or travel distance; The result of the determination is output to the user corresponding to the vehicle dispatch request.

14. The information processing method according to claim 1.

15. Determine whether to permit the vehicle dispatch request based on the travel time or the travel distance as well as the travelable distance of the vehicle. The information processing method according to claim 14.

16. Determine whether to grant the vehicle dispatch request based on the demand for the carpooling route in addition to the travel time or the travel distance. The information processing method according to claim 14.

17. If the newly accepted vehicle dispatch request corresponds to a time period in which the vehicle is not scheduled to travel on the shared route in the vehicle dispatch plan, a notice of permission at a discounted rate is sent to the user corresponding to the vehicle dispatch request.

17. The information processing method according to claim 14.

18. a reception unit that receives a plurality of vehicle dispatch requests specifying boarding and dropping off points corresponding to a plurality of users; a route generation unit that generates a shared route for picking up and dropping off each user at each boarding point and alighting point based on the plurality of vehicle dispatch requests; an individual acquisition unit that acquires a first fare when the shared route is used for transportation, and a second fare that is a travel distance or a fare for an individual route that is a route connecting a boarding point and a drop-off point designated by each user when the user is individually transported to and from the shared route; a calculation unit that calculates an amount of the first fare to be paid for each user by dividing the first fare proportionally based on the travel distance of the individual route or the fare of the individual route; an adjusting unit that determines the share fee to be paid by each user using the share route by adjusting the share fee based on a share discount rate or a share discount amount determined for each user and a predetermined basic discount rate or a basic discount amount; An information processing device comprising:

19. a reception unit that receives a plurality of vehicle dispatch requests specifying boarding and dropping off points corresponding to a plurality of users; a route generation unit that generates a shared route for picking up and dropping off each user at each boarding point and alighting point based on the plurality of vehicle dispatch requests; an individual acquisition unit that acquires a first fare when the shared route is used for transportation, and a second fare that is a travel distance or a fare for an individual route that is a route connecting a boarding point and a drop-off point designated by each user when the user is individually transported to and from the shared route; a calculation unit that calculates an amount of the first fare to be paid for each user by dividing the first fare proportionally based on the travel distance of the individual route or the fare of the individual route; an output unit that outputs information about the carpooling route to a user whose profit calculated based on a carpooling fee paid by each user using the carpooling route and an expense required for operating the carpooling route is greater than a predetermined threshold; An information processing device comprising:

20. a reception unit that receives a plurality of vehicle dispatch requests specifying boarding and dropping off points corresponding to a plurality of users; a route generation unit that generates a shared route for picking up and dropping off each user at each boarding point and alighting point based on the plurality of vehicle dispatch requests; an individual acquisition unit that acquires a first fare when the shared route is used for transportation, and a second fare that is a travel distance or a fare for an individual route that is a route connecting a boarding point and a drop-off point designated by each user when the user is individually transported to and from the shared route; a calculation unit that calculates an amount of the first fare to be paid for each user by dividing the first fare proportionally based on the travel distance of the individual route or the fare of the individual route; a presentation unit that presents to each user a ride-sharing fee paid by each user using the ride-sharing route, divided into an allocated expense obtained by allocating expenses required for operating the ride-sharing route among the users, and a handling fee; An information processing device comprising:

21. Accepting multiple vehicle dispatch requests specifying pick-up and drop-off locations for multiple users, respectively; Based on the plurality of vehicle dispatch requests, a shared ride route is generated that picks up and drops off each user at each boarding point and alighting point; acquire a first fare for the case of picking up or dropping off along the shared route, and a second fare which is a ride distance or a fare for an individual route which is a route when picking up or dropping off each user individually along a route connecting a boarding point and a drop-off point designated by each user, calculating a payment amount of the first fare for each user by dividing the first fare proportionately based on the travel distance of the individual route or the fare for the individual route; The ride-sharing fee paid by each user using the ride-sharing route is determined by adjusting the amount of the payment based on a ride-sharing discount rate or a ride-sharing discount amount determined for each user and a predetermined basic discount rate or a basic discount amount. A program that causes a computer to perform a process.

22. Accepting multiple vehicle dispatch requests specifying pick-up and drop-off locations for multiple users, respectively; Based on the plurality of vehicle dispatch requests, a shared ride route is generated that picks up and drops off each user at each boarding point and alighting point; acquire a first fare for the case of picking up or dropping off along the shared route, and a second fare which is a ride distance or a fare for an individual route which is a route when picking up or dropping off each user individually along a route connecting a boarding point and a drop-off point designated by each user, calculating a payment amount of the first fare for each user by dividing the first fare proportionately based on the travel distance of the individual route or the fare for the individual route; Outputting information about the carpooling route to a user whose profit calculated based on the carpooling fee paid by each user using the carpooling route and the expenses required for operating the carpooling route is greater than a predetermined threshold. A program that causes a computer to perform a process.

23. Accepting multiple vehicle dispatch requests specifying pick-up and drop-off locations for multiple users, respectively; Based on the plurality of vehicle dispatch requests, a shared ride route is generated that picks up and drops off each user at each boarding point and alighting point; acquire a first fare for the case of picking up or dropping off along the shared route, and a second fare which is a ride distance or a fare for an individual route which is a route when picking up or dropping off each user individually along a route connecting a boarding point and a drop-off point designated by each user, calculating a payment amount of the first fare for each user by dividing the first fare proportionately based on the travel distance of the individual route or the fare for the individual route; The ride-sharing fee paid by each user using the ride-sharing route is divided into an allocated expense obtained by allocating the expense required for operating the ride-sharing route among the users, and a handling fee, and is presented to each user. A program that causes a computer to perform a process.

Images