JP5011353B2 - Matching system - Google Patents

Description

  The present invention relates to a matching system, and more particularly to a matching system that determines a combination based on each bidirectional request.

  For example, a method for matching in a matching problem between sets having priority in both directions, such as a matching problem between a set of job applicants and a set of companies that accept applicants, is being proposed (for example, Non-patent document 1).

  Here, it is assumed that each applicant has a priority list in which the companies he / she wants to find employment are ranked according to his / her preference, while each company also has a priority list in which applicants who want to accept are ranked. The priority list ROL (a) of the applicant a is a subset of the set of companies, and is a total ordered set ordered by inequality signs that do not include equal signs by rank. Here, if the applicant a prefers p over p ′, p <p ′ is written (specifically, p is first in priority and p ′ is third in priority) In this case, p (= 1) <p ′ (= 3).) The same applies to the priority list ROL (p) for applicants of company p. Each company also has a recruitment frame (capacity) for accepting applicants. The capacity Q (p) of the company p is an integer of 0 or more. The matching X is a set composed of a pair (a, p) of a candidate and a company, and satisfies the following two conditions.

1. For any volunteer a, there are no more than one pair (a, p) containing a in X.
2. For an arbitrary company p, a pair (a, p) including p is equal to or less than Q (p) company capacity in X.

  An example of matching is shown in FIG. In FIG. 21, as a matching between a set of applicants {a1, a2, a3, a4, a5, a6, a7} and a set of companies {p1, p2, p3, p4}, {(a1, p1), ( a2, p3), (a3, p4), (a5, p3), (a6, p4)}. In this matching, applicants a4 and a7 and company p2 have no matching partner.

  FIG. 22 shows an example of a priority list of applicants and companies. In each priority list, the more preferable ones are shown in the above list. In other words, the ranking increases as you go down. In the example of FIG. 22, the applicants place an order of p1 <p4 <p3 for the three companies. The company places the order of a7 <a1 <a4 <a3 <a5 <a6 among the six applicants. Opponents who do not want to match at all are not listed in the priority list.

  The matching problem refers to a problem of finding a combination between a candidate and a company when a set of applicants, a group of companies, and a priority list of applicants and companies are given. The matching method is a solution to the matching problem, that is, a method for obtaining a combination between a candidate and a company. Therefore, the matching system is a system that executes a matching method.

  Moreover, stability can be defined for the above matching. The matching X is stable when the following two conditions are both satisfied.

1. All applicants (businesses) will only match the companies (applications) on their priority list.
2. Of all pairs (a, p) of the applicant and the company, none of them is included in the matching X is a blocking pair. Here, the blocking pair satisfies both of the following three conditions.
2.0. a is described in the priority list of p, and p is described in the priority list of a.
2.1. In X, a does not match any company, or in X, a matches p ′, and p <p ′ holds in the priority list of a.
2.2. The number of applicants matching p in X is less than the capacity Q (p), or there is a candidate a ′ that matches p in X, and a <a ′ in the priority list of p Holds.

  In the matching problem, a method for generating a stable matching is required. When unstable matching is obtained, there is a candidate or company that matches with a partner that is not listed in the priority list, that is, a partner that is not desired at all, or there is a blocking pair. Unstable matching is not fair because both the candidate and the company making up the blocking pair are more likely to have a blocking pair partner than the obtained matching. In other words, the method for generating unstable matching loses the reliability for matching, and impairs the intention of the matching target person to participate in the matching.

  FIG. 23 is a flowchart showing a conventional matching method using the Gale-Shapley algorithm described in Non-Patent Document 1. The feature is that all applicants make proposals in order, starting with the company with the lowest ranking in their priority list (ie, the first choice).

  Before the description of FIG. 23, the outline will be briefly described with reference to FIG. The example in FIG. 24 assumes a matching problem between a set of four hospitals and a set of eight applicants who wish to find employment in those hospitals. All applicants, from Akashi to Kudo, make proposals in order, starting with the company with the lowest ranking in their priority list.

Mr. Akashi first proposed to Futagawa Hospital. First, Mr. Akashi proposed to Futagawa Hospital. In both hospitals, Akashi is fourth in the priority list, so (Akashi, Futagawa Hospital) is provisionally matched.
Next, Mr. Inoue makes a proposal. In Mr. Inoue's priority list, since the first hope is Futagawa Hospital, Mr. Inoue proposes to Futagawa Hospital. At Futagawa Hospital, Ms. Inoue is fifth in the priority list, and there are two Futagawa Hospitals available for one person, so (Inoue, Futagawa Hospital) is provisionally matched.
Next, Ueno-san makes a proposal. In Mr. Ueno's priority list, the first hope is Futagawa Hospital, so Mr. Ueno proposes to Futagawa Hospital. At Futagawa Hospital, Mr. Ueno is 6th in the priority list, and there is no available space in Futagawa Hospital, so he proposes to the second desired hospital in the priority list. In Uchiyama Hospital, the second choice, Ueno is ranked first, so (Ueno, Ichiyama Hospital) is provisionally matched.

Next, Mr. Eguchi proposes to Ichiyama Hospital in the first hope, but because Mr. Eguchi is not in the priority list of Ichiyama Hospital, it is rejected and proposed to Futagawa Hospital in the second hope. Because it is 7th in the priority list of Futagawa Hospital and there is no capacity, it is rejected, and when it is proposed to the 3rd hope Mimura Hospital, it is named 6th (Eguchi, Mimura Hospital) Are provisionally matched.
Next, Mr. Okawa proposes to the first hope of Futagawa Hospital. Okawa is third in the Futagawa Hospital's priority list. The capacity is two people, and two people have already been provisionally matched. However, provisionally matched are Mr. Akashi 4th in the priority list and Mr. Inoue 5th. For this reason, Mr. Inoue with the highest ranking is excluded, and (Okawa, Futagawa Hospital) is provisionally matched.
Excluded, Inoue-san proposes again to the hospital with the lowest ranking in his priority list after Futagawa Hospital. The hospital is Ilsan Hospital. However, it is rejected because Mr. Inoue's name is not in the priority list of Ilsan Hospital. Mr. Inoue has been rejected by all hospitals because only the second request is registered in Mr. Inoue's priority list.

Next, Mr. Kawaguchi's processing is performed. In Kawaguchi's priority list, since the first hope is Futagawa Hospital, Mr. Kawaguchi proposes to Futagawa Hospital. At Futagawa Hospital, Mr. Kawaguchi is 8th in the priority list, and because there are no vacancies in Futagawa Hospital, he proposes to the second desired hospital in the priority list. In the priority list of the second choice Mimura Hospital, Kawaguchi-san is not named, so it is rejected. Similarly, at the third hope Ichiyama Hospital, the fourth choice Yotsuya Hospital has the name in the 6th place in the priority list, so (Kawaguchi, Yotsuya Hospital) is provisionally matched.
Next, Kimura proposes to Futagawa Hospital, the first hope. Mr. Kimura is first in the Futagawa Hospital priority list. The capacity is two people, and two people have already been provisionally matched. However, it is temporarily matched that Mr. Akashi 4th in the priority list and Mr. Okawa 3rd. For this reason, Mr. Akashi, who has the highest ranking, is excluded and (Kimura, Futagawa Hospital) is provisionally matched.

Excluded, Akashi-san re-proposes to the hospital with the lowest ranking in his priority list next to Futagawa Hospital, but only the first desired Futagawa Hospital is registered in Akashi-san's priority list. As a result, Akashi was rejected by all hospitals.
Next, Mr. Kudo proposes to Yotsuya Hospital, the first hope. In the priority list of Yotsuya Hospital, Kudo is fifth. There are two people, and one person has already been provisionally matched, but there is one room available. Therefore, (Kudo, Yotsuya Hospital) is provisionally matched.

Here, since all applicants are provisionally matched with one of the hospitals or rejected from all the hospitals listed in their own priority list, the processing ends.
Matching results are (Okawa, Futagawa Hospital), (Kimura, Futagawa Hospital), (Ueno, Ichiyama Hospital), (Eguchi, Mimura Hospital), (Kawaguchi, Yotsuya Hospital), (Kudo, Yotsuya Hospital) As a result, Akashi and Inoue were rejected by all hospitals listed on their priority list.

This processing performed by taking FIG. 24 as an example will be described using the flowchart of FIG. In step S100, provisional matching is made an empty set in advance. In step S101, if there is no unprocessed applicant, the process ends. If there is, the following process is performed for one of the applicants a. In step S102, the index a. Indicates which number of companies in the priority list ROL (a) the applicant a proposes to a. Set i to 1. This indicates that all applicants, in turn, first propose to the company with the lowest ranking in their priority list. In step S103, the number of elements in the priority list ROL (a) is a. If it is smaller than i, the candidate a has finally failed to match any company, and the process returns to step S101. On the other hand, in step S103, the number of elements in the priority list ROL (a) is a. If it is not smaller than i, in step S104, a. Let the i-th company be p. If a is not included in the priority list ROL (p) of p in step S105, a. i to a. The setting is reset to i + 1, and the process returns to step S103. This is because the proposed company p rejects if the proposed applicant a is not listed in the ROL (p), and the rejected applicant a is ranked in the company's priority list ROL (a). This is equivalent to reproposing to the next smaller company after p. On the other hand, if a is included in the priority list ROL (p) of p in step S105, in step S106, the number of applicants whose p is temporarily matched at that time must be less than the capacity Q (p). For example, the pair (a, p) is added to the provisional matching, and the process returns to step S101. On the other hand, in step S106, if the number of applicants for which p is provisionally matched at that time is not less than the capacity Q (p), in step S107, among the candidates who are provisionally matched with p, The priority list ROL (p) having the highest rank is defined as a1. The ranking in ROL (p) is compared between a1 and the proposal candidate a. If the rank of a is higher, a. i to a. The setting is reset to i + 1, and the process returns to step S103. This corresponds to the company p rejecting a if the rank of a is higher. The rejected applicant a will propose again to the company with the lowest rank in his priority list ROL (a) next to p. After this step S107, the number of applicants temporarily matching with the company p is equal to the capacity Q (p). In step S108, since the rank of a1 is higher than the rank of a, the pair (a, p) is added to the temporary matching, the pair (a1, p) is excluded from the temporary matching, and a is reset to a1. In step S109, a. i to a. The setting is reset to i + 1, and the process returns to step S103. In other words, the candidate (original a1) excluded from the provisional matching proposes again to the company with the lowest rank in his priority list next to p. The process of FIG. 23 ends when all applicants are provisionally matched with any company or rejected from all companies listed in their priority list in step S101. is there. The provisional matching finally obtained at the stage when the processing of FIG. Note that Non-Patent Document 1 describes that matching obtained by the Gale-Shapley algorithm is stable.
As described above, in a conventional matching system, a one-to-one combination such as a candidate and a company is obtained by the well-established Gale-Shapley algorithm when a stable matching result is obtained.

  By the way, if the number of applicants matched to a certain company is equal to the number of companies on the company side, increasing the number of companies and further matching may increase the number of applicants matched to that company. Come. Therefore, due to fluctuations in the number of applicants, the overall match rate on the applicant side (the ratio of the number of applicants matched to any company to the total number of applicants) and the company's capacity full rate (total There is a possibility of an improvement in the number of matches (the ratio of the number of candidates matched to any company) to the total number of companies.

“The Stable Marriage Problem”, D.M. Gusfield and R.W. W. Irving, The MIT Press, 1989, p. 9

  As described above, there is a possibility of improving the match rate and the number of matches by changing the number of seats. However, in the conventional matching system, the number of capacities set once cannot be changed, and it is not possible to expect an improvement in match rate and an increase in capacity full rate.

  The present invention has been made to solve such a problem, and in a matching system in which the elements of the set A and the elements of the set B are matched, the set number of elements of the set A is changed. The object is to obtain a matching system that can improve the match rate on the element side of B and the capacity fullness on the element side of set A.

  The matching system according to the present invention is a matching system for matching each element of a set A composed of a plurality of A elements and a set B composed of a plurality of B elements, and is a B element of each B element of the set B For each ID, a quorum file storing the number of matching and the upper limit of the quorum, and a quorum transfer information file storing priority in the quorum transfer process corresponding to the B element ID of each B element of the set B First priority list storing a first priority list uniquely ranked for all or part of B elements of set B for each A element ID of each A element of set A A second priority storing a second priority list uniquely ranked for all or part of the A elements of the set A for each B element ID of the file and each B element of the set B Degree list file and The first matching means, the first matching means, based on the first priority list file, the second priority list file, and the quorum stored in the quorum file, sets A A matching process is performed to match the A element of any one of the B elements included in the set B, and the first matching means stores the number of matching processes performed so far in the temporary matching result storage file. The first matching means further stores, for each B element ID, the quorum of the B element and the number of matches that is the number of A elements matched to the B element. A first matching processing means stored in a file and a capacity transfer means for performing a capacity transfer process, the capacity transfer means being stored in the temporary matching result storage file; Based on the number of matches and the number of matches for each B element ID in the last matching process performed, and the priority stored in the capacity transfer information file, the capacity increase B element ID and the capacity decrease B element ID are determined. The capacity transfer process is performed when the number of matches for the capacity increase B element ID is equal to the capacity for the capacity increase B element ID and the capacity decrease B element ID. In addition to increasing the number by a predetermined amount, the number of capacity decrease B element ID is decreased by a predetermined amount, and the capacity transfer means further increases the number of capacity of each B element ID after the capacity transfer process. Capacity transfer means for storing in a temporary matching result storage file, a first priority list file, and a second priority list file as the number of each B element in the matching process to be performed And a new matching of an element of set A against any element of set B based on the number of each B element stored in the newly executed matching process stored in the temporary matching result storage file A matching system comprising a second matching processing means for performing processing, wherein the processing of the capacity transfer means and the second matching processing means is performed until a predetermined end condition is satisfied. It is characterized by that.

