Itinerary matching system, itinerary matching method, itinerary matching program

Abstract

To provide a technology for an itinerary matching system to provide matching of participants of an itinerary. capable of ensuring the feasibility of matching.SOLUTION: An itinerary matching system according to the present disclosure is configured to execute: a process of receiving registration of an itinerary; a process of extracting two registered itineraries from among a plurality of registered itineraries that have been registered and calculating a degree of matching between the two registered itineraries that have been extracted; a process of generating, upon receiving that the degree of matching exceeds a predetermined threshold value, a merged itinerary in which the two registered itineraries are merged; and a process of setting, upon receiving acceptance from a participant of each of the two registered itineraries, the participant of each of the two registered itineraries as a participant of the merged itinerary.SELECTED DRAWING: Figure 7

Description

[Technical field]

[0001] The present disclosure relates to techniques for providing matching of participants for a journey. [Background technology]

[0002] Patent Document 1 discloses a ride-sharing support system in which a user who will be the driver of a vehicle recruits passengers for a certain itinerary, and users who wish to ride on the trip apply, matching the driver with users who wish to ride on the trip. [Prior art documents] [Patent documents]

[0003] [Patent Document 1] JP 2016-194854 A Summary of the Invention [Problem to be solved by the invention]

[0004] The ride-sharing support system according to Patent Document 1 provides matching for ride-sharing when a user is looking for passengers for a planned itinerary in which the user travels by vehicle from a certain departure point to a certain destination. However, it is assumed that the user would like to recruit participants for a more general itinerary in which the means of transportation is not limited to vehicles and the route includes multiple destinations. Thus, there is a need for a system that provides matching for participants for general itineraries. On the other hand, in such a system, the possibility of matching becomes an issue because there are many variations in the target itineraries.

[0005] In view of the above-mentioned problems, one object of the present disclosure is to provide technology that can match participants for general itineraries while ensuring the possibility of matching. [Means for solving the problem]

[0006] A first aspect of the present disclosure relates to an itinerary matching system that provides matching of participants for an itinerary.

[0007] The itinerary matching system according to a first aspect includes one or more processors, and the one or more processors are configured to execute a first process of accepting the registration of an itinerary, a second process of extracting two registered itineraries from a plurality of registered registered itineraries and calculating the degree of similarity between the two extracted registered itineraries, a third process of generating a merged itinerary by merging the two registered itineraries when the degree of similarity exceeds a predetermined threshold, and a fourth process of making the participants of each of the two registered itineraries participants in the two registered itineraries as participants in the merged itinerary when consent is received from each of the participants of the two registered itineraries.

[0008] A second aspect relates to a method for matching itinerary participants by computer.

[0009] The itinerary matching method according to the second aspect is characterized in that it includes accepting registration of an itinerary, extracting two registered itineraries from a plurality of registered registered itineraries, calculating a degree of similarity between the two extracted registered itineraries, generating a merged itinerary by merging the two registered itineraries when the degree of similarity exceeds a predetermined threshold, and, upon receiving consent from each participant of the two registered itineraries, making each participant of the two registered itineraries a participant of the merged itinerary.

[0010] A third aspect relates to an itinerary matching program that causes a computer to execute a process for providing matching of participants for an itinerary.

[0011] The itinerary matching program according to the third aspect is characterized in that it is configured to cause a computer to execute a first process of accepting the registration of an itinerary; a second process of extracting two registered itineraries from a plurality of registered registered itineraries and calculating the degree of similarity between the two extracted registered itineraries; a third process of generating a merged itinerary by merging the two registered itineraries when the degree of similarity exceeds a predetermined threshold; and a fourth process of making the participants of each of the two registered itineraries participants in the merged itinerary when consent is received from each of the participants of the two registered itineraries. Effect of the Invention

