Device, method, and program storage medium for executing genetic algorithm

[0002] 1. Field of the Invention

[0003] The present invention relates to a genetic algorithm executing device and method for efficiently searching for a solution using a genetic algorithm (GA), and a program storage medium thereof.

[0004] 2. Description of the Related Art

[0005] Genetic algorithms are application technologies inspired by mechanisms of inheritance and evolution of living things. In the evolution of living things, genomic changes like crossovers of chromosomes, mutations of genes, etc. may occur when new individuals (children) are born from old ones (parents). An individual which can not adapt to the environment fails to survive after natural selection on the other hand an adaptable one survives and becomes a parent of a new descendant. Such adaptability is determined by their genomic properties.

[0006] In a genetic algorithm, a candidate of solution to an optimization problem is represented as a character string (corresponding to a chromosome which is a one-dimensional string of genes), and a solution is searched by repeating genetic operations including selection, crossover, mutation, etc. In this specification, we use the word “character” not only in the sense of alphabets but also in the universal sense of numbers, symbols, . . . , etc.

[0007] Here, evolution of living things corresponds to a process in which a value of the objective function (which is the function evaluated to determine the suitability for the optimization problem) of each character string approaches an optimum value. The selection operation is performed by choosing parent strings with a high evaluation value (which is calculated by the objective function), as shown in FIG. 1A. In a mutation operation, some characters are replaced with other characters at random, as shown in FIG. 1B. In the crossover operation, substrings of a pair of strings are exchanged, as shown in FIG. 1C. By repeating these operations, we can obtain new strings that make the objective function more suitable than with the initial ones.

[0008] In the conventional genetic algorithm, mutation is performed uniformly in the whole the of string, i.e. over all positions in the string. However in many optimization problems, there are some positions that need not (or have to) be mutated. For such problems, the conventional uniform mutation is not efficient. Accordingly, we can barely obtain a solution by the conventional method, especially for large scale problems.

[0009] Furthermore, since a sufficiently large number of generations is required to obtain an adequate string by the conventional genetic algorithm, the search process is continued up to the designated generation, even if a solution has been obtained. The conventional method also has a problem of efficiency of calculation.

[0010] An object of the present invention is to improve the search efficiency of a genetic algorithm by estimating the effect of each position. Another object of the present invention is to save calculation time by automatically terminating the search.

[0011] A genetic algorithm executing device according to the present invention is for solving an optimization problem by a genetic algorithm. This device comprises a character-distribution calculating unit for calculating a distribution of characters at each position from a set of strings; a mutation rate calculating unit for calculating a degree of disorder at each position from the distributions of characters, and calculating a mutation rate at each position from the degrees of disorder; and a mutation processing unit for mutation operation according to the mutation rates.

[0012] The genetic algorithm executing device according to the present invention may further comprise a character distribution registering unit for registering the distributions of characters. The mutation rate calculating unit may obtain a degree of disorder at each position from the distributions of characters registered in the character distribution registering unit. This device may further comprise a generation number counting unit for counting the number of generations; and a termination condition evaluating unit for evaluating termination condition by using the distributions of characters and/or the number of generations.

[0013] Another genetic algorithm executing device according to the present invention comprises a character-distribution calculating unit for calculating a distribution of characters at each position; a character position selecting unit for calculating a degree of disorder at each position from the distributions of characters, and selecting positions with a high degree of disorder; and a combination generating unit for generating new strings by the combinations of characters at the selected positions.

[0014] A genetic algorithm executing method according to the present invention is for solving an optimization problem by a genetic algorithm. The method comprises the steps of: calculating a distribution of characters at each position from a set of strings; calculating a degree of disorder at each position from the distributions of characters; calculating a mutation rate at each position from the degrees of disorder; and generating new strings by mutation operation according to the mutation rates.

[0015] This method may further comprise the steps of: counting the number of generations; and evaluating termination condition by using the distributions of characters and/or the number of generations. Another genetic algorithm executing method according to the present invention comprises the steps of: calculating a distribution of characters at each position from a set of strings; calculating a degree of disorder at each position from the character distributions; selecting positions with a high degree of disorder; and generating new strings by the combinations of characters at the selected positions. In the step of generating new strings, characters at the selected positions are reset to the best combination.