The B element of the set B constitutes a group of one or more B elements, and the capacity transfer information file corresponds to the B element ID of each B element of the set B, and the priority order of the capacity transfer process in the group The capacity transfer process may be performed only between the B elements included in the same group.
The B element of the set B constitutes a group of one or more B elements, and the capacity file further stores the upper limit of the group capacity for each group, and the capacity transfer process includes the capacity transfer process. Even if it is performed only when the total number of capacity for each B element in the group to which the capacity increase B element ID belongs does not exceed the group capacity upper limit of that group Good.
The temporary matching result storage file further stores a transfer history indicating that the capacity has been transferred from the capacity reduction B element ID to the capacity increase B element ID each time the capacity transfer process is executed. It may be performed only when there is no transfer history indicating that the capacity has been transferred from the capacity increase B element ID to the capacity decrease B element ID.

  According to the present invention, by changing the number of elements of the set B elements, a matching system that can improve the match rate on the element side of the set A and the capacity full rate on the element side of the set B is obtained. Can do.

It is the block diagram which showed the structure of the whole matching system which concerns on Embodiment 1 of this invention. It is the block diagram which showed the internal structure of each component which comprises the matching system which concerns on Embodiment 1 of this invention. It is explanatory drawing which showed an example of the training program information file of the matching system which concerns on Embodiment 1 of this invention. It is explanatory drawing which showed an example of the capacity transfer information file of the matching system which concerns on Embodiment 1 of this invention. It is explanatory drawing which showed an example of the participant ROL file of the matching system which concerns on Embodiment 1 of this invention. It is explanatory drawing which showed an example of the training program ROL file of the matching system which concerns on Embodiment 1 of this invention. It is explanatory drawing which showed an example of the temporary matching result storage file of the matching system which concerns on Embodiment 1 of this invention. It is explanatory drawing which showed an example of the matching result storage file of the matching system which concerns on Embodiment 1 of this invention. It is the flowchart which showed the flow of the process of the matching system which concerns on Embodiment 1 of this invention. It is the flowchart which showed the flow of the process of the matching system which concerns on Embodiment 1 of this invention. It is the flowchart which showed the flow of the process of the matching system which concerns on Embodiment 1 of this invention. It is the flowchart which showed the flow of the process of the matching system which concerns on Embodiment 1 of this invention. It is the flowchart which showed the flow of the process of the matching system which concerns on Embodiment 1 of this invention. It is explanatory drawing which showed an example of the capacity transfer information file of the matching system which concerns on Embodiment 2 of this invention. It is explanatory drawing which showed an example of the temporary matching result storage file of the matching system which concerns on Embodiment 2 of this invention. It is the flowchart which showed the flow of the process of the matching system which concerns on Embodiment 2 of this invention. It is explanatory drawing which showed an example of the training program information file of the matching system which concerns on Embodiment 3 of this invention. It is explanatory drawing which showed an example of the temporary matching result storage file of the matching system which concerns on Embodiment 3 of this invention. It is explanatory drawing which showed an example of the temporary matching result storage file of the matching system which concerns on Embodiment 4 of this invention. It is the flowchart which showed the flow of the process of the matching system which concerns on Embodiment 4 of this invention. It is explanatory drawing which showed an example of the matching in the conventional matching method. It is explanatory drawing which showed an example of the priority list | wrist in the conventional matching method. It is the flowchart which showed the flow of the process of the conventional matching method. It is explanatory drawing which showed the conventional matching method.

Embodiment 1 FIG.
The matching system according to Embodiment 1 of the present invention is a system for determining a combination of a participant and a facility. For example, for example, medical graduates who wish to train (hereinafter referred to as participants) are medical training facilities (that is, university hospitals, general hospitals, etc., hereinafter referred to as facilities). )), It is necessary to experience training.

In addition, facilities (hospitals) have different departments (general medicine, cardiovascular medicine, cardiac surgery, pediatrics, female medical care, etc.). In the present embodiment, a specific department (cardiac surgery at hospital A, general surgery at hospital B, etc.) at a specific facility is called a “training program”, and the participants and the training program are matched. Shall.
The facility sets a capacity for each training program so that the capacity of the facility is the total of all training programs. Participants specify in which training programs they want to receive training, and the facility specifies which participants want to accept each training program.
As a result of the matching process, participants are matched to the training program. As a specific example, participant 1 is matched with training program A0001 (cardiac surgery at hospital A), and participant 2 is matched with training program B0001 (general medicine at hospital B).

In the present embodiment, the number of participants matched to one training program is increased by increasing or decreasing the number of persons in one training program based on the upper limit and the priority order of the number of training programs. It is characterized by gaining possibilities. As a result, the matching system as a whole can be expected to improve the match rate on the participant's side and the capacity full rate on the facility side.
The number of matches indicates the total number of participants matched to each training program. The match rate indicates the ratio of the number of participants matched to any training program to the total number of participants. In addition, the capacity full rate indicates the ratio of the number of matches (the total number of matches of any participant in the training program) to the total number of all training programs.

  FIG. 1 is a diagram showing an overall configuration of a matching system according to Embodiment 1 of the present invention. As shown in FIG. 1, the matching system according to the first embodiment includes a matching server 100 for performing a matching process for determining a combination of a participant and a facility, and a matching management for performing management and maintenance of the matching server 100, etc. The participant terminal 400, the participant terminal 200 for the participant to operate to input the desired order of facilities, etc., and the facility manager working for the facility to operate the participant's desired order for the training program, etc. It consists of a facility manager terminal 300 for inputting. The matching server 100, the participant terminal 200, the facility manager terminal 300, and the matching manager terminal 400 are connected by a communication network 500 such as the Internet.

  FIG. 2 is a diagram showing an internal configuration of each component shown in FIG. As shown in FIG. 2, in the matching server 100, a training program information file (capacity file) 1, a capacity transfer information file 2, a participant ROL file (first priority list file) 3, a training program Six files of a program ROL file (second priority list file) 4, a temporary matching result storage file 5, and a matching result storage file 6 are stored. These may be stored in one common storage device, or may be stored in a plurality of storage devices. Further, in the matching server 100, a communication means 7 for performing communication with the outside via the communication network 500, a ROL creation means 8 for creating a ROL file, and a capacity transfer means 9 for performing processing relating to the capacity transfer, Matching means 10 is provided.

  FIG. 3 is a diagram showing an example of the training program information file 1. The training program information file 1 stores information on each training program. That is, the training program information file 1 includes a “training program number” for identifying each training program, a “capacity (number of participants that can be accepted)” of the training program, an upper limit for the number of participants (maximum number of participants) Information such as “facility code”, “facility name”, “facility address (location of facility)”, which is an ID for identifying the facility where the training program is implemented, is stored. Although not shown in FIG. 3, information on the training program is also stored. As will be described later, the “capacity” means a temporary capacity that is adjusted in the capacity transfer process described later. For example, in the initial stage (first matching stage), the desired number of persons as viewed from the facility side. Yes, in the second and subsequent matchings, this corresponds to the number of people determined in the capacity transfer process described later. The “upper limit of capacity” is the upper limit of the capacity that fluctuates due to the adjustment, and represents the upper limit of the number of persons that can actually be matched to the training program in consideration of, for example, facility restrictions.

  FIG. 4 is a diagram showing an example of the capacity transfer information file 2. The capacity transfer information file 2 stores a “training program number” for identifying a training program and “ranking” information of the training program. Corresponding to the training program number, the priority order of the capacity transfer process is stored. The rank information is a numerical value assigned to the number of training programs in order from the first place in order to increase the capacity when carrying out the capacity transfer process. In the present embodiment, it is input from the matching manager terminal 400, transmitted from the communication unit 33 to the communication unit 7, and stored in the capacity transfer information file 2.

  FIG. 5 is a diagram showing an example of the participant ROL file 3. The participant ROL file 3 stores, for each “user ID”, a list in which “training program numbers” desired by each user are arranged in a desired “rank”. In FIG. 5, training programs from the first desire to the nth desire are stored in order for each user. Each user obtains information on each facility from, for example, a homepage on the Internet and determines a desired order. Note that all the facilities may be registered in the participant ROL file 3 or some of the facilities may be registered. Each user can register up to facilities of an arbitrary rank.

  FIG. 6 is a diagram showing an example of the training program ROL file 4. The training program ROL file 4 stores a list in which participants desired by each facility are arranged in order of preference for each training program. In FIG. 4, for each “training program number” of each facility, participants “user IDs” from the first desire to the n-th preference are stored in order of “rank”. Each facility, for example, interviews participants and obtains information on the participants, and determines a desired order. In addition, all the participants may be registered into the training program ROL file 4, or some participants may be registered. In addition, each facility can register up to participants of any order.

  FIG. 7 is a diagram showing an example of the temporary matching result storage file 5. The temporary matching result storage file 5 stores temporary matching results. The result of provisional matching includes the number of matching processes performed so far. In addition, the temporary matching result includes the number of training program numbers for each training program number and the number of matches that is the number of participants matched to the training program number. Specifically, “Matching Count”, “Training Program Number”, “Capacity”, “Match Number” are stored, and the capacity for each training program number at that time is determined by the information indicating the number of matchings. The number and the number of matches are stored. In this embodiment, every time provisional matching is performed, the temporary matching information is added to the temporary matching result storage file 5, and a record is added. May be stored.

FIG. 8 is a diagram showing an example of the matching result storage file 6. The matching result storage file 6 stores the matching results obtained as a result of the matching process. That is, as shown in FIG. 8, the “user ID” for each “number of times of matching” and the “training program number” of the assigned training are stored in association with each other. Thereby, it is possible to confirm which participant performs which training. In the configuration shown in FIG. 8, the combination obtained by repeating the matching is stored for each number of times of matching. However, only the combination obtained by the previous matching may be stored.
In the file structure shown in FIGS. 3 to 8, one line in the line direction (horizontal direction) is called a record.

Returning to the description of FIG. As shown in FIG. 2, an input unit 20, a display unit 21, a processing unit 22, and a communication unit 23 are provided in the participant terminal 200. The communication unit 23 exchanges data with the communication unit 7 of the matching server 100, transmits the participant ROL file information, and receives the input acceptance completion notification.
In addition, since the internal structure of the facility manager terminal 300 is the same as that of the participant terminal 200, description is abbreviate | omitted here.

  In the matching manager terminal 400, an input unit 30, a display unit 31, a processing unit 32, and a communication unit 33 are provided.

  Next, the operation of the matching system according to the first embodiment will be described. FIG. 9 is a diagram showing data input processing from the matching manager terminal 400, and processing when the matching manager registers, adds, or deletes the training program information file 1 or the capacity transfer information file 2. Shows the flow. As shown in FIG. 9, first, the processing means 32 of the matching manager terminal 400 transfers the input data received by the input means 30 to the communication means 33 by the operation of the matching manager (step S1). Next, the communication unit 33 of the matching manager terminal 400 transmits the input data to the communication unit 7 of the matching server 100 (step S2). Next, the communication means 7 of the matching server 100 adds, updates, or deletes data in the training program information file 1 or the capacity transfer information file 2 according to the received data content (step S3).

  FIG. 10 is a diagram showing a data input process from the participant terminal 200, and shows a process flow when the participant inputs a priority list (ROL file) indicating a desired order. As shown in FIG. 10, first, the processing means 22 of the participant terminal 200 delivers the input data received by the input means 20 to the communication means 23 by the participant's operation (step S11). Next, the communication means 23 of the participant terminal 200 transmits the input data to the communication means 7 of the matching server 100 (step S12). Next, the communication unit 7 of the matching server 100 passes the received data content to the ROL creation unit 8, and the ROL creation unit 8 adds, updates, or deletes data in the participant ROL file 3. That is, one or more records storing “user ID”, “training program number”, and “rank” corresponding to the corresponding user ID are overwritten on the participant ROL file 3 (step S13).

  Further, when receiving data input to the training program ROL file 4 from the facility manager terminal 300, the flow is the same as the flowchart shown in FIG. Note that the process of adding, updating, and deleting data in the training program information file 1, the capacity transfer information file 2, the participant ROL file 3, and the training program ROL file 4 can also be performed from the matching manager terminal 400. In that case, the data other than the capacity transfer information file 2 is transferred to the administrator in a file format by some storage medium, and the administrator performs a file update operation collectively from the matching administrator terminal 400. Information stored in the capacity transfer information file 2 is input from the matching manager terminal 400 by the manager.

FIG. 11 is a diagram showing the flow of the entire matching process in the present embodiment.
Processing is started, and the matching means 10 uses the variable n to represent the number of matching processes, sets the initial value of n to 1 (step S21), and uses the Gale-Shapley algorithm to register the training program information file 1 and the participants. Based on the ROL file 3 and the training program ROL file 4, matching processing is performed. As the matching result, the number of matches and the number of matches for each training program number are stored in the temporary matching result storage file 5 as a result of “matching count 1” (step S22). The number of people stored at this time is the same as the number of people stored in the training program information file 1.

