JP2021162900A - Share riding support system - Google Patents

Abstract

To provide a share riding support system capable of easily extracting combinations that match users' wishes in the share riding system.SOLUTION: A share riding support system 1 for determining a group of users who use the same vehicle by combining a plurality of users includes: a terminal 2 capable of accepting usage application information from the user; and a host server 4 that is connected to the terminal via a network 3 and can acquire the usage application information. An operation schedule creation unit 24 of the host server includes: link means 24A that associates users who preferentially ride on the same vehicle; pattern acquisition means 24B that acquires a pattern of the combination of a group of users who should share the vehicle based on the association; evaluation means 24C that obtains an evaluation value of each pattern of group combinations based on a predetermined evaluation function; and determination means 24D that determines the combination of share riding group to be executed based on the evaluation value.SELECTED DRAWING: Figure 1

Description

The present invention relates to a ride support system that provides a ride sharing service to a user.

A computer system that links a user who wants to ride and an available driver is known throughout a predetermined area (for example, the San Francisco Bay Area) (for example, Patent Document 1). In Patent Document 1, a service request is received from a user, an available nearby driver is identified, and an invitation message is sent to a device owned by the driver. The computer system filters available drivers based on the service start location and service start time included in the service request to prevent the invitation message from being sent to drivers that are too far away to reach the service start time.

An information processing device that presents an appropriate movement route and movement means according to a movement plan of a plurality of users is known (for example, Patent Document 2). The information processing device of Patent Document 2 has a predetermined objective function (evaluation function) based on a combination of information on a user's position and information on a user's destination, information on each position of a plurality of vehicles, and road network data. ) Is optimized after satisfying a predetermined constraint condition, and an appropriate movement route and movement means are calculated for each of a plurality of users.

U.S. Patent Application Publication No. 2018/0232841 Japanese Unexamined Patent Publication No. 2017-142177

In services such as car sharing and ride sharing, scheduling is performed by extracting the most suitable combination as much as possible based on the route to the destination, usage time, etc. from all combinations of users who wish to use it. It is required to do. However, as the number of users increases, the number of combinations becomes enormous, and it is not easy to extract the optimum combination.

In view of the above background, it is an object of the present invention to facilitate the extraction of combinations that meet the user's wishes in the riding support system.

In order to solve the above problems, one aspect of the present invention is a riding support system (1) for determining a group of the users who use the same vehicle by combining a plurality of users, and is used by the users. It has a terminal (2) capable of accepting application information and a server (4) connected to the terminal via a network (3) and capable of acquiring the usage application information, and the server preferentially rides on board. The link means (24A) for associating the user, the pattern acquisition means (24B) for acquiring the pattern of the combination of the group of the users who should share the vehicle based on the association, and the predetermined evaluation function. Based on the above, the evaluation means (24C) for obtaining the evaluation value of each of the patterns of the combination of the groups and the determination means (24D) for determining the combination of the riding groups to be executed based on the evaluation value are provided. It is a feature.

According to this configuration, the pattern of the combination of groups is acquired based on the association of the passengers on board, and the combination of the combination groups to be executed is based on the evaluation function obtained for each of the acquired patterns. It is determined. It is possible to prevent the acquisition of a pattern including a group in which users who are not suitable for performing the ride even if they ride together are combined. Therefore, since the number of groups for which the evaluation function should be calculated can be reduced, it becomes easy to determine the combination of the riding groups to be executed.

In the above aspect, the utilization request information includes the time _{(S A,} S _B) which the user wishes to use, the link means on the basis of the time, may perform the association.

According to this configuration, it is possible to easily prevent the acquisition of a pattern including a group in which users who wish to use the riding are combined and are not suitable for performing the riding.

In the above aspect, the riding support system is used for all the users to go to one destination, and the direction of the departure point ( _{VA) in which the link means desires to start using the user from the destination.} , V _B ), the association may be made.

According to this configuration, it is possible to easily prevent the acquisition of a pattern including a group in which users who have significantly different orientations of the riding use start points as viewed from the destination are combined and are not suitable for performing the riding.

In the above aspect, the association may be made based on _{the distance (DAB} ) between the departure points where the link means wants the user to start using.

According to this configuration, it is possible to easily prevent the acquisition of a pattern including a group in which users whose departure points are far apart are not suitable for performing a combined ride.

In the above aspect, the linking means may make the association based on the user's intention.

According to this configuration, it is possible to easily prevent the acquisition of a pattern including a group in which unoriented users are not suitable for performing a combined ride.

In the above aspect, the utilization request information includes the time _{(S A,} S _B) which the user wishes to use, the riding together support system can be utilized for all of the user toward the one of the destination, said link means the time, the orientation of the departure point to the desired start use of the user from the destination _{(V a,} V _B), the distance between the departure point (D _AB), and, of oriented of the user The association may be made based on any two of them.

According to this configuration, the number of patterns to be acquired is reduced because more groups that are not suitable for performing the multiplication are eliminated. As a result, the number of evaluation functions to be calculated is reduced, and it becomes easy to determine the combination of riding groups to be executed.

