| 摘要 |
PROBLEM TO BE SOLVED: To determine that where are effective for disposing a plurality of lines and disposing relay points to connect the lines within a practical time period. SOLUTION: A route planning device adapts a hereditary algorithm including evaluation, selection, chiasma and mutation to a plurality of initial heredity codes having arrays based on the number of relay points and indicating a plurality of candidates of the arrangements of the relay points and the lines, respectively. A heredity code evaluation part 3 acquires an index corresponding to a total cost of the relay points and the lines or an index corresponding to a total cost of the lines from the arrangement of the relay points and the lines indicated by each heredity code, respectively, and uses these indices as evaluation values of the algorithm. COPYRIGHT: (C)2004,JPO&NCIPI
|