Next, the number of times of matching is increased by 1, that is, n = n + 1 (step S23), and information indicating that the next matching process to be performed is the nth time is handed over to the capacity transfer means 9, and the capacity transfer means 9 Performs a capacity transfer process (step S24).
Subsequently, it is confirmed whether or not the matching process end condition is satisfied (step S25). If the end condition is satisfied, the process ends. At the end, a combination of data stored in the matching result storage file 6 and having the maximum number of matching times is set as a matching result. The end condition can be set arbitrarily, but as an example, when the overall match rate exceeds a certain value, or when the number of training programs reaches the upper limit due to the transfer process, When the transfer process cannot be performed, the transfer process is performed a certain number of times.
“Transfer processing cannot be performed” indicates that the number of programs for each program is set again at the end of step S24. After the process of step S24, the provisional matching result storage file 5 is referred to, and the combination of the training program number and the number of persons with the maximum number of matchings (the number of persons obtained in the process of the immediately preceding step S24) is determined. Compared to the combination of training program and capacity for each matching number of times, if the combination of training program and capacity for any number of matching times is the same, the combination of training program and capacity is set up completely. That's right. This state is called “cannot be transferred”, and by adding the above processing, it can be confirmed whether the state is “cannot be transferred”.

  When it is determined in step S25 that the matching unit 10 does not satisfy the termination condition, the matching unit 10 thereafter refers to the capacity changed by the capacity transfer process from the temporary matching result storage file 5, performs the matching process, The matching result storage file 6 stores the current number of matching times and the matching result. In addition, the number of matches for each training program is stored in a record in the temporary matching storage file 5 in which the current matching count matches the “matching count” item in the temporary matching storage file 5 (step S26). Thereafter, the process returns to step S23, and the process is repeated until the end condition of step S25 is satisfied.

As an initial process, the matching processing means 10 matches the participant to the training program based on the number of participants stored in the participant ROL file 3, the training program ROL file 4, and the training program information file 1, and uses the matching information. The temporary matching result storage file 5 stores the number of matching times, the training program number, the number of people, and the number of matches. The matching processing means that performs this processing is called a first matching processing means.
Next, the capacity transfer means is stored in the temporary transfer result storage file 5 and is stored in the capacity transfer information file 2 for each training program in the last matching process performed so far. Capacity increase training program number (training program number with rank equal to priority m, capacity increase B element ID) and capacity decrease training program number (training program number with rank equal to reverse priority M) , Capacity reduction B element ID) is determined, and capacity transfer processing is performed. In this capacity transfer process, when the number of matches for the capacity increase training program number is equal to the number of capacity for the capacity increase training program number and the capacity decrease training program number, In the example, the number is increased by 1), and the number of capacity reduction training program numbers is decreased by the same amount (in this example, 1 person). In addition, the transferred capacity number is stored in the temporary matching result storage file 5 as the capacity number in the newly performed matching process.
Next, the matching processing means 10 performs a new matching process between the participant and the training program based on the new capacity numbers stored in the participant ROL file 3, the training program ROL file 4, and the temporary matching result storage file 5. Do. The matching processing means for performing this process is called a second matching processing means.
Further, the processing of the capacity transfer means and the second matching processing means is performed until a predetermined end condition is satisfied.

  FIG. 12 is a diagram showing details of the capacity transfer process in “FIG. 11 Step S24”. Start processing, refer to training program information file 1 (“Capacity”, “Capacity upper limit” items) and capacity transfer information file 2 (“Rank” item for each “Training program number”), and store temporary matching results The number of matches and the number of matches for each n-1 training program number in file 5 are temporarily stored in the storage device (step S31). In the processing of FIG. 11, the changing number of people is called “fluctuating number of people”. That is, the variable capacity number is a temporarily variable capacity number after the provisional matching result is obtained based on a certain capacity number and before the capacity number to be used for the next matching is determined. In the initial stage, the variable capacity number is stored in the storage device in correspondence with the training program number, and the variable capacity number is overwritten and stored during the capacity transfer process.

  Next, the priority m is set as a variable corresponding to the “rank” item of the capacity transfer information file 2. The initial value of the priority m is 1. As for the “order” of the capacity transfer information file 2, transfer processing is performed in order from the smallest number. That is, the transfer process is given priority in the order of 1, 2, 3,. Here, M is a reverse priority (a variable indicating a low priority), and the initial value of M is set to the maximum value of the priority (in the capacity transfer information file 2 illustrated in FIG. 4, the priority m (The initial value of the reverse priority M is 7) (step S32).

The upper limit of the number of training program information files 1, the temporarily stored number of training program numbers for each (n-1) th training program number, and the number of matches are sequentially based on the order stored in the capacity transfer information file 2. Referring to it, it is determined whether the number of matches of training program numbers having a rank equal to the priority m is equal to the capacity (step S33), and then it is determined whether the variable capacity is smaller than the upper limit (step S34). If it is determined in any of steps S33 and S34 that the condition is not satisfied, m is incremented by 1 (m = m + 1, step S40), and the determination in step S41 is performed.
When the conditions are satisfied in both steps S33 and S34, in order to determine whether the number of training programs having a rank equal to the reverse priority M can be reduced, the number of matches in the reverse priority M training program is: It is determined whether the training program is smaller than the current variable capacity (that is, whether the training program with reverse priority M is 1 or more) (step S35). If it is smaller, transfer from reverse priority M is possible. Therefore, 1 is subtracted from the number of training programs with reverse priority M, and 1 is added to the number of training programs with priority m (step S36). In this way, the capacity transfer process is performed. In the process of step S36, the capacity number after the transfer process is overwritten with the variable capacity number and stored. If it is determined in step S35 that the number of matches with priority M is greater than or equal to the variable capacity, transfer processing cannot be performed from the training program with priority M, and 1 is subtracted from priority M (M = M The process proceeds to step S38) and step S39.

After the transfer process in step S36, it is determined whether or not the empty capacity of the training program with the reverse priority M is 0 (that is, whether the variable capacity is equal to the number of matches) (step S37). Next, it is determined whether the variable capacity of the training program with the priority m has reached the upper limit of capacity (whether the variable capacity is equal to the upper limit of capacity) (step S39). If it is determined that it has not reached, then “m is greater than the maximum priority value (in the example of FIG. 4, it is 7 in the quota transfer information file 2)” or “M is less than 1” It is determined whether or not either is satisfied (step S41), and when either is satisfied, the capacity transfer process for the number of matching times n is completed, and the temporarily stored variable capacity number is used in the number of matching times n. The number of powers to be stored is stored in the temporary matching result storage file 5 (step S42).
If none of the conditions is satisfied in step S41, the process returns to step S33 in order to continue the transfer process for the matching count n.
If it is determined in step S37 that the value is 0, the process proceeds to step S38. If it is determined in step S39 that the variable number of training programs with the priority m has reached the upper limit, m is incremented by 1 (m = m + 1, step S40). The process proceeds to step S41.
In this way, in the process shown in FIG. 12, the transfer process for the number of qualifiers in the next n-th matching process is performed.

The above operations are summarized as follows. That is, the capacity transfer means 9 is stored in the temporary transfer result storage file 5 and is stored in the capacity transfer information file 2 and the number of matches and the number of matches for each training program number in the last matching process performed so far. Based on the priority, the capacity increase training program number (training program number having a rank equal to priority m, the capacity increase B element ID) and the capacity reduction training program number (training program having a priority equal to reverse priority M) Number, capacity reduction B element ID) is determined, and capacity transfer processing is performed. In this capacity transfer process, when the number of matches for the capacity increase training program number is equal to the number of capacity for the capacity increase training program number and the capacity decrease training program number, In the example, the number is increased by 1), and the number of capacity reduction training program numbers is decreased by the same amount (in this example, 1 person).
The number-of-capacity training program number determined in the order equal to the priority m and the capacity-reduction training program number determined in the order equal to the reverse priority M are based on the priority order stored in the capacity transfer information file 2. It is determined. However, in the present embodiment, in the priority order stored in the capacity transfer information file 2, the lower training program number may become the capacity increase training program number, and the upper training program number may become the capacity reduction training program number. This is because processing is performed so as to allow the priority m to be a numerical value greater than the priority M, and by performing such processing, more capacity transfer processing can be executed.

The processing shown in FIG. 12 will be illustrated with reference to FIGS. As a result of the first matching count, when the result shown in FIG. 7 is obtained, how the quorum to be used in the second matching count is set will be described. In the following, an example is shown in which the number of quotas to be used in the second matching count is determined by a total of 11 quota transfer processes. FIG. 7 shows the first, second, third, seventh, eighth, and ninth times. It shows the situation of how the variable capacity changes due to the capacity transfer process.
(First time)
First, in A0003 having a rank 1 corresponding to the priority m = 1, the first match number and the capacity number are equal to 10, and the variable capacity number 10 has not reached the capacity upper limit 13, so in step S34 It is set as a candidate for capacity increase. Next, A0001 having rank 7 corresponding to reverse priority M = 7 is set as a candidate for capacity reduction in step S35 because the number of matches does not reach the variable capacity. In step S36, the variable capacity of A0003 is increased from 10 to 11, and the variable capacity of A0001 is decreased from 10 to 9. The variable capacity is overwritten in the storage device.
In A0001, the empty capacity is not 0 (step S37), the variable capacity of A0003 has not reached the upper limit of capacity (step S39), m is larger than the maximum priority value (7), or M is smaller than 1. Since there is not (step S41), it returns to the process of step S33.

(Second time)
In A0003 with priority m = 1, the number of matches and the number of matches for the first time are equal to 10, respectively, and the variable capacity 11 does not reach the maximum capacity 13 so that it is set as a candidate for capacity increase in step S34. . Next, for A0001 with reverse priority M = 7, since the number of matches 8 has not reached the variable capacity 9 (step S35), the variable capacity of A0003 is increased from 11 to 12 in step S36. Will be reduced from 9 to 8. The variable capacity is overwritten in the storage device.
Since A0001 has a vacant capacity of 0 (the variable capacity becomes equal to the number of matches) (step S37), M is set to 6 (step S38), and the variable capacity of A0003 does not reach the maximum capacity ( In step S39), m is larger than the maximum priority value (7) or M is not smaller than 1 (step S41), so the process returns to step S33.
At this time, the variable capacity of A0001 is determined to be 8.

(3rd)
For A0003 with priority m = 1, the number of matches and the number of matches for the first time are equal to 10, respectively, the variable capacity number 12 does not reach the maximum number of capacity 13, and A0002 with reverse priority M = 6 Since 5 has not reached the variable capacity of 10 (step S35), in step S36, the variable capacity of A0003 is increased from 12 to 13, and the variable capacity of A0002 is decreased from 10 to 9.
In A0002, the empty capacity is not 0 (step S37), and since the variable capacity of A0003 has reached the upper limit (step S39), m is set to 2 (step S40), and m is the maximum priority ( 7) Since it is larger or M is not smaller than 1 (step S41), the process returns to step S33.
At this time, the variable capacity of A0003 is determined to be 13.

(4th)
For B0001 with priority m = 2, the first number of matches and the number of matches are not equal (step S33), so m is set to 3 (step S40), and m is greater than the maximum priority value (7). Or M is not smaller than 1 (step S41), the process returns to step S35.
At this time, the fluctuation capacity number of B0001 is determined to be 5 without fluctuation.

(5th)
For C0001 with priority m = 3, the first number of matches and the number of matches are not equal (step S33), so m is set to 4 (step S40), and m is greater than the maximum priority value (7). Or M is not smaller than 1 (step S41), the process returns to step S35.
At this time, the fluctuation capacity number of C0001 is determined to be 8 without fluctuation.

(6th)
For B0002 with priority m = 4, the first number of matches and the number of matches are not equal (step S33), so m is set to 5 (step S40), and m is greater than the maximum priority value (7). Or M is not smaller than 1 (step S41), the process returns to step S35.
At this time, the fluctuation capacity of B0002 is determined to be 10 without fluctuation.

(7th)
C0002 with priority m = 5 has a match number and a capacity number equal to 5, and the variable capacity number 5 has not reached the maximum capacity limit of 8, and is set as a candidate for capacity increase in step S34. Next, A0002 with reverse priority M = 6 is set as a candidate for capacity reduction in step S35 because the number of matches does not reach the variable capacity of 9. In step S36, the number of C0002 is increased from 5 to 6, and the number of A0002 is decreased from 9 to 8.
In A0002, the empty capacity is not 0 (step S37), the variable capacity of C0002 has not reached the upper limit (step S39), m is greater than the maximum priority value (7), or M is less than 1 Since there is not (step S41), it returns to the process of step S33.

(8th)
C0002 with a priority m = 5 has a match number and a capacity number equal to 5, and the variable capacity number 6 has not reached the maximum capacity limit of 8, and is set as a candidate for capacity increase in step S34. Next, A0002 with reverse priority M = 6 is set as a candidate for capacity reduction in step S35 because the number of matches does not reach the variable capacity of 8. In step S36, the number of C0002 is increased from 6 to 7, and the number of A0002 is decreased from 8 to 7.
In A0002, the empty capacity is not 0 (step S37), the variable capacity of C0002 has not reached the upper limit (step S39), m is greater than the maximum priority value (7), or M is less than 1 Since there is not (step S41), it returns to the process of step S33.

(9th)
C0002 with a priority m = 5 has a match number and a capacity number equal to 5 respectively, and the variable capacity number 7 has not reached the maximum capacity limit of 8, and is set as a candidate for capacity increase in step S34. Next, A0002 with reverse priority M = 6 is set as a candidate for capacity reduction in step S35 because the number of matches does not reach the variable capacity of 7. In step S36, the number of C0002 is increased from 7 to 8, and the number of A0002 is decreased from 7 to 6.
Since A0002 has a non-empty capacity of 0 (step S37) and the variable capacity of C0002 has reached the maximum capacity (step S39), m is set to 6 (step S40), and m is the maximum priority (7 ) Or M is not smaller than 1 (step S41), the process returns to step S33.
At this time, the variable capacity of C0002 is determined to be 8.

