| 摘要 |
PROBLEM TO BE SOLVED: To reduce the number of used memories, to simultaneously shorten calculation time and to improve a search capability of an optimum combination. SOLUTION: A plurality of pieces of data constituting a characteristic type search group are defined as a 1st chromosome, a plurality of characteristic value search groups composed of a plurality of 2nd chromosome groups constituting a lower lever chromosome are formed for the respective pieces of the data, an evaluation value allocated to each of the 2nd chromosomes is taken into consideration to operate fitness in each characteristic value search group, gene manipulation is performed to each of the 2nd chromosome groups, the average value of a plurality of pieces of desirable fitness obtained in the respective characteristic value search groups are also calculated, average value fitness is subsequently defined as a fitness value to the characteristic value search groups, gene manipulation is conducted to the chromosomes of the characteristic type search groups by taking an evaluation value individually given to the respective 1st chromosomes constituting the characteristic type search groups into consideration so as to calculate optimum fitness to the characteristic type search group, and a specified 1st chromosome is selectively extracted as an optimum solution from among the characteristic type search groups.
|