In the above aspect, it is a shared support system (1) for determining a group of the users who use the same vehicle by combining a plurality of users, and is a terminal (2) capable of receiving usage application information from the users. ) And the server (4) which is connected to the terminal via the network (3) and can acquire the usage application information, and the server associates the user whose riding should be preferentially excluded. Based on the pattern acquisition means (24B), which includes the link means (24A) to be performed, and acquires the pattern of the combination of the group of the users who should share the vehicle based on the association, and the predetermined evaluation function. It is characterized by having an evaluation means (24C) for obtaining an evaluation value of each of the patterns of a combination of groups, and a determination means (24D) for determining a combination of riding groups to be executed based on the evaluation value.

According to this configuration, the pattern of the combination of the groups is acquired based on the association of the users who should not be riding, and the combination group to be executed is based on the evaluation function obtained for each of the acquired patterns. The combination is decided. As a result, it is possible to prevent the acquisition of a pattern including a group in which users who should not be on board are combined. Therefore, since the number of groups for which the evaluation function should be calculated can be reduced, it becomes easy to determine the combination of the riding groups to be executed.

According to the above configuration, it is possible to easily extract a combination that suits the user's wishes in the riding support system.

Configuration diagram of the shared support system in the first embodiment Flowchart showing the procedure of riding support processing Flowchart showing the procedure of operation schedule creation process Diagram showing the link information table Flowchart showing the procedure of tree creation process A diagram showing a tree structure with (A) user A and (B) user B as the root. Flow chart showing the procedure of the determination process according to the first embodiment Flow chart showing the procedure of the determination process according to the second embodiment Explanatory drawing for explaining determination process which concerns on 2nd Embodiment Explanatory drawing for explaining determination process which concerns on 3rd Embodiment Explanatory drawing for explaining determination process which concerns on 3rd Embodiment A flowchart showing the procedure of the operation schedule creation process performed by the shared support system in the fifth embodiment. Explanatory drawing for explaining a modification of the determination process of 1st Embodiment

Hereinafter, embodiments of the riding support system 1 will be described with reference to the drawings.

The riding support system 1 provides a service for supporting the riding of a vehicle when moving to a member (user) of a specific organization (company, government office, sports club, nursing care facility, shopping facility, etc.). In the present embodiment, the carpooling support system 1 provides a carpooling (ride sharing) service for the user's outbound movement to a specific facility. The outbound movement referred to here corresponds to, for example, the movement of the user in the morning commuting, that is, the movement at work. That is, the ride-on support system 1 supports the ride-on on the travel route (outward route) when the user goes to work, and the user is a user of the ride-on support system 1, that is, a ride-on user.

In the following, for the sake of simplicity, it is assumed that each user who uses the riding support system 1 according to the present embodiment owns a vehicle that can be provided for riding. In addition, it is assumed that each of the provided vehicles can accommodate four people. In the riding support system 1, a user identification number is set for all users.

(Configuration of shared support system)
As shown in FIG. 1, the riding support system 1 has a plurality of user terminals 2 (terminals) held by users, and each user terminal 2 and a host server 4 connected via a network 3. Each user terminal 2 is possessed by each user. The host server 4 may be provided at an arbitrary location, and may be provided, for example, in the building of a company (operator) that operates the shared-ride support system 1. The network 3 is, for example, the Internet.

The user terminal 2 has a processing unit 11 for executing an application, a user interface 12 for displaying an input screen and a message and receiving an input from a user, and a communication for communicating with a host server 4 via a network 3. It is provided with a unit 13. The user terminal 2 is, for example, a smart phone, a tablet PC, a mobile phone, a PDA, or the like. The processing unit 11 of the user terminal 2 has an application receiving unit 15 that accepts a shared application by a user's input operation. When accepting a shared application, the application reception unit 15 requests the input of the user identification number and the usage application information including the desired conditions (shared conditions) when using the shared. However, when the user who uses the user terminal 2 is limited to the user who owns the user terminal 2, the request for inputting the user identification number may be omitted.

The riding conditions referred to here include the user's desired departure place, desired departure time, desired arrival time, and other conditions desired when using the riding. Other conditions may include user preference (eg, smoking availability, conversation in a shared vehicle, music genre, etc.).

The host server 4 (server) supports the execution of the ride by executing the ride support process (see FIG. 2). More specifically, the host server 4 receives a usage application from a user and determines a group (shared group) of users who use the same vehicle by combining the users who have made the usage application. After that, the host server 4 creates a schedule such as a travel route of the vehicle of each group and notifies the user terminal 2.

In order to perform such processing, as shown in FIG. 1, the host server 4 (server) has a communication unit 21 for communicating with the user terminal 2 via the network 3, and an application process for accepting a shared application from the user. A plurality of sharing groups are created by grouping the users who have applied for sharing with the section 22 and the application information management section 23 for storing the sharing application information of the users who wish to share, and using the external navigation server 5. The operation schedule creation unit 24 that creates the operation schedule of each shared group, the shared information management unit 25 that stores the created shared group and the operation schedule, the user information management unit 26 that holds the information for each user, and the shared operation. It has a user notification unit 29 for notifying the user of the schedule information. The navigation server 5 may be configured as part of the host server 4.