(10th)
In A0002 with priority m = 6, the first number of matches and the number of matches are not equal (step S33), m is set to 7 (step S40), and m is greater than the maximum priority value (7). Or M is not smaller than 1 (step S41), the process returns to step S35.
At this time, the variation capacity of A0002 is determined to be 10 without variation.

(11th)
In A0001 with priority m = 7, the first number of matches and the number of matches are not equal (step S33), so m is set to 8 (step S40), and m is greater than the maximum priority value (7). Therefore (step S41), the process proceeds to step S42.
At this time, the variation capacity of A0002 is determined to be 10 without variation.
In step S42, the temporarily stored variable capacity number is stored in the temporary matching result storage file 5 as the number of matching times n (the second time in this case), and the process ends. That is, the capacity transfer means 9 stores the number of training program numbers after the capacity transfer process in the temporary matching result storage file 5 as the number of training program numbers in the newly performed matching process.

In the flow of the first capacity transfer process described above, the number of persons to be used in the second matching process is set as follows. As shown in FIG. 7, A0001 8 people, A0002 6 people, A0003 13 people, B0001 5 people, B0002 10 people, C0001 8 people, and C0002 8 people.
Illustrated is the capacity transfer process for the second matching process, but the capacity transfer process is similarly performed for the third time and thereafter.

FIG. 13 is a diagram illustrating the process of notifying the matching result by the communication unit 6 of the matching server 100. As shown in FIG. 13, first, the matching unit 9 of the matching server 100 notifies the notification unit 6 of the end of the matching process (step S51). Next, the communication unit 6 of the matching server 100 refers to the matching result storage file 6 and notifies the matching result to the communication unit 33 of the matching manager terminal 400 (step S52). Next, the communication means 33 of the matching manager terminal 400 delivers the notified matching result to the processing means 32 (step S53). Next, the processing means 32 of the matching manager terminal 400 publishes the transferred matching result on the Internet or the like (step S54).
The disclosure of the matching result is not limited to the method shown in FIG. 13, and there is a method of notifying the participants and the training program administrator with a file format and paper on which the result is printed. The matching result may be notified to the participant terminal 200 or the facility manager terminal 300. For example, if the participant terminal 200 is logged in with the user ID 001, the facility information matched with the user ID 001 (for example, information regarding the facility code A001) may be transmitted to the participant terminal 200. .

  In the above explanation, the matching problem between the participant who wishes to participate in the training and the training program has been explained. However, the present invention is not limited to this, and a set A composed of a plurality of elements (corresponding to the above participant) and a plurality of Matching problem that matches each element with the set B consisting of elements (corresponding to the above training program), each element of the set B has information on the number of people and the upper limit of the number of people, and the priority among the elements It goes without saying that it can be applied to any of the matching problems when transferring the capacity based on the ranking.

The matching system according to the present invention includes a set A (participant set) composed of a plurality of A elements (participants) and a set B (set of training programs) composed of a plurality of B elements (training programs). A matching number file that stores the number of quorums and the upper limit of the number of matching in each B element ID of each B element of the set B, and a B element of each B element of the set B In accordance with the ID, the capacity transfer information file storing the priority order in the capacity transfer process and the A element ID of each A element of the set A are uniquely ranked for all or part of the B elements of the set B Unique to all or part of the A elements of the set A for each of the first priority list file storing the attached first priority list and the B element ID of each B element of the set B Ranked A second priority list file storing the second priority list and a first matching means, wherein the first matching means includes a first priority list file, a second priority list file, and a second priority list file. Based on the priority list file and the quorum stored in the quorum file, a matching process for matching the A element of the set A with any of the B elements included in the set B is performed. The matching means stores the number of matching processes performed so far in the temporary matching result storage file, and the first matching means further determines the number of B elements and the number of B elements for each B element ID. A first matching processing means for storing the number of matches, which is the number of A elements matched to the elements, in a temporary matching result storage file; and a capacity transfer means for performing a capacity transfer process. The capacity transfer means stores the number of matches and the number of matches for each B element ID in the last matching process performed so far, stored in the temporary matching result storage file, and the priority stored in the capacity transfer information file. Based on the above, the capacity increase B element ID and the capacity decrease B element ID are determined, and the capacity transfer process is performed. The capacity transfer process is performed for the capacity increase B element ID and the capacity decrease B element ID. When the number of ID matches is equal to the number of members, the number of members for increasing the number of B elements ID is increased by a predetermined amount, and the number of members for the member number of decreasing B elements ID is decreased by a predetermined amount. Further, the capacity of each B element ID after the capacity transfer process is stored in the temporary matching result storage file as the capacity of each B element in the newly performed matching process. Based on the transfer means, the first priority list file, the second priority list file, and the capacity of each B element in the newly performed matching process stored in the temporary matching result storage file, A matching system comprising: a second matching processing unit that newly matches a member of the set A to any element of the set B; The processing of the matching processing means is performed until a predetermined end condition is satisfied.
This configuration corresponds to the configuration of claim 1.

  The present invention also provides a matching system for matching each element of a set A (participant set) consisting of a plurality of elements and a set B (set of training programs) consisting of a plurality of elements, For each B element ID (training program number) of each element of B, a quorum file (training program information file 1) storing the number of capacities that can be accepted by matching and the upper limit of the capacity, and each element of the set B Corresponding to the B element ID, the capacity transfer information file (capacity transfer information file 2) storing the priority order of the capacity transfer process, and all the elements of the set B for each A element ID of each element of the set A Alternatively, a first priority list file (participant ROL file 3) storing a first priority list uniquely ranked for a part, and B of each element of the set B A second priority list file (training program ROL file 4) storing a second priority list uniquely ranked for all or part of the elements of the set A for each elementary ID; , The elements of the set A with respect to any element of the set B based on the quorum stored in the first priority list file, the second priority list file, and the quorum file First matching processing means (step S22 in FIG. 11) that performs matching processing and stores the number of matches, the number of matches for each B element ID, and the number of matches in the temporary matching result storage file, and the temporary matching result storage file The capacity increase training program based on the number of matches, the number of matches, and the priority order stored in the above capacity transfer information file for each previous B element ID stored in Decide the number (training program number with rank equal to priority m, capacity increase B element ID) and capacity decrease training program number (training program number with rank equal to reverse priority M, capacity decrease B element ID), When the number of matches for the capacity increase training program number is equal to the number of capacity, the capacity of the capacity reduction training program number is transferred to the capacity of the capacity increase training program number, and the temporary matching result storage file with the transferred capacity as the current capacity Capacity transfer means (step S24 in FIG. 11 and FIG. 12) and the current number of capacity stored in the first priority list file, the second priority list file, and the temporary matching result storage file. Based on this, a second matching process is performed on an element of the set A with respect to any element of the set B. The matching system is characterized in that it includes a matching processing means (step S26 in FIG. 11), and the processing of the capacity transfer means and the second matching processing means is carried out until a predetermined end condition is satisfied. It can also be said that it is a matching system characterized by being performed.

As described above, according to this embodiment, when the number of participants matched to a certain training program is equal to the number of training programs, the number of training programs can be reduced based on the priority of multiple training programs. Is replaced with the maximum number of training program numbers, and the number of training programs is increased. Then, if matching is performed again, there is a possibility that more participants will be matched with the training program.
If the number of matched participants is equal to the capacity of the training program, there may be excluded participants in the final matching of the capacity (no excluded participants, the last combination of capacity In this case, if the number of participants is increased and matching is performed again, the number of participants who are matched with the corresponding training program increases. On the other hand, the Gale-Shapley algorithm has the characteristic that if the number of participants matched to a certain training program is less than the capacity of the corresponding training program, the number of matches will not increase even if matched again. Based on this form of processing, even if the number of training programs with lower priority is reduced, the number of matches in the training program will not decrease due to the reduction (when other matches are made due to other factors) , The number of matches may be reduced compared to the previous match).

From the above, there is a possibility that the overall match rate on the participant side will be improved and the capacity full rate on the training program side will be improved by changing the number of seats. In addition, the participant is more likely to be matched with the training program set at a higher rank in the participant ROL file.
The possibility of increasing the number of participants who are matched to a specific training program, the improvement of the match rate on the participant's side, and the possibility of improving the capacity fullness on the training program side are set in the participant ROL file and the training program ROL file. There are parts that depend on the content, and it is not always improved. However, the possibility of improvement is high, and at least the number of participants matched to a specific training program, the match rate on the participant's side, and the capacity fullness rate on the training program side are those when the processing of this embodiment is not performed. More than the number of participants matched to a specific training program, the match rate on the participant side, and the capacity full rate on the training program side.

Embodiment 2. FIG.
The present embodiment is characterized in that prioritization of training programs is set in the facility. Since one facility has a plurality of training programs, the facility corresponds to a group consisting of a plurality of training programs. In the first embodiment, prioritization is performed among all training programs. However, in this embodiment, the facility manager can individually set by setting for each facility.
In this embodiment, the number of participants in one training program is increased or decreased based on the upper limit and priority of the number of training programs in one facility. It is characterized by the possibility of increasing the number of people. As a result, it is expected that the match rate on the participant side will be improved and the capacity full rate on the facility side will be improved.

The system configuration diagram of the present embodiment is as shown in FIGS. 1 and 2 used in the first embodiment. The training program information file 1, the participant ROL file 3, the training program ROL file 4, and the matching result storage file 6 are as described in FIGS. 3, 5, 6, and 8 used in the first embodiment. .
FIG. 14 shows the configuration of the capacity transfer information file 2 of the present embodiment. In this embodiment, in order to assign priorities within the training programs belonging to the same facility, as shown in FIG. 14, priorities are assigned among the training program numbers A0001, A0002, and A0003. Priorities are assigned between the numbers B0001 and B0002 and between the training program numbers C0001 and C0002. This priority order can be configured to accept designation from the hospital administrator terminal 300 and sequentially store the priority order for the corresponding facility code. Alternatively, the priority order for each facility code may be stored sequentially from the matching manager terminal 400.
FIG. 15 shows the configuration of the temporary matching result storage file 5 of the present embodiment. The first matching number will be described assuming that the same number of matches as in the first embodiment is obtained.

Next, the operation of the matching system will be described. The processing of FIGS. 9, 10, 11, and 13 used in the first embodiment is similarly performed in this embodiment.
FIG. 16 is a diagram showing the flow of the capacity transfer process by the capacity transfer means 9 in the present embodiment. This is the details of the capacity transfer process of “FIG. 11 Step S24”.
Start processing, refer to training program information file 1 (“Capacity”, “Capacity upper limit” items) and capacity transfer information file 2 (“Rank” item for each “Training program number”), and store temporary matching results The number of matches and the number of matches for each n-1 training program number in file 5 are temporarily stored in the storage device (step S61). In the processing of FIG. 16, the changing capacity number is referred to as a “changeable capacity number”. In the initial stage, the variable capacity number is stored in the storage device in correspondence with the training program number, and the variable capacity number is overwritten and stored during the capacity transfer process.

  Next, one or more records in which the first facility code is stored from each of the training program information file 1 and the capacity transfer information file 2 are taken out and temporarily stored in the storage device (the facility code A001 is set as the first facility code). A record is taken out (step S62). It is determined whether or not the processing of all facility codes has been completed (step S63). If not, the priority is determined based on the “rank” item in the same facility of the temporary transfer information file 2 stored temporarily. m is set and the initial value is 1. As for the “order” of the capacity transfer information file 2, transfer processing is given priority in ascending order of numbers. That is, the transfer process is given priority in the order of 1, 2, 3,. Here, M is reverse priority (a variable indicating low priority), and the initial value of M is set to the maximum value of priority (when the record of the facility code A001 is taken out as the first facility code, priority is given). The maximum value of degree m is 3, and the initial value of reverse priority M is 3. Step S64).

  The upper limit for the number of training program information files 1, the temporarily stored capacity for each n-1th training program number, and the number of matches are temporarily stored in the same facility ranking. Based on this, it is judged whether the number of matches with priority m is equal to the number of people and whether the variable number of people is smaller than the upper limit of the number of people (step S65). Perform the capacity transfer process for the program. If it is determined in step S65 that the condition is not satisfied, m is incremented by 1 (m = m + 1, step S71), and the determination in step S72 is performed.

  After that, in order to determine whether the reverse priority M training program can reduce the number of capacity, whether the number of matches with reverse priority M is smaller than the current variable capacity (that is, the empty capacity of the reverse priority M training program) Is less than or equal to 1) (step S66), and if it is smaller, the transfer from reverse priority M is possible, so the number of reverse priority M training programs is decremented by 1, and the priority m training program 1 is added (step S67). In the process of step S67, the number of people that has been transferred is overwritten and stored in the variable number of people. If it is determined in step S66 that the number of matches with reverse priority M is greater than or equal to the variable capacity, transfer processing cannot be performed from the training program with reverse priority M, and 1 is subtracted from reverse priority M ( M = M−1, step S69) and the process proceeds to step S70.

  After the transfer process in step S67, it is determined whether or not the empty capacity of the reverse priority M training program is 0 (if the variable capacity is equal to the number of matches) (step S68). Next, it is determined whether the variable capacity of the priority m training program has reached the upper limit (if the variable capacity is equal to the upper limit) (step S70). Next, it is determined whether m is greater than the maximum priority (3 when the facility code is A001) or M is less than 1 (step S72). The capacity transfer process with the code ends, and the temporarily stored variable capacity number is stored in the temporary matching result storage file 5 as the capacity number of the corresponding facility code (step S73).

