Control method, program, and server device

Abstract

A control method for a computer to: acquire first information indicating a history of a plurality of users using a plurality of vehicles to move between hubs; accept second information indicating a request to move a vehicle from one hub to another hub; output a price of a reward to be paid to each user if the request indicated by the second information is achieved, in accordance with a matching rate calculated as a degree of coincidence between the first information of each user and the second information; and issue a notification of the second information and information indicating the reward for each user.

Description

[Technical Field]

[0001] This disclosure relates to a technology for relocating vehicles in a system that allows multiple vehicles located at multiple locations to be shared by multiple users. [Background technology]

[0002] Sharing services that allow multiple users to share multiple vehicles located at multiple locations have been known for some time. In these services, contract workers typically charge the vehicles, replace batteries, and move vehicles to locations where there is a shortage of vehicles—a process known as vehicle redeployment. However, the costs associated with these operations are high relative to sales, putting pressure on profitability.

[0003] To address these issues, for example, Patent Document 1 proposes acquiring the travel history of each user in a shared vehicle and sending travel recruitment information, which solicits the movement of the vehicle to another location, to users who have traveled during the time period for such travel work. It also proposes including information in the travel recruitment information that the user who performs the travel work will be paid compensation according to the demand for the travel work.

[0004] Patent Document 2 proposes calculating the walking distance a user travels to rent a shared vehicle based on the usage history of each station by multiple users, and providing high-value incentive benefits when a user uses a station located beyond that walking distance.

[0005] Patent Document 3 proposes identifying target stations whose usage frequency is below a predetermined value based on the user's past usage history of each station. If the user selects a station that is not a target station, the system outputs information about the selected station and the target station, and further outputs a route that passes near the target station as the route to the selected station.

[0006] However, with conventional technology, there was a problem in that the success rate of vehicle relocation tasks would not improve unless the reward paid upon completion of the task was set at a high price. [Prior art documents] [Patent Documents]

[0007] [Patent Document 1] Japanese Patent Publication No. 2009-301150 [Patent Document 2] Japanese Patent Publication No. 2016-85509 [Patent Document 3] Patent No. 6561483 [Overview of the project]

[0008] This disclosure is made to solve the above-mentioned problems and aims to present a control method, program, and server device that can improve the success rate of vehicle relocation work to other locations at a low cost.

[0009] A control method according to one aspect of the present disclosure is a control method for a system in which multiple vehicles located at multiple locations are shared by multiple users, wherein a computer acquires first information indicating the history of how the multiple users have moved between locations using the multiple vehicles, receives second information indicating a request to move a vehicle from one location to another, outputs the price of the reward to be paid to each user when the request indicated by the second information is fulfilled, according to a matching rate calculated as the degree of agreement between the first information and the second information for each user, and notifies the second information and information indicating the reward for each user. [Brief explanation of the drawing]

[0010] [Figure 1] This figure shows an example of the overall configuration of a vehicle sharing system. [Figure 2] This flowchart shows an example of a process for storing movement history information. [Figure 3]This flowchart shows an example of the processing performed in the vehicle sharing system when travel request information is received. [Modes for carrying out the invention]

[0011] (Background leading to this disclosure) As mentioned above, traditional sharing services that allow multiple users to share multiple vehicles located at multiple locations have the problem of incurring costs when relocating vehicles to other locations.

[0012] To address this problem, Patent Document 1 proposes notifying users of information soliciting vehicle relocation work to other locations, along with information that compensation will be paid according to the demand for such relocation work. However, the technology in Patent Document 1 has the problem that the completion rate of vehicle relocation work will not improve unless the compensation paid upon completion of vehicle relocation work to other locations is set at a high price.

[0013] The technologies described in Patent Documents 2 and 3 above aim to reduce the operational efficiency between locations in order to reduce the work of moving vehicles to other locations, but they do not address improving the completion rate of vehicle movement to other locations or the costs involved.

[0014] For example, suppose there is a request to move a vehicle located at a first location near a university to a second location near a train station. In this case, if it can be predicted that the university student, who is a user of the sharing service, will be traveling from the university to the train station, it is possible to notify the student of the request to move the vehicle from the first location to the second location and have the student fulfill the request free of charge.

[0015] Thus, the inventors have diligently studied technologies to improve the success rate of vehicle relocation work to other locations at low cost, and have arrived at the following embodiments of the present disclosure.

[0016] (1) A control method relating to one aspect of the present disclosure is a control method in a system that allows multiple users to share multiple vehicles located at multiple locations, wherein a computer acquires first information indicating the history of how the multiple users have moved between locations using the multiple vehicles, receives second information indicating a request to move a vehicle from one location to another, outputs the price of the reward to be paid to each user when the request indicated by the second information is fulfilled, according to a matching rate calculated as the degree of agreement between the first information and the second information for each user, and notifies the second information and information indicating the reward for each user.

[0017] In this configuration, a second piece of information and information indicating the reward to be paid to each user when the request indicated by the second piece of information is fulfilled are notified. Therefore, in this configuration, it is possible to request each user to move a vehicle between the locations indicated by the second piece of information using the notified reward.

[0018] Furthermore, the reward price notified to each user is output according to the matching rate calculated as the degree of agreement between each user's first and second information. For example, a user who has moved a vehicle with a high degree of agreement with the vehicle movement details indicated by the second information can be requested to move a vehicle between the locations indicated by the second information at a lower reward than a user who has moved a vehicle with a low degree of agreement with the vehicle movement details indicated by the second information. In this way, this configuration can reduce the price of rewards and improve the success rate of fulfilling requests to move vehicles at a low cost.

[0019] (2) In the control method described in (1) above, further, based on the first information, one or more users who have a history of moving from one base to another base are identified, and for each of the one or more users, the degree to which the vehicle movement details by each user based on the first information match the vehicle movement details based on the second information is calculated as the matching rate, and in the notification, the second information and information indicating the reward for each user may be notified to each of the one or more users.

[0020] According to this configuration, the reward price notified to each of the one or more users can be set lower, for example, for users with a higher matching rate among the one or more users. In this case, among the one or more users, users who are relatively more likely to perform vehicle movements in the same manner as those indicated by the second information can be requested to perform vehicle movements between the locations indicated by the second information at a lower reward.

[0021] (3) In the control method described in (2) above, the price of the reward may be lower the higher the matching rate.

[0022] In this configuration, the reward price notified to one or more users will be lower for users with a higher matching rate. Therefore, among the one or more users, users who are relatively more likely to move their vehicles in the same manner as indicated by the second information can be requested to move their vehicles between the locations indicated by the second information at a lower reward.

[0023] (4) In the control method described in (2) above, the notification may include a provisional price as the price of the reward, and if, within a certain period of time from the notification, information is received from a predetermined number of users indicating that they will accept the request indicated by the second information at a price less than or equal to the provisional price, the lowest price among the received prices less than or equal to the provisional price may be determined as the price of the reward, and the second information and the information indicating the reward may be notified to the user who sent the information indicating that they will accept the request indicated by the second information at the lowest price.

[0024] In this configuration, users who send information indicating they will accept the request shown in the second information at the lowest price below the provisional price are notified of the second information and information indicating the reward at the lowest price. Therefore, the movement of the vehicle shown in the second information can be achieved at a low cost.

[0025] (5) In the control method described in (4) above, further, third information is obtained indicating the reaction of the plurality of users when they receive notification of the second information and the information indicating each user's reward, and for each of the plurality of users, a response sensitivity is calculated based on the third information to indicate how high among the plurality of users the probability is that each user willing to achieve the request indicated by the second information when the plurality of users receive notification of a predetermined standard price as the price of the reward, and further, for each of the plurality of users, a response rate is calculated based on the matching rate and the response sensitivity, which is the probability that the user is expected to show intent to achieve the request indicated by the second information, and in the notification, the second information and the information indicating the reward may be notified to users among the one or more users whose response rate, matching rate and response sensitivity are equal to or greater than a predetermined value.