[0016] A computer-readable storage medium according to the present invention stores a computer program for implementing a genetic algorithm executing method for solving an optimization problem by a genetic algorithm. The genetic algorithm executing method implemented by the computer program may comprise the steps of the above described genetic algorithm executing method according to the present invention. If the storage medium is an external storage medium, it is realized by an optical storage medium such as a CDROM, etc., a magnetic storage medium such as a floppy disk, etc., and a magneto-optical storage medium such as an MD, etc. If the storage medium is an internal storage medium, it is realized by a hard disk, a ROM, a RAM, etc.

[0017] FIGS. 1A, 1B, and 1C are schematic diagrams explaining a genetic algorithm;

[0018] FIGS. 2A and 2B are block diagrams showing the basic configuration of a genetic algorithm executing device according to the present invention;

[0019] FIG. 3 is a flowchart showing the first example of a genetic algorithm executing process according to the present invention;

[0020] FIGS. 4A and 4B are diagrams explaining the concept of a distribution of characters;

[0021] FIGS. 5A, 5B, 5C and 6 are diagrams explaining a degree of disorder;

[0022] FIG. 7 is a flowchart showing the process performed by a character-distribution calculating unit;

[0023] FIG. 8 is a flowchart showing the process performed by a mutation rate calculating unit;

[0024] FIG. 9 is a flowchart showing the second example of the genetic algorithm executing process according to the present invention;

[0025] FIG. 10 is a diagram explaining a process of a character position selection and combination generation;

[0026] FIG. 11 is a flowchart showing the process performed by a character position selecting unit;

[0027] FIG. 12 is a flowchart showing the process performed by a combination generating unit;

[0028] FIG. 13 exemplifies the knapsack problem;

[0029] FIGS. 14A and 14B are tables showing comparison between performance of the conventional method and the present invention;

[0030] FIG. 15 shows character strings in an intermediate generation according to the conventional method;

[0031] FIG. 16 shows character strings in an intermediate generation according to the present invention;

[0032] FIG. 17 shows a schematic diagram of the maximum evaluation value obtained until the number of generations;

[0033] FIG. 18 shows performance of the present invention in comparison with the conventional method;

[0034] FIG. 19 is a flowchart showing the third example of the genetic algorithm executing process according to the present invention;

[0035] FIG. 20 are tables showing the results of the process obtained in the third example;

[0036] FIG. 21 is a block diagram showing the configuration of the genetic algorithm executing device according to the second embodiment of the present invention;

[0037] FIG. 22 is a flowchart showing the genetic algorithm executing process according to the second embodiment;

[0038] FIG. 23 is a table showing the result of the genetic algorithm executing device according to the second embodiment; and

[0039] FIG. 24 is a schematic diagram showing a computer system for realizing the genetic algorithm executing device according to the present invention.

[0040] FIG. 2A and 2B are block diagrams showing the configuration of a genetic algorithm executing device according to the present invention. As shown in FIG. 2A, a genetic algorithm executing device 10 is composed of a CPU, a memory, etc. This device comprises an initial string generating unit 11 for generating (or selecting) initial strings; a selection processing unit 12 for selecting strings with a high evaluation value; a search efficiency improving unit 13 for promoting search efficiency by operations such as mutation, etc.; and a crossover processing unit 14 for performing a crossover operation on string pairs selected from a set of strings.

[0041] As shown in FIG. 2B, the unit 13 of the device 10 includes a character-distribution calculating unit 1, a mutation rate calculating unit 2, a mutation processing unit 3, a character-position selecting unit 4, a combination generating unit 5, and a character-distribution registering unit 6. The search efficiency improving unit 13 may be configured by the character-distribution calculating unit 1, the mutation rate calculating unit 2, and the mutation processing unit 3, or by the character-distribution registering unit 6 in addition to the above described three units. Furthermore, the search efficiency improving unit 13 may be configured by the character-distribution calculating unit 1, the character-position selecting unit 4, and the combination generating unit 5, or by the character-distribution registering unit 6 in addition to the above described three units.