Subsequently, one or more records in which the next facility code is stored from each of the training program information file 1 and the capacity transfer information file 2 are taken out and temporarily stored in the storage device (the facility code B001 is the second facility code). Is taken out (step S74). When it moves to step S63 and it determines with the process of a facility code not being complete | finished, it moves to the process of step S64, and when it determines with having processed all the facility codes, a process is complete | finished.
If the conditions are not matched in step S72, the process returns to step S65 in order to continue the transfer process within the corresponding facility code.
If it is determined in step S68 that the value is 0, the process proceeds to step S69. If it is determined in step S70 that the variable number of training programs with the priority m has reached the upper limit, m is incremented by 1 (m = m + 1, step S71). Control goes to step S72.
In this way, in the process shown in FIG. 16, the transfer process for the number of qualifiers in the next n-th matching process is performed.

The processing shown in FIG. 16 will be illustrated with reference to FIGS. As a result of the first matching number, when the result as shown in FIG. 7 is obtained, how the number of the second matching number is set will be described.
(First time)
First, the records of the training program numbers A0001, A0002, and A0003 of the facility code A001 are extracted (step S62), and the priority m = 1 and the reverse priority M = 3 are set.
A0003 with the priority m = 1 has the same number of matches as the first match and the number of seats is equal to 10, and the variable number of seats 10 does not reach the maximum number of seats 13, so that it is set as a candidate for capacity increase in S65. Next, A0002 with reverse priority M = 3 is set as a candidate for capacity reduction in step S66 because the number of matches does not reach the variable capacity. In step S67, the variable capacity of A0003 is increased from 10 to 11, and the variable capacity of A0002 is decreased from 10 to 9. The variable capacity is overwritten in the storage device.
The vacant capacity of A0002 is not 0 (step S68), the variable capacity of A0003 has not reached the upper limit of capacity (step S70), m is greater than the maximum priority value (3), or M is less than 1. Since there is not (step S72), it returns to the process of step S65.

(Second time)
A0003 with priority m = 1 has the same number of matches as the first match and the number of seats is equal to 10, and the variable number of seats 11 does not reach the maximum number of seats 13, so that it is set as a candidate for capacity increase in S65. Next, A0002 with reverse priority M = 3 is set as a candidate for capacity reduction in step S66 because the number of matches does not reach the variable capacity. In step S67, the variable capacity of A0003 is increased from 11 to 12, and the variable capacity of A0002 is decreased from 9 to 8. The variable capacity is overwritten in the storage device.
The vacant capacity of A0002 is not 0 (step S68), the variable capacity of A0003 has not reached the upper limit of capacity (step S70), m is greater than the maximum priority value (3), or M is less than 1. Since there is not (step S72), it returns to the process of step S65.

(3rd)
A0003 with priority m = 1 has the same number of matches as the first match and the number of seats is equal to 10, and the variable number of seats 12 does not reach the maximum number of seats 13, so that it is set as a candidate for capacity increase in S65. Next, A0002 with reverse priority M = 3 is set as a candidate for capacity reduction in step S66 because the number of matches does not reach the variable capacity. In step S67, the variable capacity of A0003 is increased from 12 to 13, and the variable capacity of A0002 is decreased from 8 to 7. The variable capacity is overwritten in the storage device.
Since the vacant capacity of A0002 is not 0 (step S68) and the variable capacity of A0003 has reached the upper limit of capacity (step S70), m is set to 2 (step S71), and m is the maximum priority ( 3) Since larger than or M is not smaller than 1 (step S72), the process returns to step S65.

(4th)
In A0001 with priority m = 2, the first number of matches and the number of matches are not equal (step S65), so m is set to 3 (step S71), and m is greater than the maximum priority value (3). Or M is not smaller than 1 (step S72), the process returns to step S65.
At this time, the fluctuation capacity number of A0001 is determined to be 10 without fluctuation.

(5th)
In A0002 with priority m = 3, the number of matches and the number of matches for the first time are not equal (step S65), so m is set to 4 (step S71), and m is greater than the maximum priority value (3). Therefore (step S72), the number of matching times n (in this case, the second time) is set with the variable capacity numbers of the training program numbers A0001, A0002, and A0003 of the facility code A001 temporarily stored as 10, 7, and 13, respectively. The number is stored in the temporary matching result storage file 5 (step S73). Thus, the capacity transfer process is performed only between training programs included in the same facility (in the above example, the facility code A001).

(6th)
Next, the records of the training program numbers B0001 and B0002 of the facility code B001 are extracted (step S74), and the priority m = 1 and the reverse priority M = 2 are set.
For B0002 with priority m = 1, the first number of matches and the number of matches are not equal (step S65), so m is set to 2 (step S71), and m is greater than the maximum priority value (2). Or M is not smaller than 1 (step S72), the process returns to step S65.
At this time, the fluctuation capacity of B0002 is determined to be 10 without fluctuation.

(7th)
For B0001 with priority m = 2, the number of matches for the first time and the number of matches are not equal (step S65). Thereafter, m is set to 3 (step S71), and since m is greater than the maximum priority value (2) (step S72), fluctuations in the training program numbers B0001 and B0002 of the facility code B001 temporarily stored The number of matches is 5 and 10, respectively, and is stored in the provisional matching result storage file 5 as the number of matches n (the second time in this case) (step S73).
In the training program included in the facility code B001, there is no training program that has reached the maximum number of matches, so there is no transfer of capacity.

(8th)
Next, the records of the training program numbers C0001 and C0002 of the facility code C001 are extracted (step S74), and the priority m = 1 and the reverse priority M = 2 are set.
Since C0001 with priority m = 1 does not have the same number of matches as the number of matches for the first time (step S65), m is set to 2 (step S71), and m is greater than the maximum priority value (2). Or M is not smaller than 1 (step S72), the process returns to step S65.
At this time, the fluctuation capacity number of C0001 is determined to be 8 without fluctuation.

(9th)
C0002 with the priority m = 2 has the same number of matches as the first match and the number of seats is equal to 5, and the variable number of seats 5 does not reach the maximum number of seats 8, so is set as a candidate for capacity increase in S65. Next, for C0002 with priority M = 2, since the number of matches has reached the variable capacity (step S66), M is set to 1 (step S69), and m is greater than the maximum priority value (2). Or M is not smaller than 1 (step S72), the process returns to step S65.

(10th)
C0002 with the priority m = 2 has the same number of matches as the first match and the number of seats is equal to 5, and the variable number of seats 5 does not reach the maximum number of seats 8, so is set as a candidate for capacity increase in S65. Next, C0001 with priority M = 1 is set as a candidate for capacity reduction in step S66 because the number of matches has not reached the variable capacity (step S66). In step S67, the variable capacity number of C0002 is increased from 5 to 6, and the variable capacity number of C0001 is decreased from 8 to 7. The variable capacity is overwritten in the storage device.
The vacant capacity of C0001 is not 0 (step S68), the variable capacity of C0002 has not reached the upper limit of capacity (step S70), m is greater than the maximum priority value (2), or M is less than 1. Since there is not (step S72), it returns to the process of step S65.

(11th)
C0002 with the priority m = 2 has the same number of matches as the first match and the number of seats is equal to 5, and the variable number of seats 6 does not reach the maximum number of seats 8, and is set as a candidate for capacity increase in S65. Next, C0001 of reverse priority M = 1 is set as a candidate for capacity reduction in step S66 because the number of matches has not reached the variable capacity (step S66). In step S67, the variable capacity number of C0002 is increased from 6 to 7, and the variable capacity number of C0001 is decreased from 7 to 6. The variable capacity is overwritten in the storage device.
The vacant capacity of C0001 is not 0 (step S68), the variable capacity of C0002 has not reached the upper limit of capacity (step S70), m is greater than the maximum priority value (2), or M is less than 1. Since there is not (step S72), it returns to the process of step S65.

(12th)
C0002 with the priority m = 2 has the same number of matches as the first match and the number of seats is equal to 5, and the variable number of seats 7 does not reach the maximum number of seats 8, so that it is set as a candidate for capacity increase in S65. Next, C0001 of reverse priority M = 1 is set as a candidate for capacity reduction in step S66 because the number of matches has not reached the variable capacity (step S66). In step S67, the variable capacity number of C0002 is increased from 7 to 8, and the variable capacity number of C0001 is decreased from 6 to 5. The variable capacity is overwritten in the storage device.
Since the vacant capacity of C0001 is not 0 (step S68) and the variable capacity of C0002 has reached the maximum capacity (step S70), m is set to 3 and m is greater than the maximum priority value (2). Therefore (step S72), the variable number of training program numbers C0001 and C0002 of the facility code C001 temporarily stored is 5 and 8, respectively, and the number of matching times n (in this case, the second time) The temporary matching result storage file 5 is stored (step S73).
If there is a record of the next facility code, the processing is performed subsequently. However, in the illustrated example, since the processing corresponding to all the facility codes is completed, the processing ends in step S63.
In the process flow described above, the second capacity is set as follows. As shown in FIG. 15, A0001 10 people, A0002 7 people, A0003 13 people, B0001 5 people, B0002 10 people, C0001 5 people, and C0002 8 people.
In the 10th to 12th transfer process, the transfer process from C0001 with priority 1 to C0002 with priority 2 is performed. The order stored in the capacity transfer information file 2 does not prohibit the transfer from a training program with a high priority to a training program with a low priority. In this case, the capacity transfer means 9 may be a training program with a high priority. To a lower training program. The same processing is performed in the first embodiment and the third and fourth embodiments described later.
Illustrated is the capacity transfer process for the second matching process, but the capacity transfer process is similarly performed for the third time and thereafter.

As described above, according to the present embodiment, when the number of participants matched to a certain training program is equal to the number of training programs, the lower priority order is based on the priorities of multiple training programs in the same facility. Replace the number of training programs with the number of training programs, and increase the number of training programs. Then, if matching is performed again, there is a possibility that more participants will be matched with the training program.
If the number of matched participants is equal to the capacity of the training program, there may be excluded participants in the final matching of the capacity (no excluded participants, the last combination of capacity In this case, if the number of participants is increased and matching is performed again, the number of participants who are matched with the corresponding training program increases. On the other hand, the Gale-Shapley algorithm has the characteristic that if the number of participants matched to a certain training program is less than the capacity of the corresponding training program, the number of matches will not increase even if matched again. Based on this form of processing, even if the number of training programs with lower priority is reduced, the number of matches in the training program will not decrease due to the reduction (when other matches are made due to other factors) , The number of matches may be reduced compared to the previous match).

In the matching system according to the present invention, the B element (training program) of the set B (training program set) constitutes a group of one or more B elements, and the capacity transfer information file includes each B element of the set B. The priority order of the capacity transfer process in the group is stored in correspondence with the B element ID of the group, and the capacity transfer process is performed only between the B elements included in the same group.
This configuration corresponds to the configuration of claim 2.

  The present invention also provides a matching system for matching each element of a set A (participant set) consisting of a plurality of elements and a set B (set of training programs) consisting of a plurality of elements, The element of B constitutes a group of one or more elements (training program), and the maximum number of persons and the maximum number of persons that can be accepted by matching for each B element ID (training program number) of each element of the set B And a capacity transfer information file (capacity) that stores the priority order of the capacity transfer processing within the group corresponding to the B element ID of each element of the set B Transfer information file 2) and a first priority list uniquely ranked for all or some of the elements of the set B for each A element ID of each element of the set A The first priority list file (participant ROL file 3) and the B element ID of each element of the set B are uniquely ranked for all or part of the elements of the set A. A second priority list file (training program ROL file 4) storing the second priority list, the first priority list file, the second priority list file, and the capacity file Based on the number of quorums stored in the table, matching processing is performed on the elements of the set A against any of the elements of the set B, and the number of matching times and the number of matches and the number of matches for each B element ID are temporarily calculated. The first matching processing means (step S22 in FIG. 11) stored in the matching result storage file and the temporary matching result storage file for the B element belonging to the group Based on the stored capacity, the number of matches and the priority order stored in the capacity transfer information file for each previous B element ID, the capacity increase B element ID and the capacity decrease B element ID are determined. The transfer process is performed. When the number of matches of the additional B element ID is equal to the maximum number of the B element ID and the lower B element ID, the maximum number of the B element ID is increased. In addition to increasing the predetermined amount, the number of members of the capacity reduction B element ID is decreased by a predetermined amount, and the capacity transfer means for storing the transferred capacity number in the temporary matching result storage file as the current capacity number (FIG. 11) Step S24 and FIG. 16) and the current number of qualifications stored in the first priority list file, the second priority list file, and the temporary matching result storage file. And a second matching processing means (step S26 in FIG. 11) for performing matching processing on the elements of the set A with respect to any element of the set B. In addition, it can be said that the processing of the capacity transfer means and the second matching processing means is a matching system that is performed until a predetermined end condition is satisfied.