[0026] This configuration makes it possible to avoid notifying users who are predicted to have no intention of fulfilling the requests indicated by the second information, as their response rate, matching rate, and response sensitivity are all below predetermined values, of the second information and information indicating rewards.

[0027] (6) In the control method described in (1) above, further, third information is obtained indicating the reaction of the plurality of users when they receive notification of the second information and information indicating each user's reward, and for each of the plurality of users, a response sensitivity is calculated based on the third information indicating how high among the plurality of users the probability is that each user is willing to fulfill the request indicated by the second information when the plurality of users receive notification of a predetermined standard price as the price of the reward, and in the output of the price of the reward, the price of the reward may be determined to be lower the higher each user's response sensitivity is.

[0028] According to this configuration, the reward price is determined to be lower for users who have previously moved a vehicle from one location to another, and who have a higher response rate. Therefore, among the one or more users, users who are relatively more likely to show willingness to fulfill the request indicated by the second information can be requested to move a vehicle between the locations indicated by the second information at a lower reward. As a result, this configuration can reduce the price of rewards and improve the success rate of vehicle movement requests at a low cost.

[0029] (7) In the control method described in (1) or (6) above, when acquiring the first information, if the user passes through an intermediate base located within a predetermined distance from the vehicle while traveling from one base to the other base using the vehicle, the first information may include information indicating that the user traveled from one base to the other base using the vehicle, and information indicating that the user traveled from one base to the intermediate base using the vehicle.

[0030] According to this configuration, a user who has a history of moving a vehicle from one location to another location can be notified of the information not only when a second piece of information is received requesting that the vehicle be moved from one location to another location, but also when information is received requesting that the vehicle be moved from one location to an intermediate location.

[0031] (8) In the control method described in (7) above, when acquiring the first information, if the user has passed through an intermediate base located within a predetermined distance from the vehicle while traveling from one base to the other base using the vehicle, information indicating that the user has traveled from the intermediate base to the other base using the vehicle may also be acquired as the first information.

[0032] According to this configuration, if a user who has previously moved a vehicle from one of the aforementioned locations to another location receives information requesting to move a vehicle from the intermediate location to the other location, that information can also be notified.

[0033] (9) In the control method described in any one of (1) and (6) to (8) above, the first information includes information indicating the departure point and departure date and time of the vehicle used by the multiple users for travel, and information indicating the arrival point and arrival date and time of the vehicle used by the multiple users for travel, and the second information further includes information indicating the time period during which the vehicle is moved, and the details of the vehicle's movement may include the time period during which the vehicle is used, the departure point, and the arrival point.

[0034] According to this configuration, the time period during which each user traveled can be determined from the departure and arrival times of the vehicles used by each user included in the first information, and the time period during which the determined vehicle usage can be compared with the time period during which the vehicles were moved included in the second information. Furthermore, the departure and arrival points of the vehicles used by each user traveled included in the first information can be compared with the first location, which is the departure point of the vehicle indicated in the second information, and the other location, which is the arrival point of the vehicle indicated in the second information.

[0035] These comparison results allow for the appropriate calculation of the degree of agreement between the vehicle usage time, departure point, and arrival point of each user's vehicle movement details and the vehicle usage time, departure point, and arrival point of the second information. As a result, the matching rate for each user included in the one or more users can be appropriately calculated.

[0036] (10) In the control method described in (9) above, the details of the vehicle's movement further include at least one of the following: the weather at the time of the vehicle's movement, the date category of the day the vehicle is moved, the month the vehicle is moved, and the type of vehicle, wherein the date category may be information indicating which of the seven days of the week from Sunday to Saturday and public holidays it is.

[0037] According to this configuration, by further using the comparison results between at least one of the following, which can be determined based on the first information: the weather at the time of vehicle movement, the date category on the day the vehicle was moved, the month the vehicle was moved, and the type of vehicle used for the movement, and which can be determined based on the second information corresponding to at least one of the above, the weather at the time of vehicle movement, the date category on the day the vehicle was moved, the month the vehicle was moved, and the type of vehicle used for the movement, it is possible to more appropriately calculate the degree of agreement between the details of vehicle movement by each user and the details of vehicle movement indicated by the second information. As a result, the matching rate of each user included in the one or more users can be more appropriately calculated.

[0038] (11) A program relating to another aspect of the present disclosure causes a computer in a system that allows multiple users to share multiple vehicles located at multiple locations to function as follows: an acquisition unit that acquires first information indicating the history of how multiple users have moved between locations using the multiple vehicles; a reception unit that receives second information indicating a request to move a vehicle from one location to another; a determination unit that outputs the price of a reward to be paid to each user when the request indicated by the second information is fulfilled, according to a matching calculated as the degree of agreement between the first information and the second information for each user; and a notification unit that notifies the second information and information indicating the reward for each user.

[0039] This configuration provides the same effects as the control method described above. Needless to say, this disclosure allows such computer programs to be distributed via computer-readable non-temporary recording media such as CD-ROMs or communication networks such as the Internet.

[0040] (12) A server device according to another aspect of the present disclosure is a server device provided for a system that allows multiple users to share multiple vehicles located at multiple locations, and comprises: an acquisition unit that acquires first information indicating the history of how multiple users have moved between locations using the multiple vehicles; a reception unit that receives second information indicating a request to move a vehicle from one location to another; a determination unit that outputs the price of a reward to be paid to each user when the request indicated by the second information is fulfilled, according to a matching rate calculated as the degree of agreement between the first information and the second information for each user; and a notification unit that notifies the second information and information indicating the reward for each user.

[0041] This configuration provides the same effects and benefits as the control method described above.

[0042] The embodiments described below are all specific examples of this disclosure. The numerical values, shapes, components, steps, and order of steps shown in the following embodiments are examples only and are not intended to limit this disclosure. Furthermore, among the components in the following embodiments, those not described in the independent claim representing the highest-level concept will be described as optional components. In addition, the contents of each embodiment can be combined.

[0043] The embodiments of this disclosure will be described below with reference to the drawings.

[0044] (First Embodiment) Figure 1 shows an example of the overall configuration of the vehicle sharing system 100 (system). The vehicle sharing system 100 includes multiple vehicles 2 located at multiple locations, a server device 1 for providing a sharing service that allows multiple users to share the multiple vehicles 2, multiple user terminals 3 used by multiple users of the sharing service, and multiple administrator terminals 4 used by multiple administrators of the sharing service. Locations are places where users rent vehicles 2 and places where they return vehicles 2.

[0045] Vehicle 2, user terminal 3, and administrator terminal 4 are connected to server device 1 via network 9 so that they can communicate with each other. Network 9 consists of a Wide Area Network (WAN), which includes, for example, the Internet and a mobile phone network.

[0046] Vehicle 2 may be a vehicle that can be moved by the user's driving, such as an automobile, motorcycle, moped, or electric bicycle. User terminal 3 and administrator terminal 4 may be information processing devices that can communicate with external devices via network 9, such as smartphones, tablet devices, and personal computers. Server device 1 may be a cloud server consisting of one or more computers equipped with a processor such as a CPU (Central Processing Unit), memory, and a communication circuit that communicates with external devices via network 9.

[0047] Furthermore, the server device 1, vehicle 2, user terminal 3, and administrator terminal 4 are connected to the public server 5 via network 9, enabling communication. The public server 5 responds to inquiries from the server device 1, vehicle 2, user terminal 3, and administrator terminal 4 with the necessary public information. This public information includes, for example, information indicating the season corresponding to a specified date and time, information indicating the weather at a specified date and time, and information indicating the date category for a specified date. The date category refers to information indicating whether the date falls on one of the seven days of the week from Sunday to Saturday or on a public holiday.

[0048] The vehicle sharing system 100, based on information obtained by the server device 1 via the network 9 from the vehicle 2, administrator terminal 4, and public server 5, notifies the user terminal 3 via the network 9 of information indicating a request to move vehicle 2 from one location to another (hereinafter referred to as "movement request information (second information)") and information indicating the reward to be paid when the request indicated by the movement request information is fulfilled.