The user information management unit 26 stores information related to the user for each user as user information. The user information includes a user identification number, a user name, an address, and information about a vehicle owned by the user. The user information may include information regarding the user's intention.

The application information management unit 23 receives and stores the shared application information from the application processing unit 22. The shared application information includes the user identification number of the user who made the application and the shared conditions.

The operation schedule creation unit 24 executes an operation schedule creation process (see FIG. 3) for determining a shared group suitable for executing the shared ride based on the shared ride application information. More specifically, the operation schedule creation unit 24 groups the users who have made a shared application based on the shared application information stored in the application information management unit 23, and creates a plurality of patterns (sets) of combinations of the shared groups. create. From the created combinations of riding groups, the evaluation value of each pattern is calculated using a predetermined evaluation function, and the group suitable for performing the riding is determined based on the evaluation value.

In order to perform such processing, as shown in FIG. 1, the operation schedule creation unit 24 is a combination of the link means 24A for preferentially associating the users to be on board and the group of users to be on board based on the association. The pattern acquisition means 24B for acquiring the pattern, the evaluation means 24C for obtaining the evaluation value of each pattern of the group combination based on the predetermined evaluation function, and the combination group to be executed are determined based on the evaluation value. It has a determination means 24D and a schedule creation means 24E for constructing an operation schedule based on a determined combination.

The link means 24A is a determination process for determining whether or not a user other than the parent user should be preferentially shared with each user who has applied for sharing (hereinafter referred to as a parent user) based on the user information and the sharing application information. I do. As a result, the link means 24A creates a link information table (see FIG. 4) showing the relationship between the parent user and the user riding on the parent user (hereinafter, child user).

The pattern acquisition means 24B executes a tree creation process (see FIG. 5) based on the link information table created by the link means 24A, and creates data (see FIG. 6) having a tree structure (tree structure). The tree structure consists of nodes (nodes, vertices) and edges (branches, sides) connecting the nodes, and shows a structure in which one node (hereinafter, root) branches as the hierarchy becomes deeper. Each node corresponds to a user. The nodes of the users who preferentially ride together are connected by edges. Hereinafter, for convenience of explanation, the number of edges from each node to the root from the root is described as the depth.

The pattern acquisition means 24B repeats the process of creating a riding group by acquiring the route reached by the node located at the end of the data having a tree structure by tracing the edge from the route. Further, the pattern acquisition means 24B acquires all the patterns of the combination of the riding groups by combining the created riding groups.

The evaluation means 24C uses an evaluation function to calculate an evaluation value for each pattern of the combination of the riding group acquired by the pattern acquisition means 24B. In the present embodiment, the evaluation function is the total mileage of the vehicles used for riding, and it is shown that the evaluation becomes higher as the evaluation value becomes lower. This is because it is expected that carbon dioxide emissions will be reduced and traffic congestion will be alleviated as the sum of the mileages of all vehicles becomes shorter.

The schedule creation means 24E is based on the determined combination of the passenger groups, the role of each user in each passenger group (driver or occupant other than the driver), the vehicle used by each passenger group, and each passenger group. Determine details such as the route. In addition, the schedule creation means 24E sets the departure time of each user and the estimated arrival time at the destination based on the set route of each shared group.

The riding information management unit 25 stores and retains information related to riding. The information stored in the shared information management unit 25 includes the operation schedule information created by the operation schedule creation unit 24. The operation schedule information is created for each passenger group, and the identification number of the passenger group, the identification number of the user included in the passenger group, the identification number of the user set as the driver, the information about the vehicle owned by the driver, and each user. Includes departure point, destination, departure time, and estimated arrival time at the destination.

In the present embodiment, the shared information management unit 25 further stores data to be retained when the operation schedule creation unit 24 performs the operation schedule creation process. For the data to be retained when the operation schedule creation unit 24 performs the operation schedule creation process, a table showing the users that can be combined as shown in FIG. 4 (hereinafter referred to as a link information table) and a combination of users in the shared group are acquired. Contains tree-structured data for.

The user notification unit 29 creates user operation schedule information, which is operation schedule information for each user, from the operation schedule information stored in the shared information management unit 25, and the communication unit 13 causes the user operation schedule corresponding to each user terminal 2. Send information.

The user operation schedule information includes the identification number of the passenger group, the identification number of the user included in the passenger group, the information related to the vehicle used for passenger, the departure place and departure time of each user included in the passenger group, and the departure time. Includes estimated arrival time and user role information. The user role information is information indicating whether the user is a driver (driver) or a occupant (rider) other than the driver. The user operation schedule information may further include information related to the travel schedule route of the shared vehicle. When the user terminal 2 receives the user operation schedule information, the user terminal 2 displays the user operation schedule information on the user interface 12.

(Riding support processing)
Hereinafter, the procedure of the riding support processing of the riding support system 1 according to the embodiment will be described with reference to FIG. The ride-on support system 1 sets an implementation period in a time zone when a plurality of users actually go to work, and executes the ride-on support process on the outbound route corresponding to the implementation period. The implementation period may be, for example, a work zone (6:00 to 10:00) on weekday mornings.