From the above, there is a possibility that the overall match rate on the participant side will be improved and the capacity full rate on the training program side will be improved by changing the number of seats.
The possibility of increasing the number of participants who are matched to a specific training program, the improvement of the match rate on the participant's side, and the possibility of improving the capacity fullness on the training program side are set in the participant ROL file and the training program ROL file. There are parts that depend on the content, and it is not always improved. However, the possibility of improvement is high, and at least the number of participants matched to a specific training program, the match rate on the participant's side, and the capacity fullness rate on the training program side are those when the processing of this embodiment is not performed. More than the number of participants matched to a specific training program, the match rate on the participant side, and the capacity full rate on the training program side.
In addition, since the transfer of the capacity is performed within the training program in the same facility, the capacity of the facility as a whole does not change. Furthermore, on the facility side, if there is a popular training program, there is an advantage that the satisfaction rate of the entire facility is improved. Moreover, since the designation of priority can be arbitrarily changed by the facility, the desire of the facility can be reflected.

In the present embodiment, the priority order is set in the same facility. However, a group may be configured by a plurality of facilities, and the priority order may be set in the group. At this time, a part may be set in a single facility, and a part may be set in a group.
For example, when a group is composed of facility codes B001 and C001 in the capacity transfer information file 2 shown in FIG. When configuring in the facility, ranking is performed among the training program numbers A0001, A0002, and A0003. In this way, if a group is composed of a plurality of facilities and prioritized within the group, the group can be composed of facilities with the same management base or nearby facilities. Will increase.

Embodiment 3 FIG.
In the present embodiment, as in the first embodiment, priorities are assigned in all training programs, and a numerical value for the upper limit of the number of setting members is set for each facility.
The capacity limit for each training program can be adjusted by the upper limit of the capacity for each training program, and the upper limit of capacity can be set as a facility by the upper limit of the set number of persons (group capacity upper limit).

The system configuration diagram of the present embodiment is as shown in FIGS. 1 and 2 used in the first embodiment. The capacity transfer information file 2, the participant ROL file 3, the training program ROL file 4, and the matching result storage file 6 are as described in FIGS. 4, 5, 6, and 8 used in the first embodiment. .
FIG. 17 shows the configuration of the training program information file 1 of the present embodiment. The training program number, the number of people, the upper limit of the number of people, the facility code, and the facility address in FIG. 17 are as described in Embodiment 1 with reference to FIG.
FIG. 18 shows the configuration of the temporary matching result storage file 5 of the present embodiment.

Next, the operation of the matching system will be described. The processing of FIGS. 9, 10, 11, and 13 used in the first embodiment is similarly performed in this embodiment.
The capacity transfer process of “FIG. 11 Step S24” will be described with reference to FIG. In the present embodiment, it is determined whether or not the total number of variable capacity of each training program does not exceed the upper limit of the number of establishments by the capacity transfer process. Do not do. Specifically, when it is determined in step S35 that the number of matches in the training program having the reverse priority M is smaller than the current variable capacity, before performing the transfer process in step S36, “the training of reverse priority M” The total number of variable capacity of training programs in the facility that includes the priority m training program when the transfer process is performed to decrease the variable capacity number of the program and increase the variable capacity of the priority m training program. > Is the upper limit of the number of setting members? "(Step S81) is added. If it is determined in step S81 that the total value of the variable capacity is equal to or less than the upper limit of the number of setting members, the process proceeds to step S36. If it is determined in step S81 that the total value of the variable capacity is larger than the upper limit of the set number, the process proceeds to step S40 without performing the transfer process. Thus, in the capacity transfer process of the third embodiment, assuming that the capacity transfer process is performed, the total number of variable capacity of each training program in the facility to which the training program of priority m belongs is This is only done when the maximum number of establishments is not exceeded.

As a result of the first matching count, when the result shown in FIG. 18 is obtained, how to set the second matching count in this embodiment will be described. In the following, an example is shown in which the number of quotas to be used in the second matching count is determined by a total of 11 quota transfer processes. FIG. 18 shows the first, second, third, seventh, eighth, and ninth times. It shows the situation of how the variable capacity changes due to the capacity transfer process.
(First time)
First, for A0003 with priority m = 1, the number of first matches and the number of players are equal to 10, and the variable number of people 10 has not reached the maximum number of people 13, so it is set as a candidate for capacity increase in step S34. Is done. Next, A0001 with reverse priority M = 7 is set as a candidate for capacity reduction in step S35 because the number of matches has not reached the variable capacity. In step S81, the total number of variable capacity numbers (A0001 is 9, A0002 is 10, and A0003 is 11 when the transfer process is performed, so the total value is 30) is less than or equal to the upper limit of the number of setting members 33. move on.
In step S36, the variable capacity of A0003 is increased from 10 to 11, and the variable capacity of A0001 is decreased from 10 to 9. The variable capacity is overwritten in the storage device.
In A0001, the empty capacity is not 0 (step S37), the variable capacity of A0003 has not reached the upper limit of capacity (step S39), m is larger than the maximum priority value (7), or M is smaller than 1. Since there is not (step S41), it returns to the process of step S33.

(Second time)
In A0003 with priority m = 1, the number of matches and the number of matches for the first time are equal to 10, respectively, and the variable capacity 11 does not reach the maximum capacity 13 so that it is set as a candidate for capacity increase in step S34. . Next, A0001 of reverse priority M = 7 is set as a candidate for capacity reduction in step S35 because the number of matches 8 has not reached the variable capacity number 9 (step S35). In step S81, the total number of variable capacity numbers (when transfer processing is performed, A0001 is 8, A0002 is 10, and A0003 is 12, so the total value is 30) is less than the set number upper limit 33, so the processing of step S36 move on.
In step S36, the variable capacity of A0003 is increased from 11 to 12, and the variable capacity of A0001 is decreased from 9 to 8. The variable capacity is overwritten in the storage device.
Since A0001 has a vacant capacity of 0 (the variable capacity becomes equal to the number of matches) (step S37), M is set to 6 (step S38), and the variable capacity of A0003 does not reach the maximum capacity ( In step S39), m is larger than the maximum priority value (7) or M is not smaller than 1 (step S41), so the process returns to step S33.
At this time, the variable capacity of A0001 is determined to be 8.

(3rd)
For A0003 with priority m = 1, the number of matches and the number of matches for the first time are equal to 10, respectively, the variable capacity number 12 does not reach the maximum number of capacity 13, and A0002 with reverse priority M = 6 Since 5 has not reached the variable capacity of 10 (step S35), it is set as a candidate for capacity reduction in step S35. In step S81, since the total value of the variable capacity numbers (the transfer process is A0001 = 8, A0002 = 9, and A0003 = 13, 30) is less than or equal to the upper limit 33, the process proceeds to step S36.
In step S36, the variable capacity number of A0003 is increased from 12 to 13, and the variable capacity number of A0002 is decreased from 10 to 9.
In A0002, the empty capacity is not 0 (step S37), and since the variable capacity of A0003 has reached the upper limit (step S39), m is set to 2 (step S40), and m is the maximum priority ( 7) Since it is larger or M is not smaller than 1 (step S41), the process returns to step S33.
At this time, the variable capacity of A0003 is determined to be 13.

(4th)
For B0001 with priority m = 2, the first number of matches and the number of matches are not equal (step S33), so m is set to 3 (step S40), and m is greater than the maximum priority value (7). Or M is not smaller than 1 (step S41), the process returns to step S35.
At this time, the fluctuation capacity number of B0001 is determined to be 5 without fluctuation.

(5th)
For C0001 with priority m = 3, the first number of matches and the number of matches are not equal (step S33), so m is set to 4 (step S40), and m is greater than the maximum priority value (7). Or M is not smaller than 1 (step S41), the process returns to step S35.
At this time, the fluctuation capacity number of C0001 is determined to be 8 without fluctuation.

(6th)
For B0002 with priority m = 4, the first number of matches and the number of matches are not equal (step S33), so m is set to 5 (step S40), and m is greater than the maximum priority value (7). Or M is not smaller than 1 (step S41), the process returns to step S35.
At this time, the fluctuation capacity of B0002 is determined to be 10 without fluctuation.

(7th)
C0002 with priority m = 5 has a match number and a capacity number equal to 5, and the variable capacity number 5 has not reached the maximum capacity limit of 8, and is set as a candidate for capacity increase in step S34. Next, A0002 with reverse priority M = 6 is set as a candidate for capacity reduction in step S35 because the number of matches does not reach the variable capacity of 9. In step S81, since the total number of variable capacity numbers (C0001 is 8 and C0002 is 6 when the transfer process is performed, 14) is equal to or less than the maximum number of setting members 15, the process proceeds to step S36.
In step S36, the number of C0002 is increased from 5 to 6, and the number of A0002 is decreased from 9 to 8.
In A0002, the empty capacity is not 0 (step S37), the variable capacity of C0002 has not reached the upper limit (step S39), m is greater than the maximum priority value (7), or M is less than 1 Since there is not (step S41), it returns to the process of step S33.

(8th)
C0002 with a priority m = 5 has a match number and a capacity number equal to 5, and the variable capacity number 6 has not reached the maximum capacity limit of 8, and is set as a candidate for capacity increase in step S34. Next, A0002 with reverse priority M = 6 is set as a candidate for capacity reduction in step S35 because the number of matches does not reach the variable capacity of 8. In step S81, since the total value of the variable capacity numbers (if transfer processing is performed, C0001 is 8 and C0002 is 7 and 15) is 15 or less, the process proceeds to step S36.
In step S36, the number of C0002 is increased from 6 to 7, and the number of A0002 is decreased from 8 to 7.
In A0002, the empty capacity is not 0 (step S37), the variable capacity of C0002 has not reached the upper limit (step S39), m is greater than the maximum priority value (7), or M is less than 1 Since there is not (step S41), it returns to the process of step S33.

(9th)
C0002 with a priority m = 5 has a match number and a capacity number equal to 5 respectively, and the variable capacity number 7 has not reached the maximum capacity limit of 8, and is set as a candidate for capacity increase in step S34. Next, A0002 with reverse priority M = 6 is set as a candidate for capacity reduction in step S35 because the number of matches does not reach the variable capacity of 7. In step S81, the total number of variable capacity numbers (C0001 is 8 and C0002 is 8 when the transfer process is performed, so 16) is larger than the setting number upper limit 15. Therefore, the process proceeds to step S40 (transfer of step S36). No processing is done.)
At this time, the variable capacity of C0002 is determined to be 7.

(10th)
In A0002 with priority m = 6, the first number of matches and the number of matches are not equal (step S33), m is set to 7 (step S40), and m is greater than the maximum priority value (7). Or M is not smaller than 1 (step S41), the process returns to step S35.
At this time, the variation capacity of A0002 is determined to be 10 without variation.

(11th)
In A0001 with priority m = 7, the first number of matches and the number of matches are not equal (step S33), so m is set to 8 (step S40), and m is greater than the maximum priority value (7). Therefore (step S41), the process proceeds to step S42.
At this time, the variation capacity of A0002 is determined to be 10 without variation.
In step S42, the temporarily stored variable capacity number is stored in the temporary matching result storage file 5 as the number of matching times n (the second time in this case), and the process ends.

In the process flow described above, the second capacity is set as follows. As shown in FIG. 18, A0001 8 people, A0002 6 people, A0003 13 people, B0001 5 people, B0002 10 people, C0001 8 people, and C0002 7 people.
Illustrated is the capacity transfer process for the second matching process, but the capacity transfer process is similarly performed for the third time and thereafter.
Comparing the processing of the present embodiment with the processing of the first embodiment, the capacity transfer of C0002 is limited by the setting of the upper limit of the number of setting members, and in the first embodiment, the number is increased to eight. In the embodiment, the number of personnel increases is seven.

In the matching system according to the present invention, the B element (training program) of the set B (training program set) constitutes a group of one or more B elements, and the capacity file further includes a group capacity for each group. The maximum number is stored, and the capacity transfer process assumes that the capacity transfer process has been performed, the total number of capacity for each B element in the group to which the upper B element ID belongs is the group capacity It may be performed only when the upper limit is not exceeded.
This configuration corresponds to the configuration of claim 3.

  The present invention also provides a matching system for matching each element of a set A (participant set) consisting of a plurality of elements and a set B (set of training programs) consisting of a plurality of elements, The element of B constitutes a group of one or more elements (training program), and the maximum number of persons, the maximum number of groups, and the maximum number of groups that can be accepted by matching for each B element ID of each element of the above set B And a capacity transfer information file (capacity transfer information file 2) storing the priority order of the capacity transfer process corresponding to the B element ID of each element of the set B ) And a first priority list that uniquely ranks all or some of the elements of the set B for each A element ID of each element of the set A Second priority that is uniquely ranked for all or part of the elements of the set A for each priority element file (participant ROL file 3) and B element ID of each element of the set B The second priority list file (training program ROL file 4) storing the list, the first priority list file, the second priority list file, and the quorum stored in the quorum file Based on this, the matching process is performed on the elements of the set A to any element of the set B, and the number of matching times, the number of matches for each B element ID, and the number of matches are stored in the temporary matching result storage file The first matching processing means (step S22 in FIG. 11) and the number of matches, the number of matches, and the like for each previous B element ID stored in the temporary matching result storage file Based on the priority stored in the capacity transfer information file, the capacity increase B element ID and the capacity decrease B element ID are determined, the capacity transfer process is performed, and the capacity transfer process is the capacity increase B element ID and the capacity decrease. If the total number of matches for the B element ID is equal to the number of persons and the total number of elements for each B element does not exceed the above group capacity upper limit by the transfer process, A capacity transfer means for increasing the capacity by a predetermined amount and decreasing the capacity of the capacity reduction B element ID by a predetermined amount, and storing the transferred capacity as a current capacity in the temporary matching result storage file ( Step S24 in FIG. 11, FIG. 12 and Step S81), the first priority list file, the second priority list file, and the temporary matchon A second matching processing means for matching the elements of the set A with any of the elements of the set B based on the current capacity stored in the storage result storage file (step of FIG. 11). S26), wherein the processing of the capacity transfer means and the second matching processing means is performed until a predetermined end condition is satisfied. It can also be called a system.

  As explained above, according to the present embodiment, the maximum number of training programs can be adjusted by the upper limit of the number of training programs, and the upper limit of the number of setting programs has the effect of facilitating the adjustment of the capacity as a facility. can get.