[0042] The unit 1 receives strings selected by the selection operation, and calculates distributions of characters for all positions. The character-distribution at J-th position (j=1, 2, . . . , L) is composed of pj(a), which is the ratio of the number of strings with ‘a’ at the j-th position to the total number of a set of strings. In this specification, a set of pj(a) for all available a's is abbreviated to <pj(a)>. FIG. 4A shows N strings which have L positions. For example, when N=100 and there are 36, 21, 29 and 14 strings with 0, 1, 2 and 3 at j-th position respectively, the character-distribution is pj(0)=0.36, pj(1)=0.21, pj(2)=0.29, and pj(3)=0.14 as shown in FIG. 4B.

[0043] The distributions of characters are calculated in order to estimate effect of each character-position. A position in which a certain character is frequently distributed is thought to be “fatal”. Thus on such a position the mutation rate should be reduced. Conversely, a character position in which no character is frequently distributed is thought to be “changable”. Thus on such position a mutation should be promoted.

[0044] The unit 2 obtains the degree of disorder rj, which is calculated according to the function Rj(<pj(a)>), and calculates the mutation rate mj according to the obtained r1, r2, . . . , rL. The function Rj is nonnegative and has a maximum value when all the pj(a)'s are the same value. FIG. 5A, 5B, 5C and 6 are diagrams for explaining the degree of disorder. In this example, the string has 4 characters, and the available characters are 0 and 1 for all positions. FIG. 5A, 5B and 5C exemplifies the degree of disorder function Rj(pj(0), pj(1)). The mutation rate mj is reset to be smaller if rj decreases, and conversely it is reset to be larger if rj increases. The search efficiency is improved by reducing the mutation rate on the “fatal” positions and promoting mutation on the “changable” positions.

[0045] The value of mj is calculated by the function Mj(r1, r2, . . . , rL) as follows

[0046] mj=Mj (R1(<p1(a)>), R2(<p2(a)>), . . . , RL(<pL(a)>))

[0047] The value of MJ is a real number between 0 and 1. Additionally, Mj is a nondecreasing function of r1, r2, . . . , rL. Namely, if ak<bk, Mj satisfies the following inequality for k=1, 2, . . . , L

[0048] Mj (r1, . . . , rk-1, ak, rk+1, . . . , rL) ≦Mj (r1, . . . , rk-1, bk, rk+1, . . . , rL).

[0049] The unit 3 performs the mutation operation according to m1, m2, . . . , mL obtained by the unit 2. For example, the function Mj can be defined with the following form

[0050] Mj(r1, . . . , rL)=εi Ai,jfi(ri)

[0051] where Ai,j is a constant matrix and fj is a function of rj. (Here εi indicates summation for I). Specifically, assuming that the constant matrix Ai,j satisfies Ai,j=1 if i=j, and Ai,j=0 if i≠j, the above equation is simplified as follows

[0052] Mj(r1, . . . , rL)=fj(rj)

[0053] This definition is thought to be practical because they can be rapidly calculated by parallel computing.

[0054] The following method is also effective. The unit 4 calculates rj from <pj(a)> obtained by the unit 1, and selects the positions with a high value of rj. The unit 5 generates combinations of all available characters in the selected positions by the unit 4. At the position which is not selected, the character is fixed by the original or the most frequently distributed one. Furthermore the unit 5 selects a string with the highest evaluation value among the generated strings. The processes by the unit 4 and 5 is desirable to execute after some generations. Additionally, these processes may be performed together with the mutation process by the unit 2 and 3. In this case, the unit 2 and 3 may be used for some strings, while the other strings are processed by the unit 4 and 5. The unit 6 is a means for registering the distributions of characters obtained by the unit 1. For example, we can save calculation time by using the character-distributions registered in the unit 6 several times.

[0055] FIG. 3 shows a flowchart of the first example according to the present invention. In FIG. 3, steps S4 to S6 are operations performed by the unit 13 shown in FIG. 2B. In step S1, initial strings are created at random. In step S2, evaluation values of strings are calculated. In step S3, strings with a high evaluation value are selected (for example, by the roulette selection method). By this operation, unsuitable strings are rejected. In step S4, the distributions of characters are calculated by the unit 1 shown in FIG. 2B. In step S5, the unit 2 calculates rj by using the function Rj(<pj(a)>), and resets mj by using the function Mj(r1, r2, . . . , rL). In step S6, the unit 3 performs mutation operation according to mj calculated by the unit 2. Then, crossover operation in step S7, and evaluation in step S8 are performed on strings generated by the previous step. In step S9, it is determined whether the process is continued or not. The operations of steps S3 to S8 are repeated until limit generation.

