Information processing method, information processing device and program
Patent Information
- Application Number
- JP2024134675
- Authority / Receiving Office
- JP · JP
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2024-08-09
- Publication Date
- 2024-11-29
- Estimated Expiration
- 2042-01-28
AI Technical Summary
Existing systems fail to reflect the operational cost burden on individual passengers when dynamically generating travel routes, leading to inconsistent fare calculations.
An information processing method that calculates individual ride fees and detour costs for each passenger, applying discount rates based on factors like demand, time, and distance to optimize fares.
Ensures fair and cost-effective fare calculations by reflecting operational costs on passengers, allowing for dynamic route adjustments and increased passenger acceptance.
Smart Images

Figure 00000000_0000_ABST
Abstract
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 required for operation also changes dynamically. However, in Patent Document 1, the cost required for 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 imposed by each person wishing to board a vehicle. [Means for solving the problem]
[0006] The information processing method includes a process in which a computer executes a process to receive a plurality of dispatch requests each specifying a boarding point and a disembarking point corresponding to a plurality of users, generate a carpooling route for picking up and dropping off each user at each boarding point and a disembarking point based on the plurality of dispatch requests, obtain a first fare for picking up and dropping off each user along the carpooling route and a second fare for picking up and dropping off each user individually along an individual route connecting the boarding point and a disembarking point specified by each user, obtain a detour time or detour distance for each user based on the carpooling route and the individual route, and calculate a carpooling discount rate or carpooling discount amount for each user based on the first fare, the second fare for each user, and the detour time or the detour distance. Effect of the Invention
[0007] In one aspect, it is possible to provide an information processing method etc. that reflects the cost required for operation in the burden of each person wishing to board. [Brief description of the drawings]
[0008] [Figure 1] FIG. 1 is an explanatory diagram illustrating an overview of a vehicle dispatch system. [Diagram 2] FIG. 2 is an explanatory diagram illustrating a configuration of a vehicle dispatch system. [Diagram 3] FIG. 2 is an explanatory diagram illustrating a record layout of a vehicle dispatch request DB. [Figure 4] 11 is a flowchart illustrating a process flow of a program. [Diagram 5] 11 is a flowchart illustrating a process flow of a program. [Figure 6] 11 is an example of a screen of a second information processing device. [Figure 7] 13 is an example of a screen of a first information processing device. [Figure 8] 13 is a diagram showing an example of a screen of a second information processing device in the first modified example. [Figure 9] 13 is a diagram illustrating an example of a screen of a second information processing device according to the second modification. [Figure 10] 13 is a diagram illustrating an example of a screen of a second information processing device in the third modified example. [Figure 11] 13 is a diagram illustrating an example of a screen of a second information processing device according to the second embodiment. [Figure 12] 13 is a diagram illustrating an example of a screen of a second information processing device according to the second embodiment. [Figure 13] 13 is a screen example of a second information processing device according to the fourth embodiment. [Figure 14] 13 is an explanatory diagram illustrating a carpooling route according to a fifth embodiment and an example screen of a second information processing device. FIG. [Figure 15] An explanatory diagram showing a schematic diagram of a carpooling route of 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 PREFERRED EMBODIMENTS
[0009] [Embodiment 1] Fig. 1 is an explanatory diagram for explaining 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 person wishing to board. An explanation will be given taking the operation of one vehicle 15 as an example.
[0010] The vehicle 15 to be dispatched by the vehicle dispatch system 10 is, for example, a shared taxi or a 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 a tablet used by the driver. The mobile terminal may also serve as a car navigation device mounted on 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 from time T02 to time T03 and the time from time T04 to time T05 are allocated to the transportation time of the vehicle 15, the driver's rest time, the refueling time of the vehicle 15, the maintenance time of the vehicle 15, etc. 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] The carpooling route 42 will be described using "S02" as an example. The carpooling route 42 is generated based on a vehicle dispatch request 41 of "R1" heading from point P1 to point P2, and a vehicle 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 vehicle dispatch request 41 of "R1" gets on, and at point P3, the user who made the vehicle dispatch request 41 of "R2" gets on. At point P2, the user who made the vehicle dispatch request 41 of "R1" gets off, and at point P3, the user who made the vehicle 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 users, and the like, all of which are received from a large number of users. A method for generating the carpooling route 42 is disclosed in, for example, Patent Document 1, and therefore will not be described here. The carpooling route 42 may be generated by the vehicle dispatch system 10, or may be generated by another system connected to the vehicle dispatch system 10 via a network.
[0015] The carpooling 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 point, the disembarking point, the boarding time, and the disembarking time. The scheduled boarding time and the scheduled disembarking time of each user are notified, for example, with a 15- to 30-minute time window. An example of a method for calculating the cost borne by each user will be described later.
[0016] The explanation will be continued by taking as an example a case where a vehicle dispatch request 41 of "R3" heading from point P5 to point P6 is added during the time period when "S02" is scheduled to travel the carpooling route 42. Note that "R3" may be added before the vehicle 15 starts traveling, or may be added while the vehicle 15 is traveling. "R3" may be added before the planned boarding time and the like for the carpooling route 42 of "S02" are notified to each user.
[0017] A more detailed explanation will be given. The carpooling route 42 may be completed before the vehicle 15 starts traveling along the carpooling route 42. For example, in the carpooling route 42 "departing from within the 23 wards, arriving at Narita Airport at 13:00 on October 31st", all users who will board the route are confirmed by the departure time of the vehicle 15, and no additional users are accepted after that. By not changing the stopovers and route during the ride, it is possible to provide a vehicle dispatch system 10 that does not cause anxiety to users who are concerned about the boarding time of the flight.
[0018] A user who will share a ride may be added even after the vehicle 15 has started traveling. For example, the vehicle-sharing route 42 of "S02" shown in FIG. 1 may accept a vehicle-sharing request 41 of "R2" while the vehicle 15 is traveling with a user "X" who has made a vehicle-sharing request 41 of "R1" on board, and travel along the vehicle-sharing route 42 of "S02" shown in FIG. 1. If a vehicle-sharing request 41 of "R3" is further accepted while the vehicle 15 is traveling, the vehicle-sharing request 41 is updated to "S02b". In this way, the vehicle-sharing system 10 may accept vehicle-sharing requests 41 at any time and update the vehicle-sharing route 42 even while the vehicle 15 is traveling.
[0019] For example, in areas with high population density and many users, such as the 23 wards, it is easy to accept additional dispatch requests 41 while the vehicle 15 is traveling, without significantly affecting the boarding and disembarking times of users who have already confirmed their ride.
[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. With the advantage that the fares become cheaper as the number of users sharing the same vehicle 15 increases, it is possible to provide a ride-sharing system 10 that allows users to easily accept route changes and an increase in passengers while riding.
[0021] A new carpool route 42 for "S02b" that runs between time T03b and time T04b is generated. In "S02b", as shown by the thick line, the vehicle 15 runs through the 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" boards the vehicle, at point P3, a user who has made a dispatch request 41 for "R2" boards the vehicle, and at point P5, a user who has made a dispatch request 41 for "R3" boards the vehicle. At point P6, a user who has made a dispatch request 41 for "R3" gets off the vehicle, at point P2, a user who has made a dispatch request 41 for "R1" gets off the vehicle, and at point P4, a user who has made a dispatch request 41 for "R2" gets off the vehicle.
[0023] When the carpooling route 42 changes from "S02" to "S02b", the travel distance and travel time of the vehicle 15 change. Therefore, the operation costs, such as fuel costs and driver's working hours, change. The boarding time, alighting time, and required time 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 initially scheduled time range. The vehicle system 10 may notify each user of the schedule change. A large basic discount rate D may be applied to a user who has agreed to accept the change in boarding time and disembarking time after the 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 vehicle dispatch request 41 for one passenger to board and disembark. By each user making an individual vehicle dispatch request 41, multiple passengers can board from and disembark at the same location. The vehicle dispatch system 10 may accept the boarding and disembarking of multiple passengers with one vehicle dispatch request 41. In such a case, the vehicle 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 even if one person or two people board a vehicle for one vehicle dispatch request 41.
[0027] The dispatch system 10 may calculate the fare according to the number of passengers corresponding to the dispatch request 41. For example, when two people board a single dispatch request 41, the dispatch system 10 calculates the fare for the case where there are two dispatch requests 41 having the same boarding and dropping off points, and charges the fare for two people to the user who transmitted the dispatch request 41.
[0028] If a passenger satisfies a certain condition, such as a child, the fare for one person may be discounted to 0.5 person, etc. If two people board with one dispatch request 41, the fare for two people may not be charged, but an amount discounted from the fare for two people boarding with 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 storage device 22, an auxiliary storage 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 central processing units (CPUs), graphics processing units (GPUs), tensor processing units (TPUs), 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 control unit 21 and programs being executed by control unit 21 are temporarily stored here.
[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, a program to be executed by the control unit 21, and various data required for executing the program. The communication unit 24 is an interface that performs communication between the first information processing device 20 and a 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 configure 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 that runs on a mainframe. The first information processing device 20 may be configured with hardware such as a plurality of personal computers or a mainframe that perform distributed processing. The first information processing device 20 may 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. One or more CPUs, GPUs, multi-core CPUs, etc. are used in the control unit 31. The control unit 31 is connected to each hardware unit constituting the second information processing device 30 via the bus.
[0036] The main memory device 32 is a storage 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 laminated 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, a personal computer, or a tablet.
[0039] 3 is an explanatory diagram illustrating a record layout of the vehicle dispatch request DB 51. The vehicle dispatch request DB 51 is a DB that records vehicle dispatch requests 41 received from individual users in association with carpooling routes 42 generated based on the vehicle dispatch requests 41. The vehicle dispatch request DB 51 includes a vehicle dispatch request ID (Identifier) field, a user ID field, a boarding point field, a drop-off point field, a desired boarding time field, a carpooling route ID field, and a status field.
[0040] The vehicle dispatch request ID field records a vehicle dispatch request ID that is uniquely assigned to each vehicle dispatch request 41 made by a user. The user ID field records a user ID that is uniquely assigned to the user who made the vehicle dispatch request 41. For example, the user ID may be a mobile phone number or an email address designated by the user.
[0041] The boarding point field records the boarding point designated by the user. The alighting point field records the alighting point designated by the user. The boarding point and alighting point are recorded, for example, by latitude and longitude. The boarding point and alighting point may be recorded by a boarding / alighting location ID assigned to a specific boarding / alighting location such as a bus stop.
[0042] The desired boarding time field records the desired boarding time specified by the user. As described above, the desired boarding time is recorded with a predetermined range. Note that the dispatch request DB51 may have a desired alighting time field instead of or in addition to the desired boarding time field.
[0043] The carpool route ID field contains the carpool route ID unique 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 dispatch 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, the control unit 21 records "unconfirmed" in the status field. When the control unit 21 receives approval from the user via the second information processing device 30, the control unit 21 records "confirmed" in the status field. The status field may 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 one vehicle dispatch request 41.
[0046] An example of a method for calculating the fee borne by users using the carpooling route 42 will be described. In the following explanation, an example will be explained in which an operating company that operates the vehicle dispatch system 10 collects fees from users using the carpooling route 42 and pays the vehicle operation costs to the operator of the vehicle 15. Note that, when the operating company operates the vehicle 15 itself, the vehicle operation costs are the total amount of the maintenance costs of the vehicle 15, the depreciation costs, the labor costs of the vehicle operation personnel, and the like.
[0047] The ride-sharing fee U that the operating company charges to a user who uses the ride-sharing route 42 is the basic fee B minus the total discount rate C. 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 set for 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 i-th user, for example, based on 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 base discount rate for the i-th user. Ai is the additional discount rate for the i-th user. Si is the carpooling 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 charge Bi of the i-th user is determined, for example, by the route from the boarding point to the alighting point specified in the dispatch request 41 of the i-th user. For example, the basic charge Bi is the taxi fare from the boarding point to the alighting 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 including a late-night surcharge.
[0051] The basic charge Bi may be an amount to which a baggage fee determined according to the number and size of baggage, etc. is added. The basic charge Bi may be a flat rate determined according to conditions such as region, day of the week, or ride time. The basic charge Bi is a second ride fare when each user is individually picked up and dropped off on an individual route connecting the boarding point and the alighting point specified by the user in the ride dispatch request 41. This is an example.
[0052] The basic discount rate Di of the i-th user is a discount rate applied to a user who uses 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 determined for each period so that it is a small value when the demand for the carpooling route 42 is high and a large value when the demand for the carpooling route 42 is low. Specifically, the basic discount rate Di is set to a small value during periods when the demand for the carpooling route 42 is expected to be high due to consecutive holidays or large events being held in the neighborhood.
[0054] The basic discount rate Di may be set to vary depending on the weather. For example, on a bad weather day, 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, the number of users who want to disembark near the event venue increases just before the start of an event. Therefore, the basic discount rate Di for disembarking near the event venue is set to a small value. As exemplified 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 driver with little experience 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 may set the basic discount rate D for each user based on the user's usage history. For users who have used the vehicle dispatch system 10 many times, the basic discount rate D may be set to a large value to ensure regular customers. For example, the basic discount rate D may be set to a large value for users who have entered a discount coupon code such as "first time use."
[0058] The basic discount rate D may be determined based on the time between the time when the user inputs the dispatch request 41 and the desired boarding time and the number of remaining seats in the vehicle 15. For example, when 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 determined to be large, 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 at a constant value.
[0060] The additional discount rate Ai of 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 for a user who has decided to board later. The additional discount rate Ai may be zero for a user who has booked a ride by a specified date, such as the day before boarding, and may be a positive value for a user who decides to board on the day. The additional discount rate Ai may 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 if a user to whom the additional discount rate Ai and the carpooling discount rate Si are not applied 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 boards vehicle 15 alone, the user can enjoy the benefits of carpooling.
[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 be adjusted by the additional discount rate A. In that 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 total discount rate C may be calculated using formula (2). This makes it possible to increase the influence of the additional discount rate A on the total discount rate C.
[0065] The ride-sharing discount rate Si of the i-th user is a 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 deducting a 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 by 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 carpooling route 42, such as the planned distance or time of travel of the vehicle 15. The vehicle operating cost PT may include the toll of a toll road through which the carpooling route 42 passes. 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 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 a taxi fare when the vehicle 15 actually travels along the carpooling route 42. The vehicle operation cost PT may be a taxi fare calculated by a simulation before the vehicle 15 actually travels along the carpooling route 42. The vehicle operation cost PT may be a standard fee set in advance for each carpooling route 42.
[0069] The vehicle operation cost PT may include a fee paid by the operating company to a settlement company such as a credit card company. The vehicle operation cost PT may include an insurance premium paid by the operating company to an insurance company. The vehicle operation cost PT is an example of a first ride fare when a user is picked up or dropped off using the carpool 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 carpool 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 carpooling route 42, for example. For example, the cost Q of time and energy borne by the i-th user due to a detour is quantified as cost Qi. The weight Wi can be defined as the ratio of the cost Q borne 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 of "R1" is the first user, the user of "R2" is the second user, and the user of "R3" is the third user. The number of users N is 3.
[0076] The first user boards 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 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 at point P5 and gets off at point P6 without taking a detour.
[0077] The explanation will be continued by taking as an example a case where the cost Q borne by the first, second, and third users, respectively, by using the carpooling route 42 is scored as 3 points, 2 points, and 1 point. The cost Q is determined, for example, based on the increase in the ride time or travel distance for each user due to a detour, or on 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. The unit of Si is percent. S1 = min{(40-10)×3×3 / 6,35}=35 S2 = min{(40-10) x 3 x 2 / 6,35} = 30 S3 = min{(40-10) x 3 x 1 / 6,35} = 15
[0079] If the additional discount rate A1 of the first user is set to 0 percent, and the additional discount rates A2 and A3 of the second and third users are set to 5 percent, the control unit 21 calculates the total discount rate Ci of each user described above 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 described above, each user's total discount rate C and the carpooling 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 carpooling route 42.
[0082] Here, the detour time means the increased time compared to when the 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 the use of the carpooling route 42 and the boarding and alighting times of other users. For example, when another user gets on or off along the same route as when a certain user travels alone, the detour distance is zero, but the detour time is not zero. Therefore, even for such a user, the cost Q of using the carpooling route 42 is incurred, and a discount is received for using the carpooling route 42.
[0083] In more detail, the total discount rate C of 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 carpooling route 42.
[0084] For example, if it is determined that the weight W increases as the increase in travel time increases, a larger total discount rate C is applied to a user with a large increase in travel time. Similarly, if it is determined that the weight W increases as the increase in travel distance increases, a larger total discount rate C is applied to a user with a large increase in travel distance. A vehicle dispatch system 10 can be provided that reduces the fare burden for users who bear a large amount of non-monetary costs such as an increase in travel time.
[0085] The calculation method of the fare explained using the formulas (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 fee 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 base discount amount for the i-th user.
[0087] The basic discount amount G is a discount amount applied to a user who uses 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 that varies 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 dispatch request DB 51 exceeds a predetermined threshold value.
[0090] The control unit 21 reads from the vehicle dispatch request DB 51 a record in which "-" is recorded in the carpooling route ID field, that is, a record for which a corresponding carpooling route 42 has not been generated (step S501). Note that the control unit 21 does not need to read a vehicle dispatch request 41 that is more than a predetermined number of days in the future.
[0091] The control unit 21 generates a vehicle dispatch 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 the vehicle 15 cannot be forwarded between the end of operation of one carpool route 42 and the start of operation of the next carpool route 42, if the driver cannot ensure the required rest time, if the time to refuel the vehicle 15 cannot be ensured, or if the required margin of time in preparation for traffic congestion, etc. cannot be ensured, the control unit 21 will re-generate the vehicle dispatch plan 43.
[0093] If the travel distance of one of the carpooling routes 42 exceeds the travel distance of the vehicle 15, the control unit 21 may regenerate the vehicle allocation plan 43. A carpooling 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 described 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, the disembarking point, the boarding time, the disembarking time, the fare, and the discount rate to the second information processing device 30 used by each user who has made the 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 not to confirm the reservation (step S603). The control unit 31 may also accept an operation by the user to pay the reservation fee, or an operation to cancel the application, etc. 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 dispatch request DB 51 (step S506). The control unit 21 ends the process.
[0097] Fig. 5 is a flowchart explaining the flow of the program processing. Using Fig. 5, the flow of processing for adding a new vehicle dispatch request 41 to a generated carpooling route 42 will be explained. The control unit 31 accepts input of the vehicle dispatch request 41 by the 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 dispatch request 41 (step S511). The control unit 21 determines whether or not the dispatch plan 43 of the cluster corresponding to the received dispatch request 41 has been generated (step S512). If it is determined that the dispatch plan 43 has not been generated (NO in step S512), the control unit 21 creates a new record in the dispatch request DB 51 and records the dispatch 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 of creation of 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 process.
[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 that is related to 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 carpooling route and the preceding and succeeding carpooling routes 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 transportation time of the vehicle 15, the refueling time of the vehicle 15, and the maintenance time 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 dispatch plan 43. While the vehicle dispatch plan 43 is being regenerated, the accepted vehicle dispatch 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 fee for all the dispatch requests 41 included in the ride-sharing route 42 based on the formulas (1) to (6). The control unit 21 may calculate the ride-sharing fee for the added ride-sharing 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, the disembarking point, the boarding time, the disembarking time, the fare, and the discount rate to the second information processing device 30 for the dispatch request 41 in which the conditions such as the ride-sharing fare and the boarding time are changed (step S504). The subsequent processing is similar to the processing described using FIG. 4, and therefore the description 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 time and disembarking time notified to the user. For a user who has approved the change of boarding time and disembarking time, the control unit 21 may generate a second shared ride route based on 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 displayed by the control unit 31 on the touch panel 35 in step S602 described using Fig. 4. A map column 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. Below the shuttle button 641, a candidate column 65 is displayed. An application button 691 is displayed at the bottom of the screen.
[0107] In the map section 61, 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 are displayed. A scheduled boarding time with a 25-minute range is displayed near the boarding location mark 621. A scheduled arrival time with a 1-hour range is displayed near the disembarking location mark 622.
[0108] The candidate field 65 displays the scheduled boarding time, the scheduled disembarking time, and the fare. The fare "¥9,086" indicates the fare for a shared ride through the dispatch system 10. "¥12,980 for one person taking a taxi" at the bottom of the candidate field 65 indicates the approximate fare for taking 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 ride-sharing service, the fare is 30 percent cheaper than the estimated taxi fare. The control unit 31 uses the "bargain" 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" under the "bargain" mark indicates the number of remaining seats on the carpooling route 42. When the user selects the application button 691, "confirmed" is recorded in the status field of the vehicle allocation request DB 51, and the reservation is confirmed.
[0111] The control unit 21 may display numerical values used in calculating the ride-sharing fare, such as the above-mentioned basic discount rate D, additional discount rate A, ride-sharing discount rate S, total discount rate C, or ride-sharing discount amount, in the candidate field 65. It is possible to provide the vehicle dispatch system 10 that enables each user to know what discount is being applied to him or her.
[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] The rightmost column will be used as an example. "Yamaguchi Taro" at the top indicates the name of the driver in charge. Three shared-ride routes 42 are scheduled to depart at 4:00, 10:00, and 17:00 for this vehicle 15. The destinations of each shared-ride route 42 and the number of passengers scheduled to board are displayed.
[0114] Although not shown in the figure, when an operator of the vehicle dispatch system 10 clicks on a rectangle indicating the carpooling route 42, the control unit 21 displays detailed information such as a map of the travel route and contact information of the person planning to ride. The operator can rearrange the vehicle dispatch plan 43 and change the driver in charge as necessary. An experienced operator can appropriately modify the vehicle dispatch plan 43 and the carpooling route 42 automatically generated by the control unit 21 based on 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 for operating 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, borne by each user 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 and disembarking times with a range, a vehicle dispatch system 10 can be provided that can accept additional vehicle dispatch requests 41 and change the carpooling 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 moving directly from the boarding point to the disembarking point. In other words, 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 of moving directly.
[0118] The control unit 21 may receive an upper limit value of the detour time or detour distance from the user. If the user sets the detour time or detour distance to, for example, up to 20% more, 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 trip. In this way, for a user who sets conditions stricter than the default, the carpooling route 42 is more likely not to be established, but if it is established, the carpooling route 42 can be used with a shorter detour time or 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% increase is allowed, the control unit 21 will display, instead of "Good deal" on the screen described using Figure 6, "This will take 1.4 times the time of traveling by taxi. Is this okay?" or the like, 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% more, the control unit 21 creates a carpooling route that is twice as long or twice as far as 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 numerical value of the detour time or the detour distance set by the user. The control unit 21 may accept a designation of the upper limit value of the detour time or the detour distance every 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 receive 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 carpooling route may approve the second carpooling route generated in step S522 and the carpooling fare calculated in step S523. The control unit 21 may omit the processing of steps S504 to S505 and record the second carpooling route generated in step S522 in the dispatch request DB51.
[0124] The control unit 21 may obtain a generation prediction of the dispatch request 41, and when the generation prediction is greater than a predetermined threshold, generate a provisional dispatch request that is a dummy 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] In step S502 described using Fig. 4, the control unit 21 combines the actual vehicle dispatch request 41 and the tentative vehicle dispatch request received from the user to generate a tentative vehicle dispatch plan 43. After that, in step S522 described using Fig. 5, the control unit 21 deletes the tentative vehicle dispatch request in response to the additionally received vehicle dispatch request 41, and generates a second carpooling route.
[0126] If the actual dispatch request 41 received from the user is less than the provisional dispatch request, the fare corresponding to the provisional dispatch request will be insufficient. However, it is preferable that the shortfall is not passed on to the user, but borne by the operator that generated the carpool route 42. It is possible to provide a dispatch system 10 that guarantees the user that they can ride at the presented fare, regardless of whether or not a dispatch request 41 corresponding to the provisional dispatch request is generated.
[0127] When more vehicle dispatch requests 41 than provisional dispatch requests are generated, the control unit 21 may recalculate the fee to be charged to the user based on the actual vehicle dispatch requests 41, or may charge the user the fee calculated based on the provisional dispatch requests. In the latter case, the profitability of the operator of the vehicle dispatch system 10 can be increased.
[0128] As described above, it is possible to provide a vehicle dispatch system 10 that generates a provisional vehicle dispatch plan 43 based on a prediction of vehicle dispatch requests 41 and appropriately modifies the vehicle dispatch plan 43 in response to user requests. By generating a provisional 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 issued a vehicle dispatch request 41.
[0129] Instead of generating a 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 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 addition to the ride-sharing discount amount or the 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 for which additional dispatch requests 41 are expected, by presenting a discounted ride-sharing fee, users will be more likely 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 dispatch request 41 is not added, the ride-sharing fare calculated based on the actual dispatch request 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 presented in advance. This makes it possible to provide a dispatch system 10 that gives users who make reservations at an early stage a sense of security that the fare once presented will not be increased.
[0132] If more dispatch requests 41 than expected are added, the ride-sharing fee calculated based on the actual dispatch requests 41 will be lower than the discounted ride-sharing fee already presented to the user. However, even in such a case, the control unit 21 bills the user for the discounted ride-sharing fee already presented. By collecting a high fee 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 discounted ride-sharing fare already offered to the user. This provides a vehicle dispatch system 10 that gives users who make reservations at an early stage the expectation that an even cheaper fare may be offered.
[0134] The control unit 21 does not have to present the discounted ride-sharing fee to the user. In this case, for example, a predetermined flat rate for users who apply early is displayed in a pamphlet distributed to users in advance or on a WEB (World Wide 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 dispatch request 41 received in step S511 can be accommodated during a time period that is available in the dispatch plan 43, the control unit 21 may generate (step S522) a second carpooling route configured by the dispatch request 41. For example, if the 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 dispatching the vehicle 15.
[0136] In this way, the control unit 21 may set a discounted fare that is cheaper than the usual fare for the carpool route 42 generated instead of sending the vehicle forward. This is because the route needs to be traveled regardless of whether or not a user is present, and therefore 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 for permission to accept a second carpooling route when a new car dispatch request 41 is added to an existing carpooling route 42. Explanations 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 of Modification 1. The first information processing device 20 also transmits information to the second information processing device 30 used by an existing user in step S504 described using Fig. 5. 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 section 61 is displayed in the upper half of the screen. Below the map section 61, a summary section 67, an added person section 66, an approve button 692, and a disapprove button 693 are displayed. The summary section 67 displays a summary of the reserved carpool route 42. The added person section 66 displays information about the ride request 41 that has been added to the carpool route 42. The user can select an additional person to be added to the carpool route 42. You can check the face photo and nickname of the user driving, 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 for addition, 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 carpool route 42 including the added user is confirmed, and records this in the dispatch request DB 51.
[0141] For example, when a predetermined ratio or a predetermined number of users among the existing users select the approval button 692, the control unit 21 may determine that the carpooling route 42 including the additional user has been confirmed, and record the result in the vehicle dispatch 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 who will use the carpooling route 42 has been added.
[0142] [Variation 2] This modification relates to a vehicle dispatch system 10 that notifies existing users that the fare will be reduced when a user is added to a reserved shared ride route 42. Descriptions 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 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] A notification field 678 is displayed at the top of the screen, showing a message saying, "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 gets on, the addresses of the locations where other users stop to get on or off, and the address of the location where the user gets off. The word "New" is displayed on the right side of the added location. The address of the added location may be displayed prominently in any display format, such as bold, italic, underlined, or blinking.
[0146] The summary section 67 displays that the fare has been reduced from "6,400 yen" to "5,200 yen." The screen shown in Fig. 9 allows the user to realize the advantage 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 plurality of available carpooling routes 42 to a user. Descriptions 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 of the modified example 3. In steps S521 to S522 described using FIG. 5, the vehicle dispatch system 10 adds a vehicle dispatch request 41 to each of the first vehicle-sharing routes to generate a plurality of second vehicle-sharing routes. In step S504, the control unit 21 transmits the generated second vehicle-sharing routes to the second information processing device 30.
[0149] FIG. 10 shows a display of a plurality of second shared-ride routes on the touch panel 35 by the control unit 31 that has received the plurality of second shared-ride routes. 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 has been 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 carpooling routes generated in response to the user-specified dispatch 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 carpooling route 42 and "confirmed" in the status field of the vehicle allocation request DB 51. With the above steps, the reservation for the user's vehicle allocation request 41 is confirmed.
[0152] The control unit 21 can guide the user to a specific carpooling route 42 by adjusting various parameters described using equations (1) to (6) so that the fare is reduced when using the carpooling route 42 that is desired to increase the number of passengers. The operator may instruct the user to adjust the parameters.
[0153] [Embodiment 2] This embodiment relates to a vehicle dispatch system 10 that can increase the possibility of establishing a carpooling route 42 by allowing a user to set conditions. Descriptions 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 including the user's desired dispatch request 41. For example, if the carpooling fare U calculated based on the formulas (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 of the second information processing device 30 in the second embodiment. FIG. 11 is an example of a screen that the control unit 31 displays on the touch panel 35 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 inform 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 chance of a match" is displayed, along with a re-proposal button 694. If the user selects the re-proposal 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 can accept, a time setting field 677 for inputting a time that the user can accept, and a confirmation button 695.
[0157] The user inputs acceptable conditions in the fare setting field 676 and the time setting field 677, and selects the confirmation button 695. For example, if it is predicted that it will be difficult to take a taxi because a large-scale event is taking place, the user may be willing to accept a higher fare than if he or she 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 is able to generate a shared ride route 42 that satisfies the conditions designated 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-hailing 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-hailing request 41 of a user who has agreed to pay the additional fee by setting a higher fare in the fare setting field 676.
[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 against 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 equal to or less than a predetermined amount.
[0162] When the advantage to the user is small, the ride-sharing route 42 is not proposed, thereby increasing the user's trust in the vehicle dispatch system 10. The control unit 21 may accept a designation of a base discount amount, a base discount rate, or an upper limit of an increase in a required time from each user. The user can set conditions for receiving the presentation of the ride-sharing route 42 according to his / her own needs.
[0163] [Embodiment 3] This embodiment relates to a vehicle dispatch system 10 that proposes changes to a boarding point, etc. Explanation of parts common to the first embodiment will be omitted.
[0164] For example, when the boarding point or disembarking point specified in the dispatch request 41 is changed to the opposite side of the road, etc., a carpooling route 42 that satisfies the requests of many users may be generated. Similarly, when the boarding time or disembarking time specified in the dispatch request 41 is changed, a carpooling route 42 that satisfies the requests of many users may be generated. In this embodiment, the control unit 21 proposes 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 a carpooling route 42 that satisfies the dispatch requests 41 of many other users can be generated by changing the arrival time of the user to 10:30, 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 has approved 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 1000 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 in a vehicle whether or not the conditions can be changed to conditions different from those when the user presented the vehicle dispatch request 41. Explanation of parts common to the first embodiment will be omitted.
[0169] Fig. 13 is a screen example of the fourth embodiment. A specific example will be described. 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 the vehicle 15 is traveling, a new vehicle dispatch request 41 is issued by user C. The control unit 21 cannot generate a carpooling route 42 that satisfies the conditions of each user. However, if user C rides in the vehicle 15 traveling with users A and B, it is expected that they will 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 a screen shown in FIG. 13 on the second information processing device 30 of the user who is riding the vehicle.
[0172] 13, the user knows that the fare will be significantly reduced if the user allows the estimated arrival time to be delayed by 30 minutes. The user decides whether or not 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 share the ride.
[0174] According to this embodiment, it is possible to provide a vehicle dispatch system 10 that accepts a user's decision as to whether or not to accept conditions different from the initial vehicle dispatch request 41.
[0175] [Embodiment 5] The present embodiment relates to a vehicle dispatch system 10 that displays the commission charged to the operator that operates the vehicle dispatch system 10 and the vehicle operating costs separately.
[0176] The Travel Agency Law stipulates two types of trips: "packaged tours" and "arranged tours." Travel agents are not required to display the breakdown of fees to travelers for packaged tours, but are required to display the breakdown of fees, such as actual expenses and fees, for arranged tours. For example, in the example screen shown in Figure 6, the breakdown of fees is not displayed, but if the breakdown of fees is not displayed at all after that, the provision of the shared ride route 42 can be interpreted as equivalent to the provision of a packaged tour under the Travel Agency Law.
[0177] In contrast, the vehicle dispatch system 10 of this embodiment provides users with information equivalent to arranged travel under the Travel Agency Act. Displaying the details of packaged tours is not prohibited either. Therefore, this embodiment can be used in both cases where the provision of the shared ride route 42 is for arranged travel and when it is for packaged travel.
[0178] 14 is an explanatory diagram that illustrates 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] The 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 the carpooling route 42. As described above, the cost may include credit card fees, actual costs such as communication fees, insurance fees, etc.
[0180] When the ratio of the travel distance between user E and user F is 3:2, the fare for user E can be calculated to be 600 yen and the fare for user F to be 400 yen, which are allocated in proportion to the travel distance. User E's 600 yen and user R's 400 yen are examples of the allocated expenses that are the expenses required for operating the carpool route 42 allocated between the users.
[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 that "fare is 600 yen, operation fee is 100 yen, total is 700 yen" as shown in the upper part of Fig. 14. Similarly, the control unit 21 displays to the second information processing device 30 of user F that "fare is 400 yen, operation fee is 100 yen, total is 500 yen" as shown in the lower part of Fig. 14.
[0182] For example, as illustrated in FIG. 6, the control unit 21 may display the fare and the number of remaining seats when a single person takes a taxi.
[0183] [Variation 4] A case will be described where the above user F does not actually exist and is a provisional dispatch request generated by the control unit 21. If no 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 the user E, and adjusts the difference with a handling fee. That is, the vehicle dispatch system 10 notifies the user E of the fare of "1,000 yen fare + -300 yen handling fee, totaling 700 yen" via the second information processing device 30. In this way, a vehicle dispatch system 10 that the user can use with confidence can be provided.
[0185] The display of the "Handling Fee - 300 yen" does not matter as long as it indicates a discount of 300 yen from the fare of 1,000 yen. 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] We will explain 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 carpooling 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 operation expenses of each user, including the new dispatch request 41. Here, an example will be described in which the operation 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 travel time or the like due to the incorporation of the new vehicle dispatch request 41 into the carpooling 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 carpooling route 42, by adjusting the commission, 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] We will explain 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 carpooling 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 user G who gets on at point P7 and gets off at point P9 is added after a ride-sharing fare of 700 yen is presented to user E as shown in Fig. 14. The operating expenses of the vehicle 15 remain unchanged at 1000 yen.
[0192] The control unit 21 recalculates the fare for each user based on the riding distance of each user. A case where the fare for user E changes from 600 yen to 400 yen will be described. 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 increase in fees is an example. The allocation ratio is not limited to half and half. The increase in fees for the operating company may be a fixed amount, and the remainder may be distributed to the user. The increase in fees for the user may be a fixed amount, and the remainder may be 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 are reduced by 200 yen. This modified example may 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 modified example, a vehicle dispatch system 10 can be provided that allows existing users to enjoy the benefit of reduced carpooling fares when the number of passengers riding together on the carpooling route 42 increases.
[0197] [Variation 7] Fig. 15 is an explanatory diagram that shows a schematic diagram of a carpooling route 42 of the seventh modified example. In the carpooling route 42 of this modified example, 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 moves directly from point P7 to point P10. 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.
[0198] We will explain this as an example where the distance traveled by vehicle 15 when moving directly from point P7 to point P10 is 2 kilometers, the distance traveled directly from point P8 to point P9 is 1 kilometer, and the distance traveled from point P7 to point P10 via point P8 and point P9 is 3 kilometers, and the operating costs of vehicle 15 are 1,200 yen.
[0199] User E's ride distance is 3 kilometers. User F's ride distance is 1 kilometer. Therefore, if the operating expenses are allocated in proportion to the distance traveled by each user as described above, the fares borne by user E and user 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, even though user E takes a longer route to share a ride, he or she will have to pay a higher fare than user F. With such an allocation, user E may decide that it is more profitable to take a taxi alone than to use the shared ride route 42. As a result, if the shared ride route 42 is not established, user F will also be unable to use the shared ride 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 fare to be paid by user E and user F is calculated as follows:
[0203] User E: 1200 x 2 / 3 = 800 yen User F: 1200 x 1 / 3 = 400 yen
[0204] According to this modified example, a vehicle dispatch system 10 can be provided that increases the likelihood of a carpooling route 42 being established by presenting a cost sharing scheme that is easy for each user to accept.
[0205] The control unit 21 may distribute the operating expenses of the carpooling route 42 in proportion to the fare when each user rides in a taxi alone. In addition, in FIG. 15, for example, when the distance from point P9 to point P10 is long, user F may not be able to appropriately receive the reduction benefit of the fare he or she pays. 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 is less when user F rides in a taxi with user E than when user F rides alone.
[0206] [Embodiment 6] 16 is an explanatory diagram illustrating a 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 storage device 22, an auxiliary storage 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 in 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 out 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. In this way, 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 the information processing device 20 according to the seventh embodiment. 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 specifying a boarding point and an alighting point corresponding to a plurality of users. The route generation unit generates a shared ride route for picking up and dropping off each user at each boarding point and alighting point based on the plurality of dispatch requests.
[0211] The fare acquisition unit 83 acquires a first fare when a user is picked up or dropped off along a shared route, and a second fare when each user is picked up or dropped off along an individual route connecting a boarding point and an alighting point designated by each user. The detour acquisition unit 84 acquires a detour time or a detour distance for each user based on the shared route and the individual route. The calculation unit 85 calculates a carpooling discount rate or a carpooling discount amount for each user based on the first fare, the second fare for each user, and the detour time or the detour distance.
[0212] The technical features (constitutive 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 illustrative in all respects and should not be considered as limiting. 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 scope and meaning equivalent to 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 Vehicle Request 42 Carpool Route 43 Vehicle allocation plan 51 Vehicle dispatch request DB 61 Map section 621 Boarding point mark 622 Drop-off location 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-suggest button 695 Confirm button 81 Reception 82 Route Generation Unit 83 Fee Acquisition Department 84 Detour acquisition part 85 Calculation section 90 Computer 96 Portable recording media 97 Program 98 Semiconductor Memory
Claims
1. Accepting a plurality of dispatch requests, each of which specifies a boarding point and an alighting point, corresponding to each of a plurality of users; Generate a shared ride route for picking up and dropping off each user at each boarding point and alighting point based on the plurality of vehicle dispatch requests; obtain a first fare when the user is picked up or dropped 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 connecting a boarding point and an alighting point designated by each user when the user is picked up or dropped off individually along the individual route; The first fare is prorated based on the travel distance of the individual route or the fare of the individual route, thereby calculating the amount of the first fare to be paid for each user. An information processing method in which processing is performed by a computer.
2. The ride-sharing fee paid by each user using the ride-sharing route is determined by adjusting the amount of the charge 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 information processing method according to claim 1 .
3. 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 value 3. The information processing method according to claim 1.
4. The ride-sharing fee paid by each user using the ride-sharing route is divided into an allocated cost obtained by allocating the cost required for operating the ride-sharing route among the users, and a handling fee, and is presented to each user.
4. The information processing method according to claim 1.
5. The information about the carpooling route is output to the user who agrees to pay the additional fee, with priority over other users.
5. The information processing method according to claim 1.
6. 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, when the ride-sharing fare paid by each user exceeds the second ride fare, information regarding the ride-sharing route is not output. The information processing method according to claim 5.
7. Obtaining a forecast of occurrence of the dispatch request; If the occurrence prediction exceeds a predetermined threshold, the shared ride route is generated based on the received multiple vehicle dispatch requests and a temporary vehicle dispatch request generated based on the occurrence prediction.
7. The information processing method according to claim 1.
8. If the number of vehicle dispatch requests generated after the carpooling route is generated is smaller than the temporary car dispatch requests, the business operator who generated the carpooling route bears the shortage of costs. The information processing method according to claim 7.
9. When the shortfall in costs occurs, the business operator notifies each user that it will cover all or part of the shortfall in costs. The information processing method according to claim 8.
10. 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 dispatch request before generating the ride-sharing route; Even if the number of vehicle dispatch requests generated after the generation of the carpooling route is smaller than the number of temporary vehicle dispatch requests, the recorded carpooling discount rate or the carpooling discount amount is presented.
10. The information processing method according to claim 7.
11. Even if the number of vehicle dispatch requests generated after the generation of the carpooling route is greater than the number of temporary vehicle dispatch requests, the recorded carpooling discount rate or the carpooling discount amount is presented. The information processing method according to claim 10.
12. Record a vehicle dispatch plan in which one vehicle sequentially travels along the plurality of 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. The information processing method according to any one of claims 1 to 11.
13. Determine whether to permit the dispatch request based on a travel distance of the vehicle in addition to the travel time or the travel distance. The information processing method according to claim 12.
14. Determine whether to accept the 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 12.
15. If the newly accepted dispatch request corresponds to a time period during which the vehicle is not scheduled to travel along the carpooling route in the dispatch plan, a notice of approval at a discounted rate is transmitted to the user corresponding to the dispatch request.
15. The information processing method according to claim 12.
16. A reception unit that receives a plurality of dispatch requests each specifying a boarding point and an alighting point corresponding to each of a plurality of users; A route generation unit that generates a shared ride 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 of an individual route that is a route connecting a boarding point and an alighting point designated by each user when the user is individually transported to and from the individual route or a fare for the individual route; a calculation unit that calculates an amount of the first fare for each user by apportioning the first fare based on a travel distance of the individual route or a fare for the individual route; An information processing device comprising:
17. Accepting a plurality of dispatch requests, each of which specifies a boarding point and an alighting point, corresponding to each of a plurality of users; Generate a shared ride route for picking up and dropping off each user at each boarding point and alighting point based on the plurality of vehicle dispatch requests; obtain a first fare when the user is picked up or dropped 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 connecting a boarding point and an alighting point designated by each user when the user is picked up or dropped off individually along the individual route; The first fare is apportioned based on the travel distance of the individual route or the fare of the individual route, thereby calculating the amount of the first fare to be paid for each user. A program that causes a computer to carry out processing.