[0049] Information indicating a reward includes information indicating the type of reward and information indicating the price of the reward. Types of rewards include, for example, monetary rewards, points, service vouchers, and coupons. If the type of reward is a monetary reward, the price of the reward is the amount of the reward. If the type of reward is points, the price of the reward is the number of points. If the type of reward is a service voucher, the price of the reward is the number of times the service covered by the service voucher can be used for free. If the type of reward is a coupon, the price of the reward is the discounted price of the service covered by the coupon. Hereafter, the type of reward will be assumed to be a monetary reward, and the price of the reward will be assumed to be the amount of the monetary reward.

[0050] Furthermore, the vehicle sharing system 100 manages information indicating the user's response to the request indicated by the travel request information, which is transmitted from the user terminal 3 that received the notification to the server device 1 via the network 9.

[0051] The travel request information includes the type of vehicle 2 to be moved, the departure and arrival points of vehicle 2, the time period during which vehicle 2 will be moved (hereinafter referred to as the travel time period), and the desired response rate indicating the extent to which the vehicle 2 should be moved. The travel time period also includes the date on which vehicle 2 will be moved.

[0052] The following describes the detailed configurations of vehicle 2 and server device 1.

[0053] Vehicle 2 includes a memory 20, a wireless communication circuit 21, a GPS (Global Positioning System) sensor 22, and a processor 23. Vehicle 2 further includes an operating device for allowing the user to perform various operations to use Vehicle 2, and a display for displaying various information. Vehicle 2 may also include a battery for powering Vehicle 2.

[0054] Memory 20 is composed of a non-volatile, rewritable semiconductor memory, such as flash memory. The memory 20 stores programs executed by the processor 23. The wireless communication circuit 21 communicates wirelessly with the server device 1 via the network 9. The GPS sensor 22 detects the current location.

[0055] The processor 23 consists of a CPU (Central Processing Unit). The processor 23 performs predetermined processing by executing programs stored in memory 20.

[0056] For example, the processor 23 transmits various information and data to the server device 1 using the wireless communication circuit 21. Specifically, while the vehicle 2 is running, the processor 23 periodically (for example, every 30 seconds) transmits status information indicating the current state of the vehicle 2 to the server device 1.

[0057] The status information includes information indicating the current date and time (hereinafter referred to as current date and time information), identification information for vehicle 2, and information indicating the current location of vehicle 2 as detected by the GPS sensor 22.

[0058] Server device 1 includes memory 10, communication circuit 11, and processor 13.

[0059] Memory 10 is composed of, for example, a non-volatile, rewritable semiconductor memory such as flash memory or an HDD (Hard Disk Drive). The memory 10 stores the program executed by the processor 13. Memory 10 also includes a base information storage unit 111, a vehicle information storage unit 112, a movement history information storage unit 113, and a reaction history information storage unit 114.

[0060] The base information storage unit 111 stores information about multiple bases (hereinafter referred to as base information). The base information includes base identification information, information indicating the location of the base, information indicating the number of vehicles 2 currently stationed at the base (hereinafter referred to as current number information), information indicating the minimum number of vehicles 2 that should be stationed at the base (hereinafter referred to as minimum number information), and information about equipment available at the base. Equipment available at the base includes charging devices for charging the batteries of the vehicles 2 and administrator terminals 4 located at the base.

[0061] The vehicle information storage unit 112 stores information about multiple vehicles 2 (hereinafter referred to as vehicle information) and status information indicating the status of multiple vehicles 2. The vehicle information includes identification information for vehicle 2, information indicating the type of vehicle 2, communication destination information for vehicle 2, model number (type number) of vehicle 2, and information indicating the speed at which vehicle 2 is moving. The information indicating the type of vehicle 2 includes information indicating whether vehicle 2 is an automobile, motorcycle, moped, or electric bicycle, and information indicating the model number (type number) of vehicle 2.

[0062] The movement history information storage unit 113 stores information (first information) indicating the history of movement by multiple users using multiple vehicles 2. As will be described later, basically, each time a user uses a vehicle 2, the movement history information storage unit 113 stores information (hereinafter referred to as movement history information) indicating the history of movement by that user using that vehicle 2. When a user uses a vehicle 2 once, it means that the user rented a vehicle 2 at a certain location, used it to travel, and then returned the vehicle 2 at the same location where it was rented or at a different location.

[0063] Specifically, the travel history information includes user identification information, identification information of vehicle 2 used by the user for travel, the departure point and departure date and time of vehicle 2, the arrival point and arrival date and time of vehicle 2, the weather at the departure date and time or the arrival date and time, the date category of the travel day of vehicle 2, the month in which vehicle 2 traveled, and information indicating the type of vehicle 2.

[0064] The response history information storage unit 114 stores information indicating the responses of multiple users when they receive notifications of movement request information and information indicating the reward to be paid to each user when the request indicated by the movement request information is fulfilled (hereinafter referred to as response history information (third information)).

[0065] Specifically, the response history information includes user identification information, information indicating the travel request and reward notified to the user, and information indicating whether the user intends to fulfill the request indicated in the travel request information (hereinafter referred to as response result information).

[0066] The communication circuit 11 communicates with multiple vehicles 2, multiple user terminals 3, multiple administrator terminals 4, and a public server 5 via the network 9.

[0067] The processor 13 consists of a CPU (Central Processing Unit). The processor 13 operates as an acquisition unit 131, a reception unit 132, a identification unit 133, a calculation unit 134, a determination unit 135, and a notification unit 136 by executing a program stored in the memory 10.

[0068] The acquisition unit 131 acquires various types of information received by the communication circuit 11 from multiple vehicles 2, multiple user terminals 3, and multiple administrator terminals 4. The acquisition unit 131 also stores information based on the information acquired from the multiple vehicles 2, multiple user terminals 3, and multiple administrator terminals 4 via the communication circuit 11 in the memory 10.

[0069] Specifically, the acquisition unit 131 acquires vehicle information for multiple vehicles 2 shared in the sharing service and location information for multiple locations, which are received by the communication circuit 11 from the administrator terminal 4. The acquisition unit 131 stores the acquired vehicle information for multiple vehicles 2 in the vehicle information storage unit 112 and stores the acquired location information for multiple locations in the location information storage unit 111. The acquisition unit 131 also acquires status information indicating the current state of each vehicle 2, which is received by the communication circuit 11 from each vehicle 2, and stores the acquired status information in the vehicle information storage unit 112.

[0070] Furthermore, the acquisition unit 131 acquires the movement history information received by the communication circuit 11 from the administrator terminal 4 and stores the movement history information in the movement history information storage unit 113. Details of this process will be described later.

[0071] Furthermore, the acquisition unit 131 acquires the response intention information received by the communication circuit 11 from the user terminal 3, and stores the response history information based on the response intention information in the response history information storage unit 114. The response intention information is information indicating that there is an intention to fulfill the request indicated by the movement request information. Details of this process will be described later.

[0072] The acquisition unit 131 uses the communication circuit 11 to make various queries to the public server 5 via the network 9. Specifically, the acquisition unit 131 queries the public server 5 to return information indicating the weather corresponding to a specified date and time, and information indicating the date category for a specified day. The acquisition unit 131 uses the communication circuit 11 to acquire the information indicating the weather and the date category that the public server 5 has returned in response to the query.

[0073] The reception unit 132 receives travel request information from a server device of a system that predicts the charging status and demand of multiple vehicles 2 located at multiple locations, via a communication circuit 11.

[0074] Furthermore, if the administrator requests multiple users to move vehicle 2 from one location to another, the administrator may operate the administrator terminal 4 to input movement request information indicating such a request. In this case, once the input operation of the movement request information is completed, the administrator terminal 4 transmits the entered movement request information to the server device 1 via the network 9. This allows the reception unit 132 to receive the movement request information received from the administrator terminal 4 via the communication circuit 11.

[0075] Alternatively, the reception unit 132 may periodically refer to the base information stored in the base information storage unit 111 and automatically generate movement request information indicating that the vehicle 2 should be moved from a base where the number of vehicles indicated by the current vehicle count information is greater than the number of vehicles indicated by the lower limit vehicle count information to a base where the number of vehicles indicated by the current vehicle count information is less than the number of vehicles indicated by the lower limit vehicle count information, thereby accepting the movement request information.