The shared support process is executed on the host server 4. In the first step ST1 of the ride-on support process, the application processing unit 22 of the host server 4 starts accepting the ride-on application. The acceptance period for shared applications is set before a predetermined time from the start of the implementation period. For example, if the implementation period includes commuting at sunrise (6:00 to 10:00), the application processing unit 22 starts accepting shared applications at 6:00, three days before that day.

At the same time, the application processing unit 22 transmits a reception start signal to the user terminal 2, and the application reception unit 15 of the user terminal 2 enables the reception processing of the shared application for a predetermined implementation period (hereinafter, application reception processing). do. As a result, the user who wants to use the shared ride (the person who wants to use the shared ride) can apply for the shared ride using the user terminal 2.

When the user makes a predetermined input to make a shared application to the user terminal 2, the user terminal 2 transmits a predetermined signal to the host server 4. When the host server 4 receives the predetermined signal, the application reception unit 15 starts the application reception process. In the application reception process, the application reception unit 15 transmits a predetermined signal to the user terminal 2 and requests the user terminal 2 to input the user identification number and the riding condition. The riding conditions include the user's desired departure place, desired departure time, and desired arrival time. In the present embodiment, the riding condition includes the user's intention and the upper limit time (hereinafter, detour allowable time) that allows extra spending due to the execution of the riding. The user's intention may be, for example, the genre of music played in the vehicle or the presence or absence of conversation in the shared vehicle. The permissible detour time includes, for example, a detour of a vehicle for allowing another user to board the vehicle, and a waiting time for another occupant to board the vehicle.

When the user terminal 2 receives the input of the user identification number and the riding condition, the user terminal 2 transmits the information to the host server 4. When the host server 4 receives the user identification number and the riding condition of the corresponding user, the host server 4 associates the user identification number and the riding condition of the corresponding user and stores them in the application information management unit 23.

Next, in step ST2, the application processing unit 22 finishes accepting the shared application after a predetermined period has elapsed from the start of accepting the shared application to before the start of the implementation period. As a result, the acceptance period for shared applications ends. More specifically, for example, when targeting the outbound route on a certain day, the application processing unit 22 ends the acceptance of the shared application at 18:00 on the previous day.

The application processing unit 22 transmits a reception end signal to the user terminal 2 after a predetermined period has elapsed from the start of reception of the shared application to the start of the implementation period. As a result, the application reception unit 15 of the user terminal 2 cannot execute the application reception process. As a result, the user cannot input the shared application.

Next, in step ST3, the operation schedule creation unit 24 sets the most suitable combination of riding groups from all the combinations of riding groups (hereinafter, the optimum solution) based on the riding application information of each user. ) Is extracted. The operation schedule creation process is executed.

Next, the operation schedule creation unit 24 executes step ST4 when the operation schedule creation process is completed. In step ST4, the operation schedule creation unit 24 creates operation schedule information corresponding to the acquired optimum solution. The operation schedule information includes a plurality of passenger groups including a plurality of users, a driver in each passenger group, a route of each passenger group, a departure place and a departure time of each user included in the passenger group, and an arrival of the user. Includes estimated time. The operation schedule creation unit 24 stores the operation schedule information in the shared information management unit 25. The operation schedule creation unit 24 creates user operation schedule information, which is operation schedule information for each user, and stores it in the shared information management unit 25. When the saving is completed, the operation schedule creation unit 24 executes step ST5.

Next, in step ST5, the user notification unit 29 transmits the user operation schedule information corresponding to each user terminal 2 as a reservation result by the communication unit 13. As a result, the user operation schedule information is displayed on the user terminal 2, and the user can confirm his / her own user operation schedule information on the user terminal 2.

(Operation schedule creation process)
Next, with reference to FIG. 3, the details of the operation schedule creation process executed by the operation schedule creation unit 24 will be described. In the first step ST11 of the operation schedule processing, the operation schedule creation unit 24 acquires the usage application information of all the users who have applied from the application information management unit 23 in association with the user identification information. When the acquisition is completed, the operation schedule creation unit 24 executes step ST12.

Next, in step ST12, the link means 24A of the operation schedule creation unit 24 first selects the users who have applied for sharing as the users (parent users) to be evaluated in order, and the target users and users other than the target users. Are sequentially extracted, and a determination process is performed to determine whether or not they can be combined. As a result, the link means 24A extracts a user (hereinafter, child user) determined to be able to be combined with each user (hereinafter, parent user). After that, the link means 24A sets the parent user and the child user as a pair and writes them in the link information table. That is, in the link information table, a user who has made a shared application and a child user whose parent user is that user are listed in order. When the creation of the link information table is completed, the operation schedule creation unit 24 saves the link information table in the shared information management unit 25, and ends step ST12.

Next, the pattern acquisition means 24B of the operation schedule creation unit 24 executes step ST13 (hereinafter, tree creation process) for creating tree structure data (see FIG. 6) using the link information table shown in FIG. .. Hereinafter, a process for creating tree-structured data (tree creation process) will be described with reference to FIG.