Embodiment 4 FIG.
Also in the present embodiment, the capacity transfer process is performed based on the prioritization, but the partner whose capacity has been transferred is stored, and the flow that is the reverse of the flow that has been transferred once is not performed. Thereby, compared with other embodiments, there is a possibility that the same effect can be obtained with less transfer processing.

The system configuration diagram of the present embodiment is as shown in FIGS. 1 and 2 used in the first embodiment. The training program information file 1, the capacity transfer information file 2, the participant ROL file 3, the training program ROL file 4, and the matching result storage file 6 are the same as those in the first embodiment shown in FIGS. 3, 4, 5, and 6. As described in FIG.
FIG. 19 shows the configuration of the temporary matching result storage file 5 of the present embodiment. As described with reference to FIG. 7 in the first embodiment, “matching frequency”, “training program number”, “capacity”, and “match number” are stored, but in addition, “acceptor” is stored. Is done. “Accepter” indicates from where the increased capacity is accepted when the capacity is increased by the capacity transfer process. For example, when the capacity transfer process from A0001 to A0003 is performed, A0001 is set in the “acceptance source” item of the record of A0003.

Next, the operation of the matching system will be described. The processing of FIGS. 9, 10, 11, and 13 used in the first embodiment is similarly performed in this embodiment.
FIG. 20 is a diagram showing the flow of the capacity transfer process by the capacity transfer means 9 in the present embodiment. This is the details of the capacity transfer process of “FIG. 11 Step S24”.
Start processing, refer to training program information file 1 (“Capacity”, “Capacity upper limit” items) and capacity transfer information file 2 (“Rank” item for each “Training program number”), and store temporary matching results The capacity, the number of matches, and the acceptance source for each n-1th training program number in file 5 are temporarily stored in the storage device (step S91). In the processing of FIG. 11, the changing number of people is called “fluctuating number of people”. In the initial stage, the variable capacity number is stored in the storage device in correspondence with the training program number, and the variable capacity number is overwritten and stored during the capacity transfer process.

  Next, the priority m is set based on the “rank” item of the capacity transfer information file 2, and the initial value is set to 1 (step S92). As for the “order” of the capacity transfer information file 2, transfer processing is given priority in ascending order of numbers. That is, the transfer process is given priority in the order of 1, 2, 3. M is the reverse priority (the numerical value with the lowest priority), and the initial value of M is set to the maximum value of priority (in the capacity transfer information file 2 illustrated in FIG. 4, the maximum value of priority is 7 And the initial value of M is 7. Step S93).

The upper limit of the number of training program information files 1, the temporarily stored number of training program numbers for each (n-1) th training program number, and the number of matches are sequentially based on the order stored in the capacity transfer information file 2. Reference is made to determine whether the number of matches of priority m is equal to the capacity (step S94). Next, it is determined whether the variable capacity is smaller than the upper limit of capacity (step S95), and the condition is satisfied. Implements a capacity transfer process for training programs with priority m. If it is determined in steps S94 and S95 that the condition is not satisfied, m is incremented by 1 (m = m + 1, step S101), and the determination in step S102 is performed.
After that, in order to determine whether the reverse priority M training program can reduce the number of people, the number of matches with the reverse priority M is smaller than the current variable number of people, and the priority m is set as the acceptance source of the reverse priority M. The training program number is not included (step S96), and if the condition matches, the transfer from reverse priority M is possible, so the number of training programs with reverse priority M is decremented by 1. Then, add 1 to the number of training programs with priority m. Further, the training program number of the reverse priority M is stored in the “accepting source” item of the corresponding record in which the training program number of the n-th priority m of the temporary matching result storage file 5 is designated (step S97). The processing in this step S97 is to create and store a transfer history indicating that the capacity has been transferred from the training program number of reverse priority M to the training program number of priority m. Part of the determination conditions in step S96 is that a capacity transfer process in the opposite direction to the ongoing capacity transfer process has already been performed between the two training program numbers to be subjected to the current capacity transfer process. This is to check whether or not When the reverse capacity transfer process has not been performed so far, that is, when there is no transfer history from the training program number with the priority m to the training program number with the reverse priority M, the capacity transfer process is performed. Is called. On the other hand, if the reverse capacity transfer process has already been performed, that is, if there is a transfer history from the training program number with priority m to the training program number with reverse priority M, the capacity transfer process is performed. There will be no.
In the process of step S97, the number of persons to which transfer processing has been performed is overwritten and stored in the variable number of persons. If it is determined in step S96 that the number of matches with reverse priority M is greater than or equal to the variable capacity, or m is set as the acceptance source of priority M, priority is given to the training program with reverse priority M. Assuming that the transfer process to the training program of degree m cannot be performed, the priority M is decremented by 1 (M = M−1, step S99), and the process returns to step S96.

After the transfer process in step S97, it is determined whether or not the empty capacity of the training program of reverse priority M is 0 (if the variable capacity is equal to the number of matches) (step S98). Next, it is determined whether the variable capacity of the training program of priority m has reached the upper limit (whether the variable capacity is equal to the upper limit) or whether M is less than 1 (step S100). If it is determined that the condition is not satisfied, it is then determined whether m is greater than the maximum priority (7 in the capacity transfer information file 2 illustrated in FIG. 4) (Step S102). , The capacity transfer process at the number of matching times n is completed, and the temporarily stored variable capacity number is set as the number of matching times n in the temporary matching result storage file 5. To 憶 (step S103).
When the condition does not match in step S102, the process returns to step S93 in order to continue the transfer process with the number of matching times n.
If it is determined in step S98 that the value is 0, the process proceeds to step S99. If it is determined in step S100 that the condition is satisfied, m is incremented by 1 (m = m + 1, step S101), and the process proceeds to step S102.
In this way, in the process shown in FIG. 20, the transfer process for the number of qualifiers in the next n-th matching process is performed.

The processing shown in FIG. 20 will be illustrated with reference to FIGS. As a result of the first matching count, when the result shown in FIG. 19 is obtained, it will be described how the number of matches for the second matching count is set.
(First time)
First, for A0003 with priority m = 1, the number of first matches and the number of players are equal to 10, and the variable number of people 10 has not reached the maximum number of people 13, so it is set as a candidate for capacity increase in step S95. Is done. Next, for A0001 with priority M = 7, the number of matches has not reached the variable capacity, and the training program A0003 with m = 1 is included in the “acceptor” of A0001, which is a training program with priority M = 7. Since it is not included, it is set as a candidate for capacity reduction in step S96. In step S97, the variable capacity of A0003 is increased from 10 to 11, and the variable capacity of A0001 is decreased from 10 to 9. The variable capacity is overwritten in the storage device.
Since A0001 has no vacant capacity (step S98), the variable capacity of A0003 has not reached the upper limit, M is 1 or more (step S100), and m is greater than the maximum priority (7). (Step S102), the process returns to Step S93.

(Second time)
In A0003 with priority m = 1, the number of matches and the number of matches for the first time are equal to 10, respectively, and the variable capacity 11 does not reach the maximum capacity 13 so that it is set as a candidate for capacity increase in step S95. . Next, for A0001 with reverse priority M = 7, the number of matches 8 has not reached the variable capacity of 9, and the “acceptor” of A0001, which is a training program with reverse priority M = 7, is m = 1. Since a certain training program A0003 is not included (step S96), in step S97, the variable capacity of A0003 is increased from 11 to 12, and the variable capacity of A0001 is decreased from 9 to 8. The variable capacity is overwritten in the storage device.
Since A0001 has a vacant capacity of 0 (the variable capacity becomes equal to the number of matches) (step S98), M is set to 6 (step S99).
At this time, the variable capacity of A0001 is determined to be 8.

(3rd)
In A0003 with the priority m = 1, the first number of matches and the number of matches are equal to 10, respectively, and the variable capacity number 12 does not reach the maximum number of capacity 13. In addition, A0002 with reverse priority M = 6 does not reach the variable capacity of 10 matches, and training with m = 1 is the “acceptor” of A0002, which is a training program with reverse priority M = 6. Since the program A0003 is not included (step S96), the variable capacity of A0003 is increased from 12 to 13 and the variable capacity of A0002 is decreased from 10 to 9 in step S97.
In A0002, the empty capacity is not 0 (step S98), and the variable capacity of A0003 has reached the upper limit (step S100), so m is set to 2 (step S101), and m is the maximum priority ( 7) Since it is not larger (step S102), the process returns to step S93.
At this time, the variable capacity of A0003 is determined to be 13.

(4th)
For B0001 with priority m = 2, the first number of matches and the number of matches are not equal (step S94), so m is set to 3 (step S101), and m is greater than the maximum priority value (7). Since there is not (step S102), it returns to the process of step S93.
At this time, the fluctuation capacity number of B0001 is determined to be 5 without fluctuation.

(5th)
For C0001 with priority m = 3, the number of matches for the first time and the number of matches are not equal (step S94), so m is set to 4 (step S101), and m is greater than the maximum priority value (7). Since there is no (step S102), the process returns to step S93.
At this time, the fluctuation capacity number of C0001 is determined to be 8 without fluctuation.

(6th)
For B0002 with priority m = 4, the number of matches and the number of matches for the first time are not equal (step S94), so m is set to 5 (step S101), and m is greater than the maximum priority value (7). Since there is no (step S102), the process returns to step S93.
At this time, the fluctuation capacity of B0002 is determined to be 10 without fluctuation.

(7th)
C0002 of priority m = 5 has a match number and a capacity number equal to 5 respectively, and the variable capacity number 5 has not reached the maximum capacity limit of 8, and is set as a candidate for capacity increase in step S95. Next, since A0001 with reverse priority M = 7 has reached the number of matches 8 (step S96), M is set to 6 (step S99), and A0002 with reverse priority M = 6 is Since the number of matches does not reach the variable capacity of 9, and the “acceptor” of A0002, which is a training program with reverse priority M = 6, does not include the training program C0002 with m = 5 (step S96). In step S96, it is set as a candidate for capacity reduction. In step S97, the number of C0002 is increased from 5 to 6, and the number of A0002 is decreased from 9 to 8.
In A0002, the empty capacity is not 0 (step S98), the variable capacity of C0002 has not reached the upper limit of capacity (step S100), and m is not larger than the maximum priority value (7) (step S102). The process returns to step S93.

(8th)
C0002 with a priority m = 5 has a match number and a capacity number equal to 5 respectively, and the variable capacity number 6 has not reached the maximum capacity limit of 8, and is set as a candidate for capacity increase in step S95. Next, since A0001 with reverse priority M = 7 has reached the number of matches 8 (step S96), M is set to 6 (step S99), and A0002 with reverse priority M = 6 is In step S96, the number of matches does not reach the variable capacity of 8, and the “acceptor” of A0002, which is a training program with reverse priority M = 6, does not include the training program C0002 with m = 5. It is set as a candidate for capacity reduction. In step S97, the capacity of C0002 is increased from 6 to 7, and the capacity of A0002 is decreased from 8 to 7.
In A0002, the empty capacity is not 0 (step S98), the variable capacity of C0002 has not reached the upper limit of capacity (step S100), and m is not larger than the maximum priority value (7) (step S102). The process returns to step S93.

(9th)
C0002 with a priority m = 5 has a match number and a capacity number equal to 5 respectively, and the variable capacity number 7 has not reached the maximum capacity limit 8, so that it is set as a candidate for capacity increase in step S95. Next, for A0001 with priority M = 7, the number of matches has reached the variable capacity of 8 (step S96), so M is set to 6 (step S99), and A0002 with reverse priority M = 6 Since the number has not reached the variable capacity of 7, and the “acceptor” of A0002, which is a training program with reverse priority M = 6, does not include the training program C0002 with m = 5, the capacity is set at step S96. Set as a candidate for reduction. In step S97, the number of C0002 is increased from 7 to 8, and the number of A0002 is decreased from 7 to 6.
Since A0002 has a non-empty capacity of 0 (step S98) and the variable capacity of C0002 has reached the maximum capacity (step S100), m is set to 6 (step S101), and m is the maximum priority (7 ) (Step S102), the process returns to step S93.
At this time, the variable capacity of C0002 is determined to be 8.

(10th)
For A0002 with priority m = 6, the number of matches and the number of matches for the first time are not equal (step S94), so m is set to 7 (step S101), and m is greater than the maximum priority value (7). Since there is not (step S102), the process returns to step S93.
At this time, the variation capacity of A0002 is determined to be 10 without variation.

(11th)
In A0001 with priority m = 7, the first number of matches and the number of matches are not equal (step S94), so m is set to 8 (step S101), and m is greater than the maximum priority value (7). Therefore (step S102), the process proceeds to step S103.
At this time, the variation capacity of A0002 is determined to be 10 without variation.
In step S103, the temporarily stored variable capacity number is stored in the temporary matching result storage file 5 as the number of matching times n (in this case, the second time), and the process ends.