[0076] The identification unit 133 identifies one or more users (hereinafter referred to as target users) who have a history of moving from the departure point of vehicle 2 indicated by the travel request information received by the reception unit 132 to the arrival point of vehicle 2 indicated by the travel request information, based on the travel history information stored in the travel history information storage unit 113.

[0077] Specifically, the identification unit 133 extracts one or more pieces of movement history information from the movement history information stored in the movement history information storage unit 113 that include information indicating the same departure and arrival points as the vehicle 2 indicated by the movement request information. Then, the identification unit 133 identifies the user corresponding to the user identification information contained in each of the extracted pieces of movement history information as the target user.

[0078] The calculation unit 134 calculates the degree of agreement (hereinafter referred to as the matching rate) between the movement history information stored in the movement history information storage unit 113 and the movement request information received by the reception unit 132 for each of the one or more target users identified by the identification unit 133. Details of the process by which the calculation unit 134 calculates the matching rate will be described later.

[0079] The decision unit 135 outputs the price of the reward (hereinafter referred to as the offered price) that will be paid to each target user when the request indicated by the movement request information received by the reception unit 132 is fulfilled, for each of the one or more target users identified by the identification unit 133. Details of the process by which the decision unit 135 outputs the offered price for each target user will be described later.

[0080] The notification unit 136 notifies each of the one or more target users identified by the identification unit 133 of the travel request information received by the reception unit 132 and information indicating the reward for each target user.

[0081] Specifically, the notification unit 136 uses the communication circuit 11 to transmit to the user terminal 3 used by each of the one or more target users identified by the identification unit 133 the travel request information received by the reception unit 132 and information indicating the reward for each target user, including information indicating the offered price for each target user output by the decision unit 135.

[0082] (Process flow for storing movement history information) Next, the details of the process by which the acquisition unit 131 acquires movement history information and stores said movement history information in the movement history information storage unit 113 will be explained using Figure 2. Figure 2 is a flowchart showing an example of the process of storing movement history information.

[0083] When a user travels from a departure point to an arrival point using vehicle 2 and returns vehicle 2 at the arrival point, the administrator operates the administrator terminal 4 to input travel history information showing the history of the user's travel using vehicle 2 from the departure point to the arrival point. Once the input operation of the travel history information is complete, the administrator terminal 4 transmits the entered travel history information to the server device 1 via the network 9. As a result, the acquisition unit 131 acquires the travel history information received by the communication circuit 11 from the administrator terminal 4.

[0084] As shown in Figure 2, when the acquisition unit 131 acquires movement history information, it stores the acquired movement history information in the movement history information storage unit 113 (step S101).

[0085] Next, the acquisition unit 131 determines whether the user has passed through an intermediate point located within a predetermined distance from the vehicle 2 while traveling using the vehicle 2 (step S102).

[0086] Specifically, in step S102, the acquisition unit 131 extracts status information from the vehicle information storage unit 112 that includes identification information of vehicle 2 included in the movement history information acquired in step S101, and current date and time information indicating the date and time of the period from departure date and time to arrival date and time indicated by the movement history information. The acquisition unit 131 determines whether or not base information, which includes information indicating the location of a base as information indicating the location of a base, is stored in the base information storage unit 111.

[0087] If the acquisition unit 131 determines that the location information is stored in the location information storage unit 111, it determines that the user has passed through an intermediate location corresponding to the location information (YES in step S102). An intermediate location corresponding to location information is a location indicated by the identification information contained in the location information.

[0088] In this case, the acquisition unit 131 generates (acquires) movement history information indicating that the user has moved from the departure point indicated by the movement history information acquired in step S101 to the intermediate point that the user determined to have passed through in step S102, and stores the movement history information in the movement history information storage unit 113 (step S103).

[0089] Specifically, in step S103, the acquisition unit 131 generates information by changing the information indicating the arrival base and arrival date and time included in the travel history information acquired in step S101 to information indicating the intermediate base that was determined to have been passed through in step S102 and the date and time of passing through that intermediate base.

[0090] Furthermore, the acquisition unit 131 refers to the status information extracted in step S102, which includes information indicating a location within a predetermined distance from the location of the intermediate base, and uses the current date and time information included in the status information as information indicating the date and time of passing through the intermediate base. However, the acquisition unit 131 is not limited to this, and may also use information indicating a date and time midway between the departure date and time and arrival date and time indicated by the movement history information acquired in step S101 as information indicating the date and time of passing through the intermediate base.

[0091] Next, the acquisition unit 131 generates movement history information indicating that the user has moved from the intermediate point that it determined in step S102 to the arrival point indicated by the movement history information acquired in step S101, and stores this movement history information in the movement history information storage unit 113 (step S104).

[0092] Specifically, in step S104, the acquisition unit 131 generates travel history information in the same manner as in step S103, by changing the information indicating the departure base and departure date and time included in the travel history information acquired in step S101 to information indicating the intermediate base that was determined to have been passed through in step S102 and the date and time that the intermediate base was passed through.

[0093] Step S104 may be omitted. Alternatively, steps S102 to S104 may be omitted.

[0094] (Processing flow performed in the vehicle sharing system 100) Next, Figure 3 will be used to explain the processing performed in the vehicle sharing system 100 when the reception unit 132 receives travel request information. Figure 3 is a flowchart showing an example of the processing performed in the vehicle sharing system 100 when travel request information is acquired.

[0095] As shown in Figure 3, when the reception unit 132 receives the travel request information (step S1), the acquisition unit 131 acquires information related to the travel request information acquired in step S1 (hereinafter referred to as related information) (step S2).

[0096] The related information includes information indicating the weather during the time of travel of vehicle 2 (hereinafter referred to as weather information), information indicating the date category of the day of travel of vehicle 2 (hereinafter referred to as date category information), the month in which vehicle 2 travels, and information indicating the type of vehicle 2 being moved. As described above, the acquisition unit 131 acquires the weather information and date category information from the public server 5. The acquisition unit 131 refers to the vehicle information stored in the vehicle information storage unit 112 and acquires information indicating the type of vehicle 2 being moved.

[0097] Next, the identification unit 133 identifies one or more target users who have a history of moving from the departure point of vehicle 2 indicated by the travel request information obtained in step S1 to the arrival point of vehicle 2 indicated by the travel request information, based on the travel history information stored in the travel history information storage unit 113 (step S3).

[0098] Next, the calculation unit 134 calculates the matching rate for each of the one or more target users identified in step S3 (step S4). The method for calculating the matching rate for each target user in step S4 will be described later.

[0099] Next, the decision unit 135 calculates the standard price of the reward to be paid to the target user who has fulfilled the request indicated by the movement request information obtained in step S1 (step S5). The method for calculating the standard price in step S5 will be described later.

[0100] Next, the calculation unit 134 calculates the response sensitivity for each of the users (multiple users) of the sharing service based on the response history information stored in the response history information storage unit 114 (step S6).

[0101] Response sensitivity indicates the probability, among all users, that each user is willing to fulfill the request indicated by the travel request information obtained in step S1 when they receive notification of the standard price calculated in step S5 as the price of the reward. The method for calculating response sensitivity in step S6 will be described later.

[0102] Alternatively, step S6 may be omitted, and the response sensitivity of all users may be set to the same value, and the processing from step S7 onward may be performed.

[0103] Next, for each of the one or more target users identified in step S3, the decision unit 135 calculates the offered reward price to notify each target user based on the matching rate for each target user calculated in step S4, the standard price calculated in step S5, and the response sensitivity of all users calculated in step S6 (step S7). The method for calculating the offered price for each target user in step S7 will be described later.

[0104] Next, the notification unit 136 notifies each of the one or more target users identified in step S3 of the travel request information obtained in step S1 and information indicating the compensation for each target user, including information indicating the offered price for each target user calculated in step S7 (step S8).