In the first step ST21 of the tree creation process, the pattern acquisition means 24B arranges the users who have applied for sharing on the nodes. In FIG. 6A, user A is arranged at the node, and in FIG. 6B, user B is arranged at the node. Hereinafter, the nodes created in step ST21 are appropriately described as roots (or root nodes). When the arrangement of the users who have applied for sharing is completed, the pattern acquisition means 24B finishes step ST21.

When step ST21 is completed, the pattern acquisition means 24B creates a node having a depth of 1 and executes step ST22 for connecting to the route. More specifically, in step ST22, the pattern acquisition means 24B refers to the link information table, extracts users that can be combined with the root user, sets them as nodes having a depth of 1, and sets the root and each node. Connect by edge. When the edge connection is completed, the pattern acquisition means 24B ends step ST22.

When step ST22 is completed, the pattern acquisition means 24B creates a node having a depth of 2 and executes step ST23 in which the node having a depth of 1 is connected by an edge. More specifically, in step ST13, the pattern acquisition means 24B uses the link information table to extract users that can be combined with the users located in each node (hereinafter, parent node) created in ST22. After that, the pattern acquisition means 24B sets a user who is an extracted user, which is different from the user of the parent node, and is different from the user other than the root, as a new node (hereinafter referred to as a child node), and is connected by an edge. do. When the connection is completed, the pattern acquisition means 24B ends step ST23.

When step ST23 is completed, the pattern acquisition means 24B executes step ST24 for creating a node having a depth of 3. More specifically, in step ST14, the pattern acquisition means 24B can be combined with the user corresponding to the node (child node) having a depth of 2, the corresponding child node, the parent node corresponding to the child node, and the child node. Extract users that do not correspond to any of the routes that connect to the parent node. The extracted user is set as a node (grandchild node) having a depth of 3, and is connected to the corresponding child node by an edge. As a result, as shown in FIG. 6, tree-structured data including nodes up to a depth of 3 is formed. When the operation schedule creation unit 24 completes the creation of the tree structure data, the operation schedule creation unit 24 completes step ST24 and ends step ST13 (tree creation process).

When step ST13 is completed, the operation schedule creation unit 24 (pattern acquisition means 24B) executes step ST14 to acquire a pattern of a combination of a plurality of riding groups. More specifically, in step ST14, the pattern acquisition means 24B traces from the root to the node located at the end via the edge based on the created tree structure data, and acquires the riding group. The pattern acquisition means 24B acquires all the riding groups that can be formed by acquiring all the routes that reach from the route to the node located at the end in this way. Next, the pattern acquisition means 24B acquires all the patterns of the combination of the riding groups by combining the riding groups that can be formed so that the user does not belong to the plurality of riding groups. When the pattern acquisition means 24B acquires all the patterns of the combination of the riding group, the operation schedule creation unit 24 finishes step ST14.

When step ST14 is completed, the operation schedule creation unit 24 (evaluation means 24C) executes step ST15 to calculate an evaluation value for each combination pattern of the riding group using the evaluation function. More specifically, the evaluation means 24C first refers to the navigation server 5 and creates the shortest route for each of the riding groups belonging to each pattern. Next, the evaluation means 24C calculates each path length. After that, the evaluation means 24C calculates the total of the route lengths of the riding groups belonging to each pattern as an evaluation value. When the calculation of the evaluation value for each pattern is completed, the operation schedule creation unit 24 finishes step ST15.

In step ST15, the operation schedule creation unit 24 (determining means 24D) extracts the pattern of the riding group having the smallest evaluation value and determines the optimum riding group (optimal solution).

Next, the determination process executed by the link means 24A of the operation schedule creation unit 24 will be described. The determination process is a process of determining whether or not the users can be combined when the link means 24A creates the link information table (step ST12). In the present invention, only the determination process is different in the first to fourth embodiments. Hereinafter, the determination process of each embodiment will be described in order.

<< First Embodiment >>
In the determination process, the link means 24A according to the first embodiment determines whether or not two users can be combined based on the desired departure time, which is the desired time to start using the shared vehicle, and preferentially determines whether or not the two users can be combined. Associate the passengers on board. The details of the determination process will be described below with reference to FIG. 7, with the two users as user A and user B.

First, the link means 24A, in the first step ST31 of determining process, the distance D _A from the desired riding position for each of the users A and B to the _destination, and D _B determined. Next, the link means 24A, respectively the distance D _A and D _B, divided by the vehicle speed V which is suitable for vans execution of predetermined further by adding respectively to the desired departure time of the user S _A and S _B, user a arrival time _G a of _{(= S a + D a /} V), and calculates the user arrival time _G B of _{B (= S B + D B} / V).

Link means 24A is the calculation of the arrival time _{G A} and _{G B} is completed, executes step ST32. Link means 24A, in step ST32, the difference in arrival time _| G A -G _{B |,} the time required for boarding or alighting P (passenger time) time obtained by _adding, | calculates a + P | G A _-G B .. | G A _-G B | + _P is the time until the user loses for other users time (e.g., user A and stand by moving the vehicle in the vans point of the user B, to boarding of the user B is completed . Below, it corresponds to the lost time). The boarding / alighting time P may be preset by the operator.