[0012] According to the present disclosure, a function for matching participants for a plurality of registered itineraries is provided. Here, each of the plurality of registered itineraries may be a general itinerary in which the means of transportation is not limited and the route includes a plurality of destinations. In particular, according to the present disclosure, a degree of agreement is calculated for two registered itineraries extracted from the plurality of registered itineraries, and a merged itinerary is generated by merging the two registered itineraries for two registered itineraries whose degree of agreement exceeds a predetermined threshold. Then, with the consent of each participant of the two merged itineraries, each participant of the two registered itineraries is made a participant of the merged itinerary.

[0013] This reduces the variation in multiple registered itineraries, and reduces the hassle for users who wish to apply to participate in one of the multiple registered itineraries. As a result, the possibility of matching can be ensured. In addition, participants of two registered itineraries whose degree of match exceeds a predetermined threshold can be given an opportunity to match with each other, improving the possibility of matching. [Brief description of the drawings]

[0014] [Figure 1] 1 is a conceptual diagram for explaining an overview of an itinerary matching system according to an embodiment of the present invention. FIG. [Diagram 2] FIG. 13 is a conceptual diagram showing an example of a registered itinerary. [Diagram 3] FIG. 13 is a conceptual diagram showing an example of a list of registered itineraries. [Figure 4] FIG. 13 is a conceptual diagram for explaining an example of a degree of coincidence calculated for two registered itineraries. [Diagram 5] FIG. 5 is a conceptual diagram showing an example of a merged itinerary generated for the two registered itineraries shown in FIG. 4. [Figure 6] FIG. 2 is a block diagram showing a preferred example of the configuration of a server according to the present embodiment. [Figure 7] 6 is a flowchart showing a process executed by a server according to the embodiment; DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0015] 1. Itinerary Matching System Hereinafter, an outline of the itinerary matching system according to the present embodiment will be described with reference to the drawings.

[0016] The itinerary matching system according to this embodiment provides a function for matching itinerary participants (hereinafter, also referred to as the "itinerary matching function"). FIG. 1 is a conceptual diagram for explaining an overview of an itinerary matching system 10 according to this embodiment. FIG. 1(A) shows the configuration, and FIG. 1(B) shows typical processing related to the itinerary matching function.

[0017] In FIG. 1, the process related to the itinerary matching function is executed by a server 100. The server 100 is configured to be able to communicate with a user terminal. That is, a user uses the itinerary matching function by operating the user terminal. Typically, the server 100 is a computer accessible via the Internet, and the user terminal is a mobile terminal (e.g., a smartphone) that connects to the Internet. In particular, the user terminal may be configured to be able to use the itinerary matching function on a predetermined application.

[0018] First, the server 100 accepts registration of an itinerary from a user who is recruiting participants for the itinerary. In Fig. 1, a first user 1a who is recruiting participants for the itinerary and a user terminal 200a operated by the first user 1a are shown. Then, the first user 1a operates the user terminal 200a to register the itinerary (E111).

[0019] The server 100 manages the itinerary for which registration has been accepted (hereinafter also referred to as "registered itinerary") (E101). For example, the server 100 stores a plurality of registered itineraries in a database in a storage device. Here, the registered itinerary includes at least information on the route from the departure point to one or more destinations. The registered itinerary may include specific dates and times, activities (meals, shopping, resting, etc.), means of transportation, travel routes, etc. The registered itinerary may also include the application conditions of participants (age, gender, etc.).

[0020] An example of a registered itinerary is shown in Fig. 2. In the example of a registered itinerary shown in Fig. 2, in addition to information on the route from the departure point to one or more destinations, information on the title, recruited users, date, maximum number of people, estimated number of days, and estimated cost is included. The route information also indicates the designated date and time and special notes for the departure point. However, the title, recruited users, date, maximum number of people, estimated number of days, estimated cost, designated date and time, and special notes may be configured to be undetermined by selection by the first user 1a.