[0105] Next, the acquisition unit 131 stores in the response history information storage unit 114, for each of the one or more target users identified in step S3, response history information indicating the response of each target user when they received the movement request information and reward information notified in step S8 (step S9).

[0106] Specifically, when the target user receives the travel request information and information indicating the reward notified in step S8, if they intend to fulfill the request indicated in the travel request information, they perform a predetermined operation on the user terminal 3 to indicate that they intend to do so. Once this predetermined operation is performed, the user terminal 3 transmits response information indicating that they intend to do so to the server device 1.

[0107] In step S9, if the communication circuit 11 receives response intention information from a target user's user terminal 3 by the time of travel indicated by the travel request information entered in step S1, the acquisition unit 131 acquires the response intention information. The acquisition unit 131 then generates response history information that includes the target user's identification information, the travel request information and reward information notified to the target user in step S8, and the acquired response intention information as response result information, and stores the generated response history information in the response history information storage unit 114.

[0108] On the other hand, in step S9, if the acquisition unit 131 does not receive response intention information from the user terminal 3 of the target user where the communication circuit 11 is located by the time of travel indicated by the travel request information entered in step S1, it generates response result information indicating that the user does not intend to fulfill the request indicated by the travel request information. The acquisition unit 131 then generates response history information including the identification information of the target user, the travel request information and information indicating the reward notified to the target user in step S8, and the generated response result information, and stores the generated response history information in the response history information storage unit 114.

[0109] (Method for calculating the matching rate) Next, we will explain how to calculate the matching rate for each target user in step S4 (Figure 3). In the following, we will explain how to calculate the matching rate for each target user, assuming that n pieces of movement history information are stored for each target user in the movement history information storage unit 113. The calculation unit 134 calculates the matching rate for each target user by determining how high the degree of agreement between the comparison parameter (vehicle movement details) based on the n pieces of movement history information for each target user and the comparison parameter based on the movement request information acquired in step S1 is among one or more target users.

[0110] Specifically, the calculation unit 134 first calculates the degree of discrepancy between comparison parameters based on n travel history information for each target user and comparison parameters based on travel request information obtained in step S1. The comparison parameters include the time period used by vehicle 2, the departure point, and the arrival point. Hereafter, the time period used by vehicle 2 will be referred to as the first comparison parameter, the departure point of vehicle 2 as the second comparison parameter, and the arrival point of vehicle 2 as the third comparison parameter.

[0111] Specifically, the calculation unit 134 uses the following formula (1) to determine the target user U q For each of the n movement history information items, the jth comparison parameter P is based on the kth movement history information item. jk and the jth comparison parameter P based on the movement request information jdCalculate the difference from it, and calculate the average value as the deviation degree A jq Calculate it as such.

Number

[0112] For example, the calculation unit 134 uses the time at the intermediate point from the departure date and time of the vehicle 2 indicated by the k-th movement history information of the target user U q to the arrival date and time of the vehicle 2 indicated by the k-th movement history information as the first comparison parameter P 1k based on the k-th movement history information, and substitutes it into P on the right side of Equation (1). The calculation unit 134 uses the time at the intermediate point of the movement time zone indicated by the movement request information as the first comparison parameter P jk based on the movement request information, and substitutes it into P on the right side of Equation (1). 1d jd Substitute it into P on the right side of Equation (1).

[0113] For example, assume that the departure date and time of the vehicle 2 indicated by the k-th movement history information of the target user U q is "23:50 on June 1, 2021", and the arrival date and time of the vehicle 2 is "0:50 on June 2, 2021". Also assume that the movement time zone indicated by the movement request information is "from 23:00 on June 15, 2021 to 0:00 on June 16, 2021".

[0114] In this case, the calculation unit 134 uses the time "0:20" at the intermediate point from the departure date and time to the arrival date and time as the first comparison parameter P 1k based on the k-th movement history information, and substitutes it into P on the right side of Equation (1). The calculation unit 134 uses the time "23:30" at the intermediate point of the movement time zone included in the movement request information as the first comparison parameter P jk based on the movement request information, and substitutes it into P on the right side of Equation (1). Therefore, in this case, the difference between the j-th comparison parameter P 1d based on the k-th movement history information and the j-th comparison parameter P jd based on the movement request information is "50 minutes (=0:20 - 23:30)". j j

[0115] ​​​ As a result, the calculation unit 134 calculates the target user U q The degree of deviation A between the first comparison parameter P1 (usage time of vehicle 2) based on n travel history information and the first comparison parameter P1 based on travel request information. 1q Calculate the following for the target user U. q The jth comparison parameter P based on n movement history information. j and the jth comparison parameter P based on the movement request information j Degree of deviation A jq The target user U q The jth comparison parameter P j Degree of deviation A jq This is abbreviated as follows.

[0116] Furthermore, the information indicating the travel time included in the travel request information may include only the departure date and time of vehicle 2, and not the arrival date and time of vehicle 2 (in this example, "June 15, 2021, 23:00"). In this case, the calculation unit 134 refers to the vehicle information stored in the vehicle information storage unit 112 and the base information stored in the base information storage unit 111 to determine the travel speed of vehicle 2 of the vehicle type indicated in the travel request information and the distance from the departure base to the arrival base indicated in the travel request information, and calculates the time required to move vehicle 2 according to the request indicated in the travel request information. Then, the calculation unit 134 calculates the arrival date and time of vehicle 2 to be the date and time that is after the calculated time from the departure date and time of vehicle 2.

[0117] Alternatively, if the travel request information includes only the departure date and time of vehicle 2, then P in formula (1) jdThe time to be substituted may be the departure date and time of the vehicle 2. In this case, the calculation unit 134 may, as described above, calculate the time required for the vehicle 2 of the type indicated in the k-th movement history information to travel from the departure base to the arrival base included in the k-th movement history information (hereinafter referred to as travel time) based on the vehicle information stored in the vehicle information storage unit 112 and the base information stored in the base information storage unit 111. Then, the calculation unit 134 puts a time (for example, 9:30) that is 30 minutes earlier than the departure date and time of the vehicle 2 included in the k-th movement history information (for example, 10:00 on June 1, 2021) into P in equation (1). jk You can substitute it.

[0118] Similarly, the calculation unit 134 calculates the departure point of vehicle 2 included in the k-th movement history information as P on the right side of equation (1). jk Substitute this into the equation, and the departure point of vehicle 2 included in the travel request information is P on the right side of equation (1). jd Substitute this into the target user U q The degree of deviation A of the second comparison parameter P2 (the departure point of vehicle 2) 2q The calculation unit 134 uses formula (1) to calculate the target user U. q The degree of deviation A of the third comparison parameter P3 (arrival point of vehicle 2) 3q Calculate.

[0119] Similarly, the calculation unit 134 calculates for each of the one or more target users identified in step S3 (Figure 3) for each target user U q The degree of deviation A of the first to third comparison parameters P1 to P3. 1q ~A 3q Calculate.

[0120] Next, the calculation unit 134 calculates for each target user U q The jth comparison parameter P j Degree of deviation A jq Using this, each target user U q The jth comparison parameter P based on n movement history information. j and the jth comparison parameter P based on the movement request information jRelative match score D indicates how high the degree of match is compared to the matching degree of all target users. jq The relative agreement degree D is calculated. jq to each target user U q The jth comparison parameter P j Relative agreement degree D jq This is abbreviated as follows.

[0121] Specifically, the calculation unit 134 calculates each target user U using the above formula (1). q The jth comparison parameter P j Degree of deviation A jq Using the following formula (2) which includes, each target user U q The jth comparison parameter P j Relative agreement degree D jq Calculate.

number

[0122] In equation (2), A j_min This is the jth comparison parameter P for all target users. j Degree of deviation A jq This shows the minimum value among them. A j_max This is the jth comparison parameter P for all target users. j Degree of deviation A jq This shows the maximum value among them. In other words, according to equation (2), the target user U q The jth comparison parameter P j Degree of deviation A jq The smaller the value, the more likely the target user U q The jth comparison parameter P j Relative agreement degree D jq It becomes larger. Therefore, among all target users, the jth comparison parameter P j Degree of deviation A jq The minimum value is A j_min The target user U q The jth comparison parameter P j Relative agreement degree D jq This becomes 100%.