When the calculation of the lost time is completed, the link means 24A executes step ST33 for determining whether or not the two users can be combined based on the lost time. More specifically, the link means 24A is lost time, or less bypass allowed time A _A user A, and the bypass allowable time of the user B when it is less A _B, it is possible to combine both Is determined.

That is, the link means 24A determines that both (user A and user B) can be combined when the following equations (1) and (2) are satisfied, and in other cases, both are combined. Judge that it cannot be done.

When the determination is completed, the operation schedule creation unit 24 (link means 24A) finishes the determination process.

Next, the effect of the riding support system 1 configured in this way will be described. In step ST12, the link means 24A creates a link information table in which users that can be combined can be associated with each user. After that, the pattern acquisition means 24B creates tree-structured data by connecting the nodes corresponding to the users that can be combined with each other by edges based on the link information table. After that, the pattern acquisition means 24B creates a pattern of the combination of the riding group by tracing the data of the tree structure (ST14), the evaluation means 24C calculates the evaluation value (ST15), and the determination means 24D determines the optimum solution. The combination of the riding groups is determined (ST16).

In this way, the operation schedule creation unit 24 creates tree-structured data including only sets of users that can be combined, and by tracing the data, creates a pattern of combinations of shared groups. Combinations of parent users and child users that are not listed in the link information table are not included in the tree structure data. Therefore, it can be said that the link means 24A preferentially associates the passengers on board. Furthermore, since the created patterns do not include combinations of users that cannot be combined, the created patterns correspond to filtered patterns among all the combinations of riding groups. Since this filtering reduces the number of multiplication groups that require the calculation of the evaluation function, the amount of calculation required for extracting the optimum solution can be reduced, and it becomes easy to obtain the optimum solution that meets the user's wishes.

In the present embodiment, the link means 24A determines whether or not two users can be combined in the determination process based on the user's desired departure time. In this way, by performing the determination based on the user's desired departure time, it is possible to easily eliminate the riding group that cannot be the optimum solution even if combined. Therefore, it is possible to construct a tree structure that is expected to include an optimum solution that meets the user's wishes and has few patterns of combinations of riding groups extracted in ST14.

<< Second Embodiment >>
The shared support system 101 according to the second embodiment is used for all users to go to one destination (for example, the parking lot position of the office). In the riding support system 101 according to the second embodiment, as compared with the riding support system 101 according to the first embodiment, the link means 24A determines the direction of each desired departure point (use start point) from the destination in the determination process. The difference is that it is determined whether or not two users can be combined based on the above, and the same applies to the other configurations. Therefore, the determination process performed in the riding support system 101 according to the second embodiment will be described below with reference to FIG. 8 by taking as an example a case where the user A and the user B are combined.

First, in the first step ST41 of the determination process, the link means 24A uses the destination and the desired departure point to determine the user azimuth angle _VA when each of the user A and the user B is viewed with the destination as the center. And V _B. As shown in FIG. 9, the user azimuth V _A, and V _B may determine the north direction as a reference. When the calculation of the user azimuth angles _VA and V _B is completed, the link means 24A executes step ST42.

In step ST42, the link means 24A calculates the angle θ between the user A's desired departure point and the user B's desired departure point when viewed from the destination, based on the _{user azimuth angles VA} and V _B. In the present embodiment, the angle θ is determined based on the degree method and is represented by a numerical value of 0 degrees or more and less than 180 degrees. When the calculation of the angle θ is completed, the operation schedule creation unit executes step ST43.

Link means 24A, in step ST43, when the angle θ is equal to or less than the bypass allowable upper limit angle V _M is a predetermined number, determines that it is possible to combine the two, in other cases, both Judge that they cannot be combined. Bypass allowable upper limit angle V _M is may have been preset by the operator.

When the determination is completed, the operation schedule creation unit 24 finishes the determination process.

Next, the effect of the riding support system 101 configured in this way will be described. In the determination process, the link means 24A determines whether or not two users can be combined based on the user azimuth angle. More specifically, the link means 24A is two users (e.g., user A and user B in FIG. 9) when the angle between the straight line connecting the desired starting point and destination is less than V _M is It is determined that the two users can be combined. Link means 24A is two users (e.g., user A and user D in FIG. 9) when the angle of the straight line connecting the desired starting point and destination is greater than V _M is two users are combined Judge that it cannot be done. Thus, the difference in user azimuth large between users are combined than V _M is prevented.

That is, the user each other orientations differ greatly in vans available starting point as viewed from the destination, more specifically, the difference is (V _M) × number of passengers user azimuth, i.e., is greater between users than 4V _M combined Groups are filtered out. Since this filtering reduces the number of multiplication groups that require the calculation of the evaluation function, the amount of calculation required for extracting the optimum solution can be reduced, and the extraction of the optimum solution that meets the user's wishes becomes easy.

<< Third Embodiment >>
In the riding support system 201 according to the third embodiment, as compared with the riding support system 1 according to the first embodiment, the link means 24A desires to determine whether or not two users can be combined in the determination process. The difference is that it is performed based on, and the same applies to other configurations. Therefore, the determination process performed in the riding support system 201 according to the third embodiment will be described below with reference to FIGS. 10 and 11 by taking as an example a case where the user A and the user B are combined.