[0021] In this way, the registered itinerary may include at least information on the route from the departure point to one or more destinations, and may not include specific date and time designations. In other words, the first user 1a can register and recruit participants for an itinerary in which the desired destination is determined but the detailed schedule is not determined. The registered itinerary may also be configured to be changed after the fact. For example, the registered itinerary may be configured so that the first user 1a can add a specified date and time after registering the itinerary. Of course, the first user 1a can also register an itinerary in which the detailed schedule is determined from the beginning. For example, in the case of a registered itinerary as shown in FIG. 2, the first user 1a may register the itinerary by inputting the specified date and time and special notes for each of the departure point and one or more destinations. Note that the registered itinerary shown in FIG. 2 is an example, and the registered itinerary may adopt a suitable format depending on the environment in which the itinerary matching system 10 is applied.

[0022] Referring again to Fig. 1, the server 100 next accepts applications from participants (participation applications) for each of the multiple registered itineraries. Fig. 1 shows a second user 1b who is considering participating in any of the multiple registered itineraries managed by the server 100, and a user terminal 200b operated by the second user 1b.

[0023] The second user 1b first searches for registered itineraries by operating the user terminal 200b (E121). In response to the search for registered itineraries, the server 100 transmits a list of registered itineraries for the multiple registered itineraries managed by the user terminal 200b to the user terminal 200b (E102). The user terminal 200b notifies the second user 1b of the received list of registered itineraries. For example, the user terminal 200b displays the list of registered itineraries in a list. FIG. 3 shows an example of a display of the list of registered itineraries. FIG. 3 shows a state in which information for each item is displayed in a list for multiple registered itineraries. Furthermore, the user terminal 200b may be configured to display details of the selected registered itinerary when the second user 1b selects one of the multiple registered itineraries displayed in a list. For example, the user terminal 200b displays the selected registered itinerary as shown in FIG. 2.

[0024] Next, if there is a registered itinerary that the second user 1b wishes to join in the list of registered itineraries, the second user 1b applies for participation by operating the user terminal 200b (E122). For example, the second user 1b applies for participation by selecting a participation application button displayed on the user terminal 200b for each of a plurality of registered itineraries. The server 100 receives the participation application and inquires of the participants of the corresponding registered itinerary whether the participation application will be accepted (E103). For example, when the second user 1b applies for participation in the registered itinerary of the first user 1a, the server 100 notifies the user terminal 200a that a participation application has been received, and the user terminal 200a receives a decision as to whether the participation application will be accepted from the first user 1a.

[0025] Then, when the participant of the target registered itinerary accepts the participation application (E112), the server 100 registers the second user 1b as a participant of the target registered itinerary (E104) and notifies the second user 1b of the application result (E105). On the other hand, if the participant of the target registered itinerary rejects the participation application, the server 100 does not register the second user 1b as a participant, and notifies the second user 1b of the application result.

[0026] Here, when there are multiple participants in the registered itinerary, the server 100 may be configured to inquire about the acceptance or rejection of the participation application to all participants in the registered itinerary, or to inquire about the acceptance or rejection of the participation application only to some of the participants. For example, the server 100 may be configured to inquire about the acceptance or rejection of the participation application only to the first user 1a who registered the registered itinerary. In this case, the server 100 registers the second user 1b as a participant after the first user 1a accepts the participation application.

[0027] In this manner, matching of participants of the itinerary is performed. After matching, the participants of the itinerary can communicate with each other and adjust the itinerary to determine specific dates and times and carry out the itinerary. For this reason, the server 100 may be configured to provide a means of communication between the matched participants. For example, the server 100 may be configured to provide a chat function or a call function between the matched participants. Alternatively, the server 100 may be configured to notify the participants of the itinerary of contact information when matching is performed.

[0028] In addition, the participants of the itinerary can also adjust the itinerary by updating the registered itinerary managed by the server 100. For example, in the case of a registered itinerary as shown in FIG. 2, after matching, the participants of the itinerary can adjust the itinerary by adding a specified date and time or special notes. Here, the server 100 may be configured to require the consent of all the participants of the itinerary to update the registered itinerary, or may be configured to require the consent of only some of the participants of the itinerary. Alternatively, the server 100 may be configured to allow only the representative of the itinerary to update the registered itinerary. For example, the server 100 may be configured to allow only the first user 1a who registered the registered itinerary to update the registered itinerary.

