| 摘要 |
PURPOSE:To provide the chromosome assigning method and device which sufficiently speeds up convergence on an optimum solution when a combinational problem is solved by genetic algorithm. CONSTITUTION:When the correspondence relation between request elements (distribution destination) having request quantities respectively and process elements (truck) whose processable quantities (maximum loading capacity) are defined is represented in a chromosome 30, the operation numbers of the tracks are allocated as values of respective genetic seats 31 of the chromosome 30 without overlapping. Then the tracks are assigned from the 1st distribution destination in order until the request quantity of the distribution destination is satisfied. In this case, the tracks are assigned by the distribution destinations by searching for genetic seats 31 in order from one end side of the chromosome 30 until the sum of the maximum loading quantities exceeds the request quantity of the distribution destination and reading the maximum loading capacity of the track corresponding to the value of each genetic seat 31 out of a maximum loading capacity table 11. |