First, as shown in FIG. 10, the link means 24A calculates _{the distance DAB} between the desired departure point of the user A and the desired departure point of the user B in the first step ST51 of the determination process. When the calculation is completed, the link means 24A executes step ST52.

In step ST52, the link means 24A can combine both (for example, user A and user B in FIG. 11) _{when the distance D AB} is equal to or less than the detour allowable distance upper limit value D _{M which is a predetermined distance.} In other cases (for example, user A and user D in FIG. 11), it is determined that both cannot be combined. Detour allowable distance limit value D _M is may have been preset by the operator.

When the determination is completed, the operation schedule creation unit finishes the determination process.

Next, the effect of the riding support system 201 configured in this way will be described. The link means 24A determines whether or not two users can be combined in the determination process based on the distance of the user's desired departure point. Thus, a large user desires departure point than a predetermined value, more specifically, bypass allowable distance limit value D _M × number of passengers, i.e., filtering the groups are combined among users apart than 4D _M, eliminating can do. By this filtering, the number of multiplication groups that require the calculation of the evaluation function can be reduced, so that the amount of calculation required for extracting the optimum solution can be reduced, and it becomes easy to obtain the optimum solution that meets the user's wishes.

<< Fourth Embodiment >>
In the riding support system 301 according to the fourth embodiment, as compared with the riding support system according to the first embodiment, whether or not the link means 24A can combine two users based on the intentions of each user in the determination process. The difference is that the determination is made, and the same applies to the other configurations. Therefore, hereinafter, the determination process performed in the riding support system according to the fourth embodiment will be described in the case where the user A and the user B are combined, and the presence or absence of conversation in the vehicle is taken as an example.

In the determination process, the link means 24A determines whether or not the intention of the user A and the intention of the user B match. More specifically, the operation schedule creation unit either wants user A and user B to have a conversation in the car (both are available), or neither wants to have a conversation in the car (both). In the case of none), it is determined that both (user A and user B) can be combined, and in other cases, it is determined that both cannot be combined. When the determination is completed, the operation schedule creation unit finishes the determination process.

Next, the effect of the riding support system configured in this way will be described. The operation schedule creation unit determines whether or not two users can be combined in the determination process according to the user's intention. This makes it possible to filter and eliminate groups in which users who match their intentions are combined. This filtering eliminates the multiplication groups that do not meet the user's wishes and reduces the number of multiplication groups that require the calculation of the evaluation function, so that the amount of calculation required to extract the optimum solution can be reduced and meets the user's wishes. It becomes easy to obtain the optimum solution.

<< Fifth Embodiment >>
The shared support system 401 according to the fifth embodiment is used for all users to go to one destination (for example, the parking lot position of the office) as in the second embodiment. Further, as shown in FIG. 12, the riding support system 401 according to the fifth embodiment is compared with the riding support system 1 according to the first embodiment after step ST12 of the operation schedule creation process and before step ST13. The difference is that step ST61, in which sort processing is performed on the link information table, is provided. Other configurations are the same as those of the riding support system 1 according to the first embodiment. The details of the sort process will be described below.

In step ST61, the pattern acquisition means 24B calculates the distance to the desired departure point and the destination of the parent user and the distance to the desired departure point and the destination of each child user by referring to the link information table. .. After that, in the link information table, the pattern acquisition means 24B indicates that the distance from the desired departure point to the destination among the child users is larger than that of the parent user, or is desired to be larger than the desired departure time of the parent user. Delete users with early departure times. When the same processing is completed for all the parent users, the pattern acquisition means 24B ends step ST61.

Next, the effect of the riding support system 401 configured in this way will be described. In the link information table, only users who are closer to the destination than the parent user and have a later desired departure time are child users. Therefore, in the tree structure, only the user whose desired departure point is closer to the destination than the node (root) having a depth of 0 and whose desired departure time is later is a node having a depth of 1. Further, only the user whose desired departure point is closer to the destination than the node at depth 1 and whose desired departure time is later is the node at depth 2. Similarly, only the user whose desired departure point is closer to the destination than the node at depth 2 and whose desired departure time is later is the node at depth 3.

As a result, when a shared group is created by following the tree structure and the user corresponding to the route is the driver, the nodes of depths 1, 2, and 3 are followed in order to reverse the direction away from the destination. A route to the destination is formed without running. As a result, by following the tree structure, it becomes difficult to generate a riding group including a route that travels (that is, reverses) in a direction away from the destination.

By performing the sorting process in this way, it is possible to easily eliminate the set including the riding group including the riding group in which the evaluation function including the reverse route is likely to be large. Therefore, the tree structure is simplified and the number of multiplication groups that require the calculation of the evaluation function is reduced, so that the amount of calculation required for extracting the optimum solution can be reduced, and it is easy to obtain the optimum solution that meets the user's wishes. Become.

Although the description of the specific embodiment is completed above, the present invention can be widely modified without being limited to the above embodiment. In the first embodiment, the operation schedule creation unit performs the determination process based on the lost time, but the present invention is not limited to this mode.