[0123] Furthermore, the calculation unit 134 calculates the jth comparison parameter P for all target users. j Degree of deviation A jq The average value of the jth comparison parameter P j Average deviation A j_ave It may also be calculated as follows. In this case, the calculation unit 134 calculates the j-th comparison parameter P j Degree of deviation A jq However, the comparison parameter P of the jth order j Average deviation A j_ave Larger target users U q These users may be excluded from the target users in the processing from step S5 onward.

[0124] In this way, the calculation unit 134 calculates for each target user U for all target users. q The relative agreement D of the first to third comparison parameters P1 to P3. 1q ~D 3q Calculate.

[0125] Next, the calculation unit 134 uses the relevant information included in the movement history information and the relevant information related to the movement request information obtained in step S2 (Figure 2) as comparison parameters, and uses the following formula (3) to calculate each target user U q The jth comparison parameter P j Relative agreement degree D jq Calculate.

[0126] The related information includes, as mentioned above, information indicating the weather during the time of vehicle 2's travel (weather at the time of vehicle movement), the date of vehicle 2's travel, the month of vehicle 2's travel, and the type of vehicle 2. Hereafter, the weather during the time of vehicle 2's travel will be referred to as the fourth comparison parameter P4, the date of vehicle 2's travel as the fifth comparison parameter P5, the month of vehicle 2's travel as the sixth comparison parameter P6, and the type of vehicle 2 as the seventh comparison parameter P7.

[0127]

number

[0128] In Equation (3), B j_max represents the maximum value among the degrees of coincidence B j of the j-th comparison parameter P jq for all target users, and B j_min represents the minimum value among the degrees of coincidence B j of the j-th comparison parameter P jq for all target users. That is, according to Equation (3), the larger the degree of coincidence B q of the j-th comparison parameter P j for the target user U jq , the larger the relative degree of coincidence D q of the j-th comparison parameter P j for the target user U jq . Therefore, among all target users, the relative degree of coincidence D j of the j-th comparison parameter P jq with the maximum degree of coincidence B j_max for the target user U q is 100%. j jq j jq

[0129] In addition, the calculation unit 134 may further calculate the average value of the degrees of coincidence B j of the j-th comparison parameter P jq for all target users as the average degree of coincidence B j of the j-th comparison parameter P j_ave . In this case, the calculation unit 134 calculates the degree of coincidence B j of the j-th comparison parameter P jqHowever, the comparison parameter P of the jth order j Average degree of agreement B j_ave Target users U smaller than q These users may be excluded from the target users in the processing from step S5 onward.