[0029] As described above, the itinerary matching system 10 provides an itinerary matching function. In particular, a user can use the itinerary matching function for a general itinerary in which the means of transportation is not limited and the route includes multiple destinations. Such an itinerary matching function not only improves the convenience for the user when recruiting participants for the itinerary, but also has the advantage of enabling the participants of the itinerary to save on travel expenses. For example, travel expenses can be saved by sharing a means of transportation.

[0030] Incidentally, in the itinerary matching system 10 according to the present embodiment, it is assumed that the multiple registered itineraries will include many variations due to differences in the locations of one or more destinations, the order of stops, etc. However, if the variations in the multiple registered itineraries become too great, it will increase the hassle for the user searching the registered itineraries, and the usability of the itinerary matching system 10 will decrease. This will in turn decrease the possibility of a match being established.

[0031] In particular, there may be two registered itineraries among a plurality of registered itineraries that have slight variations and are identical in many respects. For example, there may be two registered itineraries that have different starting points and ending points but have the same route to one or more destinations excluding the ending point, or two registered itineraries that have the same location of one or more destinations but have a different order of passing through one or more destinations excluding the ending point. The existence of two such registered itineraries increases the hassle for a user searching for registered itineraries.

[0032] On the other hand, in such two registered itineraries, there is a possibility that participants of one registered itinerary may consider participating in the other registered itinerary. In other words, such two registered itineraries may be able to be merged. If they can be merged, the variation of multiple registered itineraries can be reduced, and the inconvenience to users who search for registered itineraries can be reduced. In addition, the possibility of matching can be ensured. In addition, the possibility of matching can be improved in that participants of each of the two registered itineraries can be given an opportunity to match with each other.

[0033] Therefore, the itinerary matching system 10 of this embodiment further includes, as an itinerary matching function, calculating a degree of similarity indicating the degree of similarity between two registered itineraries extracted from a plurality of registered itineraries, and generating a merged itinerary by merging two registered itineraries for which the degree of similarity exceeds a predetermined threshold.

[0034] Here, the degree of coincidence can be, for example, calculated based on the length of the overlapping route between two registered itineraries. An example of calculating the degree of coincidence when the length of the overlapping route between two registered itineraries is used as the index will be described with reference to FIG.

[0035] Fig. 4 shows the routes and a conceptual diagram showing the lengths of the routes for two registered itineraries, registered itinerary 1 and registered itinerary 2. In the two registered itineraries shown in Fig. 4, the route from destination 1 to destination 3 in registered itinerary 1 overlaps with the route from destination 1 to destination 3 in registered itinerary 2.

[0036] In this case, the degree of agreement can be calculated as a value obtained by dividing the length of the overlapping route by the length of the registered itinerary that is the shorter of the two registered itineraries. In the two registered itineraries shown in FIG. 4, the length of the overlapping route is 30 km, the length of registered itinerary 1 is 70 km, and the length of registered itinerary 2 is 40 km. Therefore, the degree of agreement is 30 divided by 40, which is 0.75. The degree of agreement calculated in this way can be considered to give the reproduction rate of the route of the registered itinerary of the other registered itinerary by the registered itinerary of the longer route. For example, in the example shown in FIG. 4, it can be considered that 75% of the route of registered itinerary 2 is reproduced by the route of registered itinerary 1.

[0037] Then, the server 100 generates a merged itinerary when the degree of match calculated in this manner exceeds a predetermined threshold. For example, if the predetermined threshold is 0.7 (70%), the server 100 generates a merged itinerary for the two registered itineraries shown in Fig. 4. The predetermined threshold may be suitably determined according to the environment in which the itinerary matching system 10 according to this embodiment is applied. Alternatively, the predetermined threshold may be configured to be set by the user.

[0038] The generation of the merged itinerary can be performed by adopting a method according to the degree of coincidence to be calculated. For example, when the degree of coincidence that gives the recall is calculated as described above, a route that passes through both starting points and one or more destinations of two registered itineraries can be set as the itinerary of the merged itinerary.

