| 摘要 |
PROBLEM TO BE SOLVED: To provide an adaptive evaluating device which can fast output the fitness for a traveling salesman problem that us used for a genetic algorithm. SOLUTION: Distance table memories 241 to 248 input the numbers of respective cities addresses from table address registers 231 to 238 and output the distances to a carry save adder 250. The memory 241, for example., inputs cities 1 and 0 and outputs distances D1 and D0 of cities 1 and 0. The memories 241 to 248 store the distances among the respective cities as the tables. As the memories 241 to 248 operate in parallel to each other, the adder 250 can output the inter-city distance shown in a gene stored in a mutated chromosome register 69 as fitness F in a single clock cycle. |
