| 摘要 |
PURPOSE:To improve the processing speed of an information processing system using genetic algorithm by excluding an individual to be the cause of repeated evaluation from the object of operation. CONSTITUTION:In the case that a generation consisting of four individuals S1=1001, S2=1011, S3=0111, S4=0110 is considered there are 6 kinds (=4!/2) of the possible combinations of this population (group). If random combination is executed while no combination limitation is given, there is possibility that the pairs of (S1, S2), (S3, S4) are combined. But no new individual is generated entirely from the intersection of this pair, and the useless repeated evaluation comes to be executed. Then, breeding potential Pg is used, and if a condition that only the pair whose Pg (where Pg=Dh+Ld, Dh is Hamming distance of possible combination, Ld is difference length) is over 3 is combined is added to the combination limitation, the combinations of (S1, S2) and (S3, S4) not to generate entirely the new individual are omitted from genetic algorithm processing (GA), and useless repetition is not executed. |