[0039] FIG. 5 shows an example of a merged itinerary generated for two registered itineraries shown in FIG. 4. The route of the merged itinerary shown in FIG. 5 passes through all of the departure points and one or more destination points of both registered itinerary 1 and registered itinerary 2 shown in FIG. 4. In particular, the route of the merged itinerary may be generated by adding the route of the registered itinerary with the shorter length of the two registered itineraries (hereinafter also referred to as the "child itinerary") to the route of the registered itinerary with the longer length of the two registered itineraries (hereinafter also referred to as the "parent itinerary"). For example, the route of the merged itinerary shown in FIG. 5 is generated by adding the route of registered itinerary 2, which is the child itinerary, to the route of registered itinerary 1, which is the parent itinerary. In this case, the merged itinerary may include joining and breaking up with users who were participants of the child itinerary at the departure and destination points of the child itinerary. For example, the route of the merged itinerary shown in Figure 5 has a special note added to it that participants of registered itinerary 2 will join and disband at destinations 1 and 2, which were the starting and ending points of registered itinerary 2. Note that if two registered itineraries are completely identical (100% identical), the merged itinerary may simply combine the two registered itineraries into one registered itinerary.

[0040] The merged itinerary generated in this manner is expected to be convenient for both participants of the two registered itineraries if the degree of coincidence that gives the recall rate is high. In turn, the server 100 can generate a merged itinerary that is highly likely to be considered by participants of both registered itineraries to participate in the merged itinerary. If the two registered itineraries include information other than the route, the information other than the route of the merged itinerary can be, for example, a common part of the two registered itineraries. For example, if the dates of registered itinerary 1 are within the period of 8 / 10-8 / 20 and the dates of registered itinerary 2 are within the period of 8 / 13-8 / 25, the dates of the merged itinerary can be set to be within the period of 8 / 13-8 / 20.

[0041] For this reason, the server 100 may be configured to set predetermined conditions for the two registered itineraries extracted when calculating the degree of similarity. For example, in the case of a registered itinerary as shown in Fig. 2, the predetermined conditions include that the specified dates and times and special notes do not contradict each other, that the dates overlap, that the total number of participants in the two registered itineraries does not exceed the maximum number of participants, and that when merging, the specified dates and times and expected number of days of each registered itinerary are satisfied. By configuring in this way, it is possible to prevent items that are not related to the degree of similarity from causing inconvenience to participants in one of the two registered itineraries in the generated merged itinerary.

[0042] The server 100 inquires of the participants of the two registered itineraries as to whether they accept the merged itinerary thus generated. Then, upon receiving the acceptance of the participants of the two registered itineraries, the server 100 designates the participants of the two registered itineraries as participants of the merged itinerary. Here, the server 100 may be configured to inquire of all participants of the two registered itineraries as to whether they accept the merged itinerary, or may be configured to inquire of only some participants of the two registered itineraries. In addition, the server 100 may be configured to manage the merged itinerary as a registered itinerary that further recruits participants when the number of participants of the merged itinerary does not reach the maximum number or in response to the request of the participants of the merged itinerary. In this case, the merged itinerary may be configured to be extracted as one of the two registered itineraries for which the degree of similarity is calculated.

[0043] As described above, the itinerary matching system 10 according to the present embodiment provides an itinerary matching function.

[0044] 2. Configuration The configuration of the server 100 according to this embodiment will be described below with reference to the drawings.

[0045] Fig. 6 is a block diagram showing a preferred example of the configuration of the server 100 according to this embodiment. In Fig. 6, the server 100 includes a communication unit 110 and a processing unit 120. The communication unit 110 and the processing unit 120 are configured to be able to transmit information to each other. For example, the communication unit 110 and the processing unit 120 are electrically connected via a cable.