For example, the link means 24A may be configured to determine whether or not the time required for getting on and off the vehicle can be secured in the determination process. More specifically, as shown in FIG. 13, when determining whether the link means 24A can combine two users (user A and user B), first, the detour grace of the arrival time of the user A is deferred. time before the time _G a -A _a (hereinafter, before grace time) and bypass window time after time _{G a} + a a (hereinafter, the rear grace time) is calculated. Then, the link means 24A obtains a front grace time _G B -A _B and rear grace time _G B + _{A B} user B. Moreover, the link means 24A is a time zone to the trailing grace time from a previous grace time of the user A and _{(G A -A A ~G A +} A A), the time zone to the trailing grace time from a previous grace time user B ( _{G B -A B ~G B + a} B) and overlap time (delay time) is calculated tau. Next, the link means 24A can be combined with the user A and the user B when the calculated τ is equal to or longer than the boarding / alighting time P, that is, when a sufficient time for getting on / off the vehicle can be secured. In other cases, it may be determined that the combination cannot be performed.

In each of the above embodiments, the link means 24A may combine two users based on the desired departure time, the user azimuth, the distance between the desired departure points, the distance between the destination and the desired departure points, or the intention. Although it was determined whether or not it could be done, the present invention is not limited to this aspect. Link means 24A is desired departure time _S A, _{S B,} user azimuth _V A, _{V B,} based on the desired distance _{D AB} between departure, and two or more of any of the oriented, to combine user Users may be associated by determining whether or not it is possible.

In the fifth embodiment, the presence or absence of conversation is used as the user's intention, but the present invention is not limited to this aspect. As an orientation, for example, the presence or absence of smoking may be used. When the orientation is a music genre, selection of a radio station, etc., the operation schedule creation unit determines the similarity of the user's orientation, and when the similarity is equal to or higher than a predetermined threshold value, the two can be combined. It is good to judge that it can be done.

In the first to fifth embodiments, the link means 24A has created a link information table showing the association of users who preferentially ride on the vehicle, but the present invention is not limited to this embodiment. For example, the link means 24A (unlink means) creates a link information table that associates users whose riding should be preferentially excluded, and based on the link information table, the pattern acquisition means 24B creates a pattern of combinations of riding groups. May be created. As a result, the pattern of the combination of groups is acquired based on the association of the users who should not be riding, and the combination of the combination groups to be executed is determined based on the evaluation function obtained for each of the acquired patterns. Will be done. With this configuration, it is possible to eliminate a riding group in which users who should not ride together are combined due to a disagreement of intentions or the like, and it is possible to reduce the number of groups for which the evaluation function should be calculated.

In the above embodiment, a vehicle capable of carrying four people has been used as the vehicle, but the present invention is not limited to this embodiment. The vehicle may be one that can accommodate two people, or may be a bus, a truck, or the like.

1, 101, 201, 301, 401: Shared support system 2: User terminal (terminal)
3: Network 4: Host server (server)
24: service schedule creation unit 24A: link means 24B: pattern acquisition unit 24C: evaluation means 24D: determining means 24E: plan creating unit _{D AB:} distance _S A, _{S B:} desired departure time _V A, _{V B:} user azimuth

Claims (7)

It is a riding support system for determining a group of the users who use the same vehicle by combining a plurality of users.
A terminal that can accept usage application information from the user,
It has a server that is connected to the terminal via a network and can acquire the usage application information.
The server
Linking means for associating the user who preferentially rides with the passenger,
A pattern acquisition means for acquiring a pattern of a combination of the group of the users who should share the vehicle based on the association, and a pattern acquisition means.
An evaluation means for obtaining an evaluation value for each of the patterns of the combination of the groups based on a predetermined evaluation function, and
A riding support system comprising a determination means for determining a combination of riding groups to be executed based on the evaluation value. The usage application information includes the time when the user wants to use the information.
The riding support system according to claim 1, wherein the linking means makes the association based on the time. The shared support system is used by all the users to go to one destination.
The riding support system according to claim 1, wherein the link means makes the association based on the direction of the departure place where the user wants to start using the user from the destination. The riding support system according to claim 1, wherein the link means makes the association based on the distance between the departure points where the user wishes to start using the system. The riding support system according to claim 1, wherein the linking means makes the association based on the user's intention. The usage application information includes the time when the user wants to use the information.
The shared support system is used by all the users to go to one destination.
The association is made based on any two of the time, the direction of the departure point from the destination to the user's desire to start using, the distance between the departure points, and the user's intention. The riding support system according to claim 1, wherein the vehicle is to be used. It is a riding support system for determining a group of the users who use the same vehicle by combining a plurality of users.
A terminal that can accept usage application information from the user,
It has a server that is connected to the terminal via a network and can acquire the usage application information.
The server
Including a link means for associating the user who should preferentially exclude the ride.
A pattern acquisition means for acquiring a pattern of a combination of the group of the users who should share the vehicle based on the association, and a pattern acquisition means.
An evaluation means for obtaining an evaluation value for each of the patterns of the combination of the groups based on a predetermined evaluation function, and
A riding support system comprising a determination means for determining a combination of riding groups to be executed based on the evaluation value.

Images