[0056] FIG. 7 shows a flowchart of the process performed by the unit 1. In this figure, L indicates the number of positions, N indicates the total number of character strings, A(j) indicates the number of available characters at j-th position, x(n, j) indicates the character at j-th position in the n-th string, and p(j, a) indicates the ratio of the number of strings with a at j-th position to the total number of strings. The unit 1 repeats the following process for j=1, 2, . . . , N (steps 101 and 102). First of all, all the values of p(j, a) are initialized to be zero (steps 103 to 107). Then, the process for counting the number of characters a at j-th position in the n-th string is performed (step 108 to 111). Next, the process for calculating p(j, a) is performed (steps 112 to 115).

[0057] FIG. 8 shows a flow chart diagram of the process performed by the unit 2 according to the following function

[0058] Mj(r1, r2, . . . , rL)=M×[L εrj/{εk rk}]j=1, 2, . . . , L

[0059] where M is a constant. In FIG. 8, L indicates the number of positions, r(j) indicates the degree of disorder at j-th position, A(j) indicates the number of available characters at j-th position, p(j, a) indicates the ratio of the number of strings with a at j-th position to the total number of character strings, R(j, . . . ) indicates the function to calculate the degree of disorder at j-th position, M indicates a constant, and m(j) indicates the mutation rate at j-th position. The unit 2 performs the process for calculating r(j) by using R(j, . . . ) (steps 121 to 124). Then, the process for calculating the summation part included in the right hand of the above equation is performed (steps 127 to 129). Here, if the summation C of r(j)'s vanishes, all mutation rates are set to the constant M (steps 130 to 134). If the total C is not zero, m(j) is calculated by using the above equation (steps 135 to 140).

[0060] To test the performance of the genetic algorithm, a knapsack problem is cited in this specification. The objective of this problem is to maximize the total price of items put into a knapsack subject to limit of the total capacity. Each of items corresponds to a bit, in which 0 means “not selected” and 1 means “selected”. The objective function is defined as total price of the selected items, where it vanishes when total capacity of the selected items exceeds capacity of a knapsack. FIG. 13 exemplifies the knapsack problem used in this embodiment. The number of items is 50, and the items are numbered from 1 to 50 according to the descending order of price per capacity. If capacity of a knapsack is 1,500, the optimum value is 2,230. This solution is indicated in the “solution” column of FIG. 13. In the knapsack problem, it is usually more effective to select items with a higher value of price per capacity. Namely, in FIG. 13, the small numbered items should be selected, while the large numbered ones should be rejected. The solution bits in FIG. 13 support this assertion, because the bits of the items 1 to 25 are 1, and the most bits of the items 26 to 50 are 0. In other words, the bits of small and large numbered items in this problem are “fatal”.

[0061] To apply the first example to the above problem, the function Rj is defined as follows

[0062] Rj(pj(0), pj(1)) =20−19×|pj(0)−0.5|−19×|pj(1)=0.5|j=1, . . . , 50

[0063] where |* | represents an absolute value. This function has the maximum value 20 when pj(0)=pj(1) =0.5, and the minimum value 1 when pj(0)=1 and pj(1)=0, or pj(0)=0 and pj(1)=1. mj is reset as follows

[0064] mj=0.08×[50×Rj(pj(0), pj(1))/{εk Rk(pk(0), pk(1))}]j=1, . . . , 50.

[0065] FIG. 14A and 14B show the comparison between performance of the conventional method and the present invention. In this performance test, the average mutation rate, the number of strings, and the crossover probability are assumed to be 0.08, 100, and 0.5 respectively. FIG. 14A shows the results until 100 generations. Then the optimum value 2,230 was never obtained by the conventional method. On the other hand, by the present invention, 2,230 was obtained 8 times. Furthermore, 2,228, which is very close to the optimum value was obtained in the rest trials. FIG. 14B shows the results until the 1,000th generation. In this case, 2,230 was obtained 3 times by the conventional method. On the other hand, by the present invention, 2,230 was obtained every time. Additionally, the generations required for 2,230 was 47.4 on average. This is a quite good result in comparison with the average 461.3 of 3 successful cases by the conventional method. These results prove that the present invention is more effective than the conventional method.