[0046] The communication unit 110 communicates with devices external to the server 100 to transmit and receive information. In particular, the communication unit 110 has a function for communicating with a user terminal (typically, connecting to the Internet to communicate with the user terminal). That is, the communication unit 110 allows the server 100 to communicate with the user terminal. In particular, the communication unit 110 receives an itinerary for which registration is accepted from a user, transmits a list of registered itineraries, receives a participation application for a registered itinerary, transmits an inquiry about the participation application, receives an acceptance or rejection of the participation application, transmits the application result, and the like. The information received by the communication unit 110 through communication is transmitted to the processing unit 120.

[0047] The processing unit 120 executes processing related to the itinerary matching function. The processing unit 120 is a computer including a memory 121 and a processor 126.

[0048] The memory 121 stores an itinerary matching program 122, which is coupled to the processor 126 and causes the processor 126 to execute processing related to the itinerary matching function, and various data 124 required for executing the processing. Here, the itinerary matching program 122 is composed of a plurality of instructions 123 executable by the processor 126. In other words, the processing related to the itinerary matching function is realized by the processor 126 operating in accordance with the plurality of instructions 123.

[0049] Information acquired from the communication unit 110 is stored in the memory 121 as data 124. In particular, the data 124 includes a registered itinerary database 125 in which a plurality of registered itineraries are organized into a database. The registered itinerary database may be constructed as a part of the processing related to the itinerary matching function.

[0050] 3. Processing Hereinafter, with reference to the drawings, a process related to a merged itinerary, which is a characteristic process of the itinerary matching function provided by the itinerary matching system 10 according to the present embodiment, will be described.

[0051] Fig. 7 is a flowchart showing an example of a process related to a merged itinerary. The process shown in Fig. 7 is typically executed by the server 100 at a predetermined processing cycle. In the following description, it is assumed that the server 100 separately executes a process of accepting itinerary registration from a user (first process) and a process of managing the registered itinerary.

[0052] In step S200 (second process), server 100 extracts two registered itineraries from among a plurality of registered itineraries that it manages, and calculates the degree of coincidence between the two extracted registered itineraries.

[0053] If the degree of coincidence calculated in step S200 is less than the predetermined threshold (step S210; No), the server 100 ends the current process without generating a merged itinerary. On the other hand, if the degree of coincidence calculated in step S200 is equal to or greater than the predetermined threshold (step S210; Yes), the process proceeds to step S300.

[0054] In step S300 (third process), the server 100 generates a merged itinerary for the two registered itineraries extracted in step S200. After that, the server 100 inquires of each participant of the two registered itineraries whether or not they accept the generated merged itinerary (step S310).

[0055] If either of the participants of the two registered itineraries rejects the request (step S320; No), the server 100 ends the process without managing the merged itinerary. At this time, the server 100 may be configured to delete the generated merged itinerary. On the other hand, if both of the participants of the two registered itineraries accept the request (step S320; Yes), the process proceeds to step S400.

[0056] In step S400 (fourth process), the server 100 sets each participant of the two registered itineraries as a participant of the merged itinerary. Here, the server 100 may be configured to manage the merged itinerary as a registered itinerary. After step S400, the process ends.

[0057] In this manner, the process related to the itinerary matching function is executed by the server 100. Also, in this manner, the server 100 realizes the itinerary matching method.

[0058] 4.Effects As described above, according to this embodiment, an itinerary matching function is provided that matches participants for multiple registered itineraries. Here, each of the multiple registered itineraries may be a general itinerary in which the means of transportation is not limited and the route includes multiple destinations. In particular, according to this embodiment, the degree of agreement is calculated for two registered itineraries extracted from the multiple registered itineraries, and a merged itinerary is generated by merging the two registered itineraries for two registered itineraries whose degree of agreement exceeds a predetermined threshold. Then, with the consent of each participant of the two merged itineraries, each participant of the two registered itineraries is made a participant of the merged itinerary.

[0059] This reduces the variation of multiple registered itineraries, and reduces the hassle for users searching for registered itineraries. As a result, the possibility of matching can be ensured. In addition, participants of two registered itineraries whose degree of match exceeds a predetermined threshold can be given an opportunity to match with each other, improving the possibility of matching.