[0130] For example, the calculation unit 134 calculates for each target user U q The relative agreement D of the fourth comparison parameter P4 4q When calculating, target user U q Of the n pieces of movement history information, we refer to the movement history information stored in the previous month (hereinafter referred to as the previous month's movement history information).

[0131] The calculation unit 134 calculates the number of travel history entries from the previous month in which the weather at the departure date or arrival date matches the weather during the travel time of vehicle 2 as indicated by the related information obtained in step S2, for each target user U q The degree of agreement B of the fourth comparison parameter P4 (weather) 4q The calculation is performed as follows. Similarly, the calculation unit 134 calculates for all target users, for each target user U q The fourth comparison parameter P4 is the degree of agreement B. 4q Calculate.

[0132] The calculation unit 134 calculates for each target user U q The fourth comparison parameter P4 is the degree of agreement B. 4q B on the right side of equation (3) jq Substitute this value. The calculation unit 134 calculates the degree of agreement B of the fourth comparison parameter P4 for all target users. 4q The minimum value among them is B 4_min Let B be the right-hand side of equation (3). j_min The values ​​are then substituted. The calculation unit 134 calculates the degree of agreement B of the fourth comparison parameter P4 for all target users. jq The maximum value among them is B 4_max Let B be the right-hand side of equation (3). j_max The values ​​are then substituted. The calculation unit 134 uses the equation (3) after these substitutions to determine the value for each target user U q The relative agreement D of the fourth comparison parameter P4 4q Calculate.

[0133] Similarly, the calculation unit 134 calculates for each target user U q Relative agreement D of the 5th to 7th comparison parameters P5 to P7 5q ~D 7q Calculate.

[0134] Furthermore, the calculation unit 134 calculates for each target user U q The relative agreement D of the fifth comparison parameter P5 5q When calculating this, the number of travel history entries from the previous month in which the date category of the travel date for vehicle 2 matches the date category of the travel date for vehicle 2 indicated in the related information is used for each target user U. q The degree of agreement B of the fifth comparison parameter P5 (date category) 5q It is calculated as follows.

[0135] The calculation unit 134 calculates for each target user U q The sixth comparison parameter P6 has a relative agreement degree D. 6q When calculating, target user U q Of the n pieces of movement history information, the movement history information for the most recent year is referenced. The calculation unit 134 calculates the number of movement history information pieces from the movement history information for the most recent year in which the month of movement of vehicle 2 matches the month of movement of vehicle 2 indicated in the related information, for each target user U q The degree of agreement B for the sixth comparison parameter P6 (month) 6q It is calculated as follows.

[0136] The calculation unit 134 calculates for each target user U q The seventh comparison parameter P7 has a relative agreement degree D. 7q When calculating this, the number of travel history entries from the previous month in which the vehicle type of Vehicle 2 matches the vehicle type of Vehicle 2 indicated in the related information is used for each target user U. q The seventh comparison parameter, P7 (vehicle type), has a degree of agreement B. 7q It is calculated as follows.

[0137] Then, the calculation unit 134 calculates each target user U as shown in the following formula (4). q The relative agreement D of the 1st to 7th comparison parameters P1 to P7 1q ~D 7qThe weighted average value is calculated for each target user U. q Matching rate M q It is calculated as follows.

number

[0138] In equation (4), W1 to W7 are the relative degree of agreement D 1q ~D 7q These are the weight coefficients. The weight coefficients W1 to W7 are set to any value greater than or equal to 0 such that at least one of the weight coefficients W1 to W7 is greater than 0. For example, the first to third weight coefficients W1 to W3 may be set to a value greater than 0, and the fourth to seventh weight coefficients W4 to W7 may be set to 0. Alternatively, the first to third weight coefficients W1 to W3 may be set to a value greater than 0, and at least one of the fourth to seventh weight coefficients W4 to W7 may be set to a value greater than 0, while the other weight coefficients of the fourth to seventh weight coefficients W4 to W7 may be set to 0.

[0139] (Standard price calculation method) Next, we will explain how to calculate the standard price of the reward to be paid to the target user who has fulfilled the request indicated by the movement request information in step S5 (Figure 3).

[0140] Specifically, the decision unit 135 determines the standard price using information indicating the vehicle type, departure point, and arrival point of the vehicle 2 included in the travel request information, and a price calculation table. The price calculation table is a table that associates the vehicle type of the vehicle 2 with the price of the reward that the user will pay when the vehicle 2 of that type is moved for a predetermined unit distance, and is pre-stored in memory 10.

[0141] In step S5, the determination unit 135 refers to the price calculation table stored in memory 10 and obtains the price of the reward associated with the vehicle type 2 indicated by the travel request information. Based on the base information stored in base information storage unit 111, the determination unit 135 calculates the distance from the departure base to the arrival base indicated by the travel request information. The determination unit 135 determines the product of the obtained reward price and the distance from the departure base to the arrival base as the standard price.

[0142] Furthermore, the decision unit 135 may adjust the standard price according to the travel time period indicated by the travel request information, the weather during the travel time period of vehicle 2, the date category of the travel day of vehicle 2, the month in which vehicle 2 travels, and the type of vehicle 2 being moved, as indicated by the related information obtained in step S2.

[0143] For example, a day is divided into 24 time zones of one hour each, and an adjustment coefficient (hereinafter referred to as the first adjustment coefficient) is predetermined for each time zone within a specified range (e.g., 0.1 to 3.0). Similarly, an adjustment coefficient (hereinafter referred to as the second price adjustment coefficient) is predetermined for each weather condition: sunny, rainy, cloudy, and other. In the same manner, an adjustment coefficient (hereinafter referred to as the third price adjustment coefficient) is predetermined for each of the eight date categories within a specified range, an adjustment coefficient (hereinafter referred to as the fourth adjustment coefficient) is predetermined for each month from January to December within a specified range, and an adjustment coefficient (hereinafter referred to as the fifth adjustment coefficient) is predetermined for each vehicle type within a specified range. Note that the predetermined ranges may differ for each adjustment coefficient, or they may be the same range across multiple adjustment coefficients.

[0144] The determination unit 135 may then adjust the standard price by multiplying the calculated standard price by at least one of the first to fifth adjustment coefficients.

[0145] (Method for calculating reaction sensitivity) Next, we will explain how to calculate the response sensitivity for each of the users of the sharing service in step S6 (Figure 3).

[0146] First, the calculation unit 134 refers to the reaction history information of each user stored in the reaction history information storage unit 114, which includes reaction result information indicating that the user intends to fulfill the request indicated by the movement request information (hereinafter referred to as "target reaction history information"). In the following explanation, the calculation unit 134 will refer to m pieces of target reaction history information.

[0147] The calculation unit 134 calculates the degree of discrepancy between the standard price calculated in step S5 (Figure 3) and the offered price indicated by the m target response history information for each user. Specifically, the calculation unit 134 uses the following formula (5) to calculate the degree of discrepancy for each user U q For each of the m target reaction history information items, the standard price V calculated in step S5 (Figure 3) d and the offered price V included in the target response history information for the kth item k The difference is calculated, and the average value is the deviation degree C. q It is calculated as follows.

number

[0148] Subsequently, the standard price V calculated in step S5 d and user U q The degree of deviation C from the offered price included in the m target response history information. q to, User U q Degree of deviation C from the reaction price q It is stated as follows. Similarly, the calculation unit 134 calculates for all users, for each user U q Degree of deviation C from the reaction price q Calculate.

[0149] Next, the calculation unit 134 calculates for all users, for each user U q Degree of deviation C from the reaction price q Using the following formula (6) which includes, each user U q Response sensitivity R q Calculate.

number

[0150] In equation (6), C min This is the degree of deviation C from the reaction price of all users. q This shows the minimum value among them. C max This is the degree of deviation C from the reaction price of all users. q This shows the maximum value among them. In other words, according to equation (6), user U q Degree of deviation C from the reaction price q The larger the value, the greater the user U q Response sensitivity R q It will get bigger.

[0151] Furthermore, the calculation unit 134 calculates the degree of deviation C of the reaction prices of all users. q The average value (hereafter, the average deviation of the reaction price) C ave The calculation unit 134 may calculate the degree of deviation C of the reaction price. q The average deviation of the reaction price C ave Smaller users U q However, if the target user is identified in step S3 (Figure 3), then the user U q These users may be excluded from the target users in the processing from step S7 (Figure 3) onward.

[0152] (Method for calculating the asking price) Next, in step S7 (Figure 3), each target user U q This section explains how the quoted price is calculated.

[0153] Matching rate M q The response sensitivity R is 50% and q For target users where 50% are eligible, the standard price V calculated in step S5 (Figure 3) d Suppose information indicating the price is notified. In this case, it is assumed that the target user who receives the notification will indicate their intention to fulfill the request indicated by the movement request information with a probability shown by the average response sensitivity of all users calculated in step S6 (Figure 3).

[0154] Under the above assumption, as shown in equation (7) below, each target user U qHowever, the probability that the user intends to fulfill the request indicated by the movement request information (hereafter, for each target user U) q (Response rate) E q This is the average value R of the response sensitivity of all users calculated in step S6. ave It can be expressed as the product of a factor greater than 0 and an adjustment factor γ.

number

[0155] Meanwhile, each target user U q Response rate E q This is the number of target users U calculated in step S4 (Figure 3). q Matching rate M q And each target user U calculated in step S5 (Figure 3) q Response sensitivity R q And when the request indicated by the movement request information is fulfilled, each target user U q The offered price for compensation to be paid is expected to fluctuate depending on the circumstances.

[0156] Therefore, each target user U q Response rate E q As shown in equation (8) below, each target user U q Matching rate M q and reaction sensitivity R q The weighted average value and each target user U q Standard price V applicable to d Discount rate F q It can also be expressed as the product of and . From here on, for each target user U q Standard price V applicable to d Discount rate F q to each target user U q Discount rate F q This is abbreviated as follows.

number

[0157] Equations (7) and (8) both represent each target user U q Response rate E q This is an equation that shows that. Therefore, by substituting the right-hand side of equation (7) into the left-hand side of equation (8) and transforming the resulting equation, each target user U q Discount rate F q The following formula (9) is obtained for calculating the following. Therefore, in step S7 (Figure 3), the determination unit 135 determines each target user U q Discount rate F q This is calculated using the following formula (9).

number

[0158] Furthermore, in step S7 (Figure 3), the decision unit 135 calculates the response rate E of all target users using equation (7) under the above assumption. q The sum of these values ​​represents the desired response rate E indicated by the movement request information obtained in step S1 (Figure 3). d The standard price V is applied to all target users using the following formula (10) so that it is equal to the standard price V. d Discount rate F all Calculate the standard price V which will be applied to all target users thereafter. d Discount rate F all The discount rate F applies to all eligible users. all This is abbreviated as follows.

number

[0159] Then, in step S7 (Figure 3), the determination unit 135 determines the standard price V calculated in step S5 (Figure 3) as shown in formula (11) below. d And, each target user U calculated using equation (9) q Discount rate F qAnd the discount rate F for all target users calculated using equation (10) all The product of and is calculated for each target user U q The asking price I q It is calculated as follows.

number

[0160] Furthermore, in step S7 (Figure 3), the decision unit 135 calculates the response rate E of all target users using equation (7) under the above assumption, as shown in equation (12) below. q And the discount rate F calculated using equation (10) all The product of this is calculated for each target user U. q Response rate E q Recalculate based on this.

number

[0161] In other words, according to equation (9), the matching rate M q High response sensitivity R q High target user U q The more so, the more the target user U q Discount rate F q This is calculated to be low. As a result, according to equation (11), the matching rate M q High response sensitivity R q High target user U q The lower the asking price I q This is calculated.

[0162] Therefore, target user U has a high probability of showing an intention to fulfill the requests indicated by the travel request information, and whose travel history is similar to that of vehicle 2 based on the travel request information. q In contrast, the lower asking price I q Information indicating this can be notified. As a result, the price of the reward can be reduced, and the completion rate of requests to move vehicle 2 can be improved at a low cost.

[0163] On the other hand, according to equation (9), the matching rate M q Low response sensitivity R q Low target user U q The more so, the more the target user U q Discount rate F q This is calculated to be high. As a result, the matching rate M is calculated by equation (11). q Low response sensitivity R q Low target user U q The higher the asking price, the higher the asking price. q This is calculated.

[0164] Therefore, target user U has few travel histories that closely match the travel details of vehicle 2 based on the travel request information, and has a low probability of indicating an intention to fulfill the request indicated by the travel request information. q In contrast, the high asking price I q Information indicating this can be notified. This means that even if a user receives travel request information indicating a request to move vehicle 2 along a route that they do not normally travel, they can still receive a high quoted price I q The prospect of receiving a reward can increase the motivation to fulfill the request. As a result, the success rate of the request to move vehicle 2 can be improved.

[0165] (Second Embodiment) The following describes a second embodiment of this disclosure. In the first embodiment, an example was described in which a quoted price is calculated individually for each of the one or more target users who have a history of traveling from the departure point of vehicle 2 indicated by the travel request information to the arrival point of vehicle 2 indicated by the travel request information, and each target user is notified of the travel request information and information indicating the reward of the quoted price.

[0166] In the second embodiment, the price of the reward for the request indicated by the travel request information is determined by a so-called auction. In other words, in the second embodiment, a provisional price is notified to one or more target users as the price of the reward, and the target user who shows willingness to fulfill the request indicated by the travel request information for the lowest price reward is asked to move vehicle 2 indicated by the travel request information for that lowest price reward.

[0167] Specifically, in step S7 (Figure 3), the determination unit 135 uses the above formula (11) to determine each target user U q The offered price I q Instead of calculating the following, use formula (13) below to determine each target user U q The provisional price of the compensation to be paid I all Calculate.

number

[0168] Then, in step S8 (Figure 3), the notification unit 136 sends to each of the one or more target users identified in step S3 (Figure 3) the travel request information obtained in step S1 (Figure 3) and the provisional price I determined in step S7. all Information indicating the reward and auction information including will be notified. Note that a provisional price I all The information indicating the reward includes, as information indicating the price of the reward, a provisional price I all It contains information indicating this.

[0169] Specifically, auction information is based on a provisional price I all This information announces that an auction will be held for a certain period of time, in which the user who submits the lowest bid will be determined as the user requesting the movement of Vehicle 2, as indicated in the movement request information. The "certain period" can be shorter than the time between the notification of the auction and the movement time indicated in the movement request information.

[0170] Within a certain period following the notification of auction information by the notification unit 136, the communication circuit 11 receives a provisional price I from a predetermined number of users or more. all Suppose information has been received indicating that the request indicated by the request information for movement will be accepted at the following price. The predetermined number can be 1 or more. In this case, the notification unit 136 will receive the provisional price I from the communication circuit 11. all The lowest price among the following will be determined as the reward paid to the user when the request indicated by the movement request information is fulfilled.

[0171] Then, the notification unit 136 notifies the user who has transmitted information indicating that the request indicated by the movement request information is accepted at the lowest price, of the movement request information and the information indicating the reward at the lowest price. Note that the information indicating the reward at the lowest price includes the information indicating the lowest price as the information indicating the price of the reward.

[0172] As described above, in the configuration of the second embodiment, the provisional price I all The movement request information and the information indicating the reward at the lowest price are notified to the user who has transmitted information indicating that the request indicated by the movement request information is accepted at the lowest price as follows. For this reason, the movement of the vehicle 2 indicated by the movement request information can be achieved at low cost.

[0173] Note that in step S8 (FIG. 3), the notification unit 136 may notify the auction holding information only to a user among the one or more target users whose reaction rate, matching rate, or reaction sensitivity is equal to or higher than a predetermined value. In this case, it is possible to avoid transmitting auction information to a user whose reaction rate, matching rate, and reaction sensitivity are all less than the predetermined value and who is predicted to have no intention of achieving the request indicated by the movement request information.

[0174] Further, the present disclosure may arbitrarily combine the above-described first embodiment and second embodiment.

Industrial Applicability

[0175] According to the present disclosure, since the achievement rate of the vehicle movement work to another base can be improved at low cost, it is useful in providing a sharing service in which a plurality of vehicles arranged at a plurality of bases are shared by a plurality of users.

Claims

1. A control method for a system in which multiple vehicles located at multiple locations are shared by multiple users, Computers First information is obtained showing the history of how the multiple users traveled between locations using the multiple vehicles. We received a second piece of information indicating a request to move a vehicle from one location to another. A matching rate is calculated that indicates the degree of agreement between the first information and the second information for each user. The price of the reward to be paid to each user when the request indicated by the second piece of information is fulfilled is calculated according to the matching rate. Output the price of the aforementioned reward, The second information and information indicating the reward for each user are notified. Control method.

2. Furthermore, based on the first information, one or more users who have a history of moving from one location to another location are identified. Furthermore, for each of the one or more users, the degree to which the vehicle movement details by each user based on the first information match the vehicle movement details based on the second information is determined as the matching rate among the one or more users. In the aforementioned notice, To each of the one or more users mentioned above, the second information and the information indicating each user's reward are notified. The control method according to claim 1.

3. The price of the aforementioned reward will be lower the higher the matching rate. The control method according to claim 2.

4. The aforementioned notice provides a provisional price for the aforementioned remuneration. Furthermore, if, within a certain period following the notification, information is received from a predetermined number of users indicating that they will accept the request indicated in the second information at a price equal to or lower than the provisional price, the lowest price among the received prices equal to or lower than the provisional price will be determined as the price of the reward, and the user who sent the information indicating that they will accept the request indicated in the second information at the lowest price will be notified of the second information and the information indicating the reward. The control method according to claim 2.

5. Furthermore, the multiple users acquire third information indicating their reactions when they receive notification of the second information and the information indicating each user's reward. Furthermore, for each of the multiple users, based on the third information, a response sensitivity is calculated that indicates how high the probability is among the multiple users that each user is willing to fulfill the request indicated by the second information when they receive notification of a predetermined standard price as the price of the reward. Furthermore, for each of the aforementioned users, a response rate is calculated based on the matching rate and the response sensitivity, which is the probability that the user is expected to have the intention to fulfill the request indicated by the second information. In the aforementioned notice, Among the one or more users, the second information and the information indicating the reward are notified to the user whose response rate, matching rate, or response sensitivity is equal to or greater than a predetermined value. The control method according to claim 4.

6. Furthermore, the multiple users acquire third information indicating their reactions when they receive notification of the second information and the information indicating each user's reward. Furthermore, for each of the multiple users, based on the third information, a response sensitivity is calculated that indicates how high the probability is among the multiple users that each user is willing to fulfill the request indicated by the second information when they receive notification of a predetermined standard price as the price of the reward. In the output of the reward price, Furthermore, the price of the aforementioned reward is determined to be lower the higher each user's response sensitivity is. The control method according to claim 1.

7. In obtaining the first information, If a user passes through an intermediate base located within a predetermined distance from the vehicle while traveling from one base to another base using the vehicle, the first information obtained includes information indicating that the user traveled from one base to the other base using the vehicle, and information indicating that the user traveled from one base to the intermediate base using the vehicle. The control method according to claim 1.

8. In obtaining the first information, If a user passes through an intermediate point located within a predetermined distance from the vehicle while traveling from one point to another point using the vehicle, then information indicating that the user traveled from the intermediate point to the other point using the vehicle is acquired as the first information. The control method according to claim 7.

9. The first information includes information indicating the departure point and departure date and time of the vehicle used by the multiple users for travel, and information indicating the arrival point and arrival date and time of the vehicle used by the multiple users for travel. The aforementioned second information further includes information indicating the time period during which the vehicle is moved. The details of the vehicle's movement include the time of use, departure point, and arrival point. The control method according to any one of claims 1 to 8.

10. The details of the vehicle's movement further include at least one of the following: the weather at the time of the vehicle's movement, the date category of the day the vehicle moved, the month in which the vehicle moved, and the type of vehicle. The aforementioned date classification is information indicating which of the seven days of the week, from Sunday to Saturday, or a public holiday, the date falls on. The control method according to claim 9.

11. A computer in a system that allows multiple users to share multiple vehicles located at multiple locations, An acquisition unit that acquires first information showing the history of how the multiple users have traveled between locations using the multiple vehicles, A reception desk that receives second information indicating a request to move a vehicle from one location to another, A calculation unit that calculates a matching rate indicating the degree of agreement between the first information and the second information for each user, A determination unit calculates the price of the reward to be paid to each user when the request indicated by the second information is fulfilled, according to the matching rate, and outputs the price of the reward. A notification unit that notifies the user of the second information and the information indicating the reward for each user. A program that makes it function as such.

12. A server device in a system that allows multiple users to share multiple vehicles located at multiple locations, An acquisition unit that acquires first information showing the history of how the multiple users have traveled between locations using the multiple vehicles, A reception desk that receives second information indicating a request to move a vehicle from one location to another, A calculation unit that calculates a matching rate indicating the degree of agreement between the first information and the second information for each user, A determination unit calculates the price of the reward to be paid to each user when the request indicated by the second information is fulfilled, according to the matching rate, and outputs the price of the reward. A notification unit that notifies the user of the second information and the information indicating the reward for each user, A server device equipped with the following features.

Images