[0066] To understand the reason of the previous results, we consider the search processes of both methods in detail. FIG. 15 and 16 shows the strings in the 30th generation by the conventional method and the present invention. The characters are sequentially displayed from the left side according to the item numbers 1 to 50 (refer to FIG. 13), and the right side digits represent the evaluation value. In the conventional method, 59 strings was invalid, this number was quite larger than 38 of the present invention. The reason why there are few invalid strings in FIG. 16 is that the mutation rates at the “fatal” bits are reduced.

[0067] FIG. 17 shows a schematic diagram of the maximum evaluation value obtained until the number of generations. Gc and Ga are generations required for optimization by the conventional method and the present invention respectively. The ratio Gc/Ga shows the performance of the present invention in comparison with the conventional method. FIG. 18 shows the ranges (indicated by segments) of the ratio Gc/Ga and their average values (indicated by black dots) for 5 different problems solved by the conventional method and the present invention. The tests were performed on problems with 40, 42, 44, 46, 48, 50 and 52 items. Gc/Ga grows according to the number of items. This result shows the efficiency of the present invention especially in the large scale problem.

[0068] FIG. 9 is a flowchart showing the second example of the genetic algorithm executing device according to the present invention. In this example, steps S10 and S11 are performed instead of steps S5 and S6 in the first example, therefore explanations for steps except S10 and S11 are omitted here. In step S10, the unit 4 obtains rj, and selects j's for which rj is higher than a threshold value. FIG. 10 shows diagrams to explain steps S10 and S11. (A) of FIG. 10 exemplifies strings after step S3. As shown in this figure, the available characters at the third and sixth positions are 0, 1, and 2, while those at the other positions are 0 and 1. In step S10, rj is obtained and positions in which rj is greater than 4 (a threshold value) are selected. In step S11, the unit 5 generates strings of all available characters at the selected positions (refer to (B) in FIG. 10), and the string with the maximum value is selected (refer to (C) in FIG. 10).

[0069] Provided below is the specific explanation about the process performed on the first string (G1) shown in (A) of FIG. 10. First of all, all of the combinations of the characters at the third and fifth positions, in which the degree of disorder is higher than the threshold value 4, are generated. The available characters at the third position are 0, 1, and 2, while those at the fifth position is 0 and 1. Accordingly, the six strings of combinations 00, 10, 20, 01, 11, and 21 are generated as shown in (B) of FIG. 10, and a string with the maximum value (=72) is defined as G1'. The same processes are performed also on G2 to G8. Consequently new strings G1' to G8' are generated as shown in (C) of FIG. 10.

[0070] FIG. 11 is a flowchart showing the process performed by the unit 4. In this figure, L indicates the number of positions, R(j, . . . ) indicates the function to calculate the degree of disorder at j-th position, r(j) indicates the degree of disorder at j-th position, A(j) indicates the number of available characters at j-th position, p(j, a) indicates the ratio of the number of strings with a at j-th position to the total number of strings, Q indicates a threshold value, and S(j) indicates an identification value representing selected/rejected at j-th position. The unit 4 calculates r(j) by using the function R(j, . . . ) (steps 151 to 154). Next, it is tested whether or not r(j) is less than a threshold value Q. S(j) is set to 0 if r(j)<Q, and is set to 1 if r(j)>=Q (steps 155 to 160).