[0060] The itinerary matching system 10 can also be configured to only match participants based on a merged itinerary. In this case, the itinerary matching system 10 does not register participants based on participation applications, and each user registers an itinerary and waits for matching based on the generation of a merged itinerary.

[0061] The itinerary matching system 10 according to the present embodiment can also be applied to a vehicle dispatching system configured to dispatch an autonomous vehicle according to a registered itinerary. In this case, the itinerary matching function is applied as a function for matching passengers of an autonomous vehicle to be dispatched according to a registered itinerary. That is, in this case, the vehicle dispatching system can provide a carpooling function. In particular, by applying the itinerary matching system 10 according to the present embodiment, the vehicle dispatching system can improve the possibility of matching passengers in the carpooling function, as described above.

[0062] When applying the itinerary matching system 10 according to this embodiment, for example, the server 100 according to this embodiment may be configured to be able to communicate with autonomous vehicles via the communication unit 110. Furthermore, the server 100 according to this embodiment may be configured to transmit a vehicle dispatch plan according to the registered itinerary to the autonomous vehicles upon approval of the participants or representative of the registered itinerary. Then, a vehicle dispatch system that provides a carpooling function can be realized by having the autonomous vehicles autonomously drive according to the received vehicle dispatch plan. [Explanation of symbols]

[0063] 10 Itinerary Matching System 100 Servers 110 Communications Department 120 Processing section 121 Memory 122 Itinerary Matching Program 123 Instructions 124 Data 125 registered itinerary database 126 processors

Claims

1. 1. A journey matching system for providing matching of participants for a journey, comprising: One or more processors; The one or more processors: A first process of accepting registration of the itinerary; A second process of extracting two registered itineraries from the plurality of registered itineraries and calculating a degree of coincidence between the two registered itineraries; a third process of generating a merged itinerary by merging the two registered itineraries when the degree of match exceeds a predetermined threshold; a fourth process of making each of the participants of the two registered itineraries into a participant of the combined itinerary upon receiving consent from each of the participants of the two registered itineraries; It is configured to run The itinerary matching system is characterized by:

2. 2. The itinerary matching system according to claim 1, The one or more processors: A process of accepting a participation application from a user for each of the plurality of registered itineraries; receiving the participation application and accepting an acceptance or rejection of the participation application from the participants of the registered itinerary; adding the user to the list of participants of the target registered itinerary upon receipt of the participant's acceptance of the participation application; is configured to further The itinerary matching system is characterized by:

3. 3. The itinerary matching system according to claim 1 or 2, Each of the plurality of registered itineraries includes information on a route from a departure point to one or more destinations; The second process includes calculating, as the degree of agreement, a value obtained by dividing a length of an overlapping route in the two registered itineraries by a length of the registered itinerary having a shorter length of the two registered itineraries. The itinerary matching system is characterized by:

4. 4. The itinerary matching system according to claim 3, The third process includes setting a route that passes through all of the starting points and the one or more destinations of both of the two registered itineraries as the route of the combined itinerary. The itinerary matching system is characterized by:

5. 1. A method for providing a matching of participants for a trip by a computer, comprising: Accepting registration of the itinerary; extracting two registered itineraries from among a plurality of registered itineraries, and calculating a degree of coincidence between the two extracted registered itineraries; generating a merged itinerary by merging the two registered itineraries when the degree of match exceeds a predetermined threshold; receiving consent from each of the participants of the two registered itineraries, making each of the participants of the two registered itineraries participants of the combined itinerary; Includes The method for matching an itinerary comprises:

6. An itinerary matching program that causes a computer to execute a process for providing matching of participants for an itinerary, A first process of accepting registration of the itinerary; A second process of extracting two registered itineraries from the plurality of registered itineraries and calculating a degree of coincidence between the two registered itineraries; a third process of generating a merged itinerary by merging the two registered itineraries when the degree of match exceeds a predetermined threshold; a fourth process of making each of the participants of the two registered itineraries into a participant of the combined itinerary upon receiving consent from each of the participants of the two registered itineraries; configured to cause the computer to execute The itinerary matching program is characterized by:

Images