| 摘要 |
PURPOSE:To execute a genetic algorithm at light speed in a device which searches the quasi-optimal resolution of a combination optimizing problem by a genetic method. CONSTITUTION:Each of plural individual processors 1 holds grouped plural individuals to be processed, operates the evaluation, sorting, crossing, mutation processing of each of the grouped individuals in parallel, and copies the processed content to a shared memory 10. A data summing-up device 9 searches the total sum of the evaluation value of each individual, and the rate to the whole or the like by referring to a shared memory 10. Each individual processor 1 fetches again the individuals in the next generation from the shared memory 10 in the process of the sorting processing, and operates the crossing, mutation, evaluation processing or the like in parallel. The data summing-up device 9 outputs the individual whose evaluation is the highest after operating these series of the processing. |