In the process flow described above, the second capacity is set as follows. As shown in FIG. 19, A0001 8 people, A0002 6 people, A0003 13 people, B0001 5 people, B0002 10 people, C0001 8 people, and C0002 8 people.
Illustrated is the capacity transfer process at the time of the second matching process, but the capacity transfer process is similarly performed after the third time.
As described above, in the present embodiment, the capacity transfer process is performed based on prioritization, but the partner to which the capacity has been transferred is stored, and the flow that is the reverse of the flow that has been transferred once is not performed. It is characterized by. Thereby, compared with other embodiments, there is a possibility that the same effect can be obtained with less transfer processing.

In the matching system according to the present invention, the temporary matching result storage file further includes a transfer history indicating that the capacity has been transferred from the capacity reduction B element ID to the capacity increase B element ID each time the capacity transfer process is executed. Is stored, and the capacity transfer process is performed only when there is no transfer history indicating that the capacity has been transferred from the capacity increase B element ID to the capacity decrease B element ID.
In the present embodiment, in the priority order stored in the capacity transfer information file 2, the lower training program number may become the capacity increase training program number, and the upper training program number may become the capacity reduction training program number. For this reason, the priority stored in the capacity transfer information file 2 allows the transfer from the upper training program number to the lower training program number, but the transfer history from the lower training program number to the higher training program number has already been accepted. When there is, the transfer process from the upper training program number to the lower training program number is not performed.
This configuration corresponds to the configuration of claim 4.

  The present invention also provides a matching system for matching each element of a set A (participant set) consisting of a plurality of elements and a set B (set of training programs) consisting of a plurality of elements, For each B element ID of each element of B, it corresponds to the quorum file (training program information file 1) that stores the number of capacities that can be accepted by matching and the upper limit of the capacity, and the B element ID of each element of the set B The capacity transfer information file (capacity transfer information file 2) storing the priority order of the capacity transfer process and the A element ID of each element of the set A for all or a part of the elements of the set B The first priority list file (participant ROL file 3) storing the first priority list uniquely ranked in order and the B element ID of each element of the set B A second priority list file (training program ROL file 4) storing a second priority list uniquely ranked for all or part of the elements of A, and the first priority Based on the number of quorums stored in the list file, the second priority list file, and the quorum file, matching processing is performed on any element of the set A against any element of the set B. The first matching processing means (step S22 in FIG. 11) for storing the number of times, the number of matches for each B element ID, the number of matches in the temporary matching result storage file, and the previous matching data stored in the temporary matching result storage file Based on the number of matches, the number of matches, and the priority order stored in the capacity transfer information file for each B element ID, the capacity increase B element ID and the capacity decrease B element ID are determined. A capacity transfer process is performed, and the capacity transfer process is equivalent to a capacity increase B element ID and a capacity decrease B element ID, and the number of matches of the capacity increase B element ID is equal to the capacity and the capacity increase B element. When there is no transfer history from ID to capacity reduction B element ID, the number of capacity increase B element ID is increased by a predetermined amount, and the number of capacity decrease B element ID is decreased by a predetermined amount, Capacity transfer means for storing the transferred capacity number in the temporary matching result storage file as the current capacity capacity, and further storing the transfer history from the lower priority B element ID to the corresponding B element ID in the temporary matching result storage file ( Step S24 of FIG. 11 and FIG. 20), and the first priority list file, the second priority list file, and the temporary matching result storage file are described. Second matching processing means (step S26 in FIG. 11) for matching the elements of the set A with any element of the set B based on the remembered current capacity The matching system is characterized in that the processing of the capacity transfer means and the second matching processing means is performed until a predetermined end condition is satisfied. You can also.

  Note that the processing of this embodiment can be combined with the processing of the second embodiment. Specifically, by replacing the processing in steps S64 to S72 in the processing described in FIG. 16 in the second embodiment with the processing in steps S92 to S102 described in FIG. 20 used in the present embodiment. When setting in the facility by prioritizing the training program, it is possible to transfer the capacity by incorporating a condition that does not change the flow reverse to the flow once transferred.

The combination of the second embodiment and the present embodiment is configured as follows.
In the matching system, the B element (training program) of the set B (training program set) forms a group of one or more B elements, and the capacity transfer information file includes the B element ID of each B element of the set B. , The priority order of the capacity transfer process within the group is stored, and the temporary matching result storage file further changes from the lower B element ID to the upper B element ID each time the capacity transfer process is executed. The transfer history indicating that the capacity has been transferred is stored, and the capacity transfer process is performed only between the B elements included in the same group, and the capacity is transferred from the upper B element ID to the lower B element ID. It is performed only when there is no transfer history representing.

  A matching system for matching elements of a set A (participant set) consisting of a plurality of elements and a set B (set of training programs) consisting of a plurality of elements, wherein the elements of the set B are A group file consisting of one or more elements (training program), and a capacity file (training) that stores the maximum number of elements that can be accepted by matching and the maximum number of elements for each B element ID of each element of set B Program information file 1), a capacity transfer information file (capacity transfer information file 2) storing the priority of the capacity transfer process in the group corresponding to the B element ID of each element of the set B, and the set For each A element ID of each element of A, a first priority list file storing a first priority list uniquely ranked for all or part of the elements of the set B And a second priority list uniquely ranked for all or a part of the elements of the set A for each element B of each element of the set B The second priority list file (training program ROL file 4), the first priority list file, the second priority list file, and the capacity number stored in the capacity file, A first matching process is performed on the elements of the set A against any element of the set B, and the number of matching times, the number of matches for each B element ID, and the number of matches are stored in a temporary matching result storage file. With respect to the matching processing means (step S22 in FIG. 11) and the B elements belonging to the group, for each previous B element ID stored in the temporary matching result storage file, Based on the number of members, the number of matches, and the priority stored in the above-mentioned capacity transfer information file, the capacity increase B element ID and the capacity decrease B element ID are determined, and the capacity transfer process is performed. When the number of matches for the capacity increase B element ID is equal to the number of elements for the element ID and the capacity decrease B element ID, and there is no transfer history from the capacity increase B element ID to the capacity decrease B element ID Increases the number of additional B element IDs by a predetermined amount and decreases the number of fixed member B element IDs by a predetermined amount, and stores the transferred number of persons in the temporary matching result storage file as the current number of persons Furthermore, the capacity transfer means for storing the transfer history from the B element ID of lower priority to the corresponding B element ID in the temporary matching result storage file (step S24 in FIG. 11). 16 and 20) and the current number of members stored in the first priority list file, the second priority list file, and the temporary matching result storage file, the elements of the set A are A matching system comprising: a second matching processing unit that performs a matching process on any element of the set B, wherein the processing of the capacity transfer unit and the second matching processing unit Can be said to be a matching system that is implemented until a predetermined termination condition is satisfied.

Embodiment 5 FIG.
In the first to fourth embodiments described so far, the capacity increase training program number and the capacity decrease training program number are determined based on the rank stored in the capacity transfer information file 2, and the capacity transfer process is performed. At that time, the order stored in the capacity transfer information file 2 does not prohibit the transfer from a training program with a high priority to a training program with a low priority. Sometimes transferred to a lower training program.
In the present embodiment, the capacity transfer process is performed based on the order stored in the capacity transfer information file 2. This capacity transfer process is performed when the upper training program number having a certain priority order and the training program number having a lower priority order have the same number of matches as the upper training program number. The number of numbers is increased by a predetermined amount and the number of subordinate training program numbers is decreased by the same amount.

The capacity transfer process will be described with reference to FIG. 12 used in the first embodiment. In the present embodiment, only the transfer from the lower priority training program to the higher priority training program is permitted, so that “priority m <priority M?” Between the processing of step S32 and step S33. Is added (step S111). If it is determined in step S111 that priority m <priority M, the process proceeds to step S33. If it is determined in step S111 that priority m <priority M is not satisfied, the process proceeds to step S42. Further, when the determination in step S41 is NO, processing is performed so that the determination in step S33 is performed after the determination in step S42 is performed before step S33.
Other processes are as described in the first embodiment.

In the present embodiment, the capacity increase training program number determined in the order equal to the priority m is determined by the order equal to the priority M because the priority stored in the capacity transfer information file 2 is the higher training program number. The capacity reduction training program number to be executed is the training program number with the lower priority stored in the capacity transfer information file 2.
As described above, according to the present embodiment, by fixing the flow of the transfer process in one direction, there is a possibility that the same effect can be obtained with less transfer process than in the other embodiments.

In each of the above embodiments, the matching system (matching server 100, participant terminal 200, facility manager terminal 300, matching manager terminal 400) can be realized by a computer. Although not shown, each device includes a CPU (Central Processing Unit) that realizes the function of the device by executing a program.
For example, the CPU is connected to a ROM (Read Only Memory), a RAM (Random Access Memory), a communication board, a display device, a K / B (keyboard), a mouse, an FDD (Flexible Disk Drive), and a CDD (Compact Disc) via a bus. Drive), magnetic disk device, optical disk device, printer device, scanner device and the like.
The RAM is an example of a volatile memory. ROM, FDD, CDD, magnetic disk device, and optical disk device are examples of nonvolatile memory. These are examples of a storage device or a storage unit.
Data and information handled by each device of the above-described embodiment are stored in a storage device or a storage unit, and are recorded and read by each unit of the device.
The communication board is connected to a WAN (Wide Area Network) such as a LAN, the Internet, or ISDN. The magnetic disk device stores an operating system (OS), a window system, a program group, and a file group (database).
The program group is executed by a CPU, OS, and window system.
Each part of each of the above devices may be configured by a program that can be operated by a computer in part or in whole. Alternatively, it may be realized by firmware stored in the ROM. Alternatively, it may be implemented by software, hardware, or a combination of software, hardware, and firmware.
The program group stores a program that causes the CPU to execute the processing described as “˜means” in the description of the embodiment and realizes the function of the means. These programs are created by computer languages, such as C language, HTML, SGML, and XML, for example.
The program is stored in another recording medium such as a magnetic disk device, FD (Flexible Disk), optical disk, CD (compact disk), MD (mini disk), DVD (Digital Versatile Disk), and read by the CPU. And executed.

  1 training program information file, 2 capacity transfer information file, 3 participant ROL file (first priority list file), 4 training program ROL file (second priority list file), 5 temporary matching result storage file, 6 Matching result storage file, 7 communication means, 8 ROL creation means, 9 capacity transfer means, 10 matching means (matching processing means), 20 input means, 21 display means, 22 processing means, 23 communication means, 30 input means, 31 display Means, 32 Processing means, 33 Communication means, 100 Matching server, 200 Participant terminal, 300 Facility manager terminal, 400 Matching manager terminal, 500 Communication network.

Claims (4)

A matching system for matching elements of a set A composed of a plurality of A elements and a set B composed of a plurality of B elements,
For each B element ID of each B element of the set B, a quorum file storing the quorum and the upper limit of quorum in matching;
Corresponding to the B element ID of each B element of the set B, a capacity transfer information file storing priority in the capacity transfer process;
For each A element ID of each A element of the set A, a first priority storing a first priority list uniquely ranked for all or part of the B elements of the set B List file and
A second priority storing a second priority list uniquely ranked for all or part of the A elements of the set A for each B element ID of each B element of the set B List file and
A first matching means,
The first matching means determines the A element of the set A based on the first priority list file, the second priority list file, and the quorum stored in the quorum file. A matching process for matching any of the B elements included in the set B is performed,
The first matching means stores the number of matching processes performed so far in a temporary matching result storage file,
The first matching means further calculates, for each B element ID, the number of B elements and the number of matches that are the number of A elements matched to the B element, the temporary matching result storage file First matching processing means stored in
A capacity transfer means for performing the above capacity transfer process,
The capacity transfer means stores the number of matches and the number of matches for each B element ID stored in the temporary matching result storage file, and the priority stored in the capacity transfer information file. Based on the ranking, a capacity increase B element ID and a capacity decrease B element ID are determined, and the above capacity transfer process is performed.
The above-mentioned capacity transfer process increases the number of capacity increase B element ID by a predetermined amount when the number of matches of capacity increase B element ID is equal to the number of capacity for the element increase B element ID and capacity decrease B element ID. And reducing the number of members of the capacity reduction B element ID by the predetermined amount,
The capacity transfer means further stores the capacity of each B element ID after the capacity transfer process in the temporary matching result storage file as the capacity of each B element in the newly performed matching process; ,
Based on the first priority list file, the second priority list file, and the capacity of each B element in the newly performed matching process stored in the temporary matching result storage file, the set A matching system comprising: a second matching processing unit that newly performs a matching process on any element of A with respect to any element of the set B,
The matching system, wherein the processing of the capacity transfer means and the second matching processing means is carried out until a predetermined end condition is satisfied. The B element of the set B constitutes a group of one or more B elements,
The capacity transfer information file stores the priority order of the capacity transfer process in the group corresponding to the B element ID of each B element of the set B,
The matching system according to claim 1, wherein the capacity transfer process is performed only between B elements included in the same group. The B element of the set B constitutes a group of one or more B elements,
The above capacity file further stores the maximum group capacity for each of the above groups,
In the above capacity transfer process, assuming that the capacity transfer process has been performed, the total number of capacity for each B element in the group to which the capacity increase B element ID belongs does not exceed the group capacity limit for the group. The matching system according to claim 1, wherein the matching system is performed only when: The temporary matching result storage file further stores a transfer history indicating that the capacity has been transferred from the capacity reduction B element ID to the capacity increase B element ID each time the capacity transfer process is executed.
The said capacity transfer process is performed only when there is no transfer history indicating that the capacity has been transferred from the capacity increase B element ID to the capacity decrease B element ID. The matching system according to one item.

Images