[0071] FIG. 12 is a flowchart showing the process performed by the unit 5. In this figure, L indicates the number of positions, N indicates the total number of strings, A(j) indicates the number of available characters at J-th position, x(n, j) indicates the character at J-th position of the n-th string, S(j) indicates a selected/rejected identification value at j-th position, g( . . . ) indicates an evaluation function, and y(n, j) indicates the character at j-th position in the new n-th string. The unit 5 repeats the following processes while incrementing the string number n by 1 (step S202) from the first to N-th string (steps 171 and 172). First of all, the result of g( . . . ) of the n-th string is assigned to a variable H (step S173). Next, the string x(n, 1), . . . , x(n, L) is copied to y(n, 1), . . . , y(n, L) (steps 174 to 177). Next, the total number of combinations B is calculated from A(j) and S(j) (steps 178 to 184). Then, the combinations of all available characters at the selected positions are generated one by one (steps 185 to 193, which correspond to the process shown in (B) of FIG. 10). At this time, the result of g( . . . ) of the string x(n, 1), x(n, 2), . . . , x(n, L) is set to a variable G (step 194), and H, y(n, 1), y(n, 2), . . . , y(n, L) is substituted by G, x(n, 1), x(n, 2), . . . , x(n, L) If G>H (steps 196 to 200). In this way, the old string is replaced by the new string with the highest value among strings generated by B combinations (steps 185 to 201). This process is performed on all of the old strings (step 202).

[0072] FIG. 19 is a flowchart showing the third example of the genetic algorithm executing device according to the present invention. In this example, distributions of characters during T generations are saved in the unit 6, and steps S10′ and S11 are performed every T generations by the averaged distribution over T generations. In step S10′, the unit 4 obtains rj, and selects j's for which rj is higher than a threshold value. To show the implementation example, we apply this to the knapsack problem shown in FIG. 13. The unit 6 saves pj(a) during T=2 generations and calculates the average p'j(a) of the first pj(a) and the second one (a=0, 1; j=1, . . . , 50). rj is obtained as follows

[0073] rj=1−|p'j(0)−0.5|−|p'j(1)−0.5|

[0074] then, the unit 4 selects the positions for which rj≧0.5 for j=1, . . . , 50. Here, if the number of selected j's is greater than 8, we select the above 8 of the positions ranked according to their degree of disorder.

[0075] FIG. 20 shows the results of this example performed on the knapsack problem shown in FIG. 13 (corresponding to FIGS. 14A and 14B). In the tests until 100 generations, 2,230 was obtained only once, while in the test until 1,000 generations, it was obtained 8 times. The average number of generations required for 2,230 is 456.3. This result proves that the genetic algorithm process is improved in the third example in comparison with the conventional case. However the degree of improvement in the this example is less than that in the first example. It is thought that performance is highly dependent on a given problem.

[0076] Provided next is the explanation about the genetic algorithm executing device according to the second embodiment of the present invention. The genetic algorithm executing device according to the second embodiment is implemented by replacing the unit 13 in the configuration shown in FIG. 2A with a unit 13′. FIG. 21 shows the structure of the unit 13′. As shown in this figure, the unit 13′ comprises a character-distribution calculating unit 1, a mutation rate calculating unit 2, a mutation processing unit 3, a character position selecting unit 4, a combination generating unit 5, a character distribution registering unit 6, a generation number counting unit 7, and a termination condition evaluating unit 8. Because the character-distribution calculating unit 1, the mutation rate calculating unit 2, the mutation processing unit 3, the character position selecting unit 4, the combination generating unit 5, and the character distribution registering unit 6 have the same capabilities as those shown in FIG. 2B, their explanations are omitted here. The generation number counting unit 7 comprises registers and a counter of the number of generations. The generation counter is reset to 0 by a reset signal before the generation loop, and is incremented by a countup signal every generation. The termination condition evaluating unit 8 evaluates the termination condition according to the data of the unit 1 and/or the unit 6, and the data of the unit 7. If the termination condition is satisfied, the unit 8 externally outputs a termination signal, and then the algorithm terminates.

[0077] We will abbreviate the sequence <p1(a)>, <p2(a)>, . . . , <pL(a)> to {pj(a)} here. In the process according to this embodiment, the functions E1, E2, . . . , EM of {pj(a)} and the number of generations t are required. The termination condition is estimated by the logical combination of inequalities such as E1({pj(a)}, t)<e1, E2({pj(a)}, t)>e2, . . . , etc., where e1, e2, eM are constant threshold values.

[0078] Provided next is the explanation about the process performed by the genetic algorithm executing device according to the second embodiment. FIG. 22 is a flowchart showing the flow of the process. In this process, steps S1 and S2 correspond to steps S1 and S2 of FIG. 3 and 9, and steps S3-1 to S3-N, S4-1 to S4-N, and S8-1 to S8-N correspond to steps S3, S4, and S8 of FIG. 3 and 9 respectively. Therefore, their explanations are omitted here. Additionally, steps S12-1 to S12-N are the process implemented by combining steps S5, S6, and S7 of FIG. 3. Initial strings are generated by the unit 11 in step S1. After the evaluation value of each string was obtained in step S2, the generation number counter included in the unit 7 is reset to 0 in step S13. After strings were selected by the unit 12 in step S3-1, the distributions of characters are calculated by the unit 1 in step S4-1. Furthermore, they are registered in the unit 6. Next, the recombination process is performed in step S12-1. In this recombination process, calculation of mutation rates by the unit 2, mutation by the unit 3, and crossover by the unit 14 are performed. Next, the evaluation value of each string is obtained in step S8-1. The generation number counter is then incremented by the unit 7 in step S14-1. Then, the unit 8 estimates the termination condition 1. If it is not satisfied, the process goes back to step S3-1. If it is satisfied, the process goes to step S3-2. Then the processes in steps S3-2 to S9-2, . . . , in steps S3-N to S9-N performed sequentially, and the unit 8 evaluates each of termination conditions 2 to N. The algorithm is completed when the termination condition N is satisfied.

[0079] Provided next is the explanation about the process performed by the genetic algorithm executing device according to the second embodiment. Implementation test was performed on the knapsack problem shown in FIG. 13, where the following two termination conditions were used:

[0080] Termination Condition 1:t>10

[0081] Termination Condition 2:

[0082] ({fraction (1/50)}) εj(20−19×|pj(0)−0.5|19×|pj(1)−0.5|)≦1.3

[0083] The same process as that shown in FIG. 3 is performed until 10th generation, because the termination condition 1 is used. After the 11th generation, the termination condition 2 is used.

[0084] Provided next is the explanation about the result of the above described algorithm execution process. FIG. 23 shows the results for this example. As shown in this figure, 2,230 was obtained every time. The largest value of the termination generation was 334, and the average was 142.6. In comparison with 1,000 generations, these values are quite small. That is, idling time was saved in this case.

[0085] FIG. 24 exemplifies a computer system for realizing the genetic algorithm executing device according to the present invention (the devices shown in FIG. 2A, 2B, and 21), which is used to execute computer programs for performing the processes shown in FIGS. 3, 7 to 12, 19, and 22. This computer system comprises a computer body 100, a display 200, and an input device 250 composed of a keyboard and a mouse. The computer body 100 comprises a processor 110, a memory 120, and a driver 130 for a storage medium. The processor 110 performs the operations of the initial string generating unit 11, the selection processing unit 12, the crossover processing unit 14, and the search efficiency improving unit 13, which are shown in FIG. 2A, and further performs the operations of the character-distribution calculating unit 1, the mutation rate calculating unit 2, the mutation processing unit 3, the character-position selecting unit 4, the combination generating unit 5, the generation counting unit 7, and the termination condition evaluating unit 8, which are shown in FIGS. 2B and 21. Specifically, these operations are implemented by performing the processes shown in FIGS. 3, 7 to 12, 19, and 22 with a computer program. The memory 120 stores the data required for executing the computer program (such as strings, evaluation function, thresholds, etc.), and the data obtained by executing the program (distributions of characters, evaluation values, degrees of disorder, mutation rates, the number of generations, new strings, etc.). The memory 120 also serves as the character-distribution registering unit 6. The driver 130 is intended to read a program and data stored in an external storage medium to the processor 110 and the memory 120. If the computer program for executing the processes according to the present invention is stored in an external storage medium, the program stored in the external storage medium is read and executed via the driver 130. The input device 250 is used by a user in order to input the data and instructions required for executing the program.

[0086] When the computer program for executing the processes according to the present invention is stored in an external storage medium, it may be realized by an optical storage medium such as a CDROM, a magnetic storage medium such as a floppy disk, a magnetooptical storage medium such as an MD, etc. Furthermore, the computer program for executing the processes according to the present invention may be stored in an internal storage medium such as a hard disk, a ROM, a RAM, etc.

[0087] According to the present invention, the search efficiency of the genetic algorithm is improved in comparison with the conventional method especially in the large scale problems. Furthermore, calculation time is saved by automatic termination of the algorithm.