| 摘要 |
PROBLEM TO BE SOLVED: To minimize the number of the intersections of parts concerning already set mounting paths and to shorten the total length of the mounting paths. SOLUTION: The already set mounting path I1 is inputted to select a route including an intersection maximizing the total sum of distances to the intersection from each mounting part among intersections including intersections formed by optional four mounting parts (S1, S2). When the path successively connecting the plural number of mounting parts forms the intersections, the connecting order of a mounting part nearest to the intersection is changed to remove the intersection (S3, S4). The length of the path concerning the change of the connecting order of the mounting part is compared between before and after the change to detect the shortening degree of the total length of the mounting paths (S5). Then until the total length of the mounting paths is not shorten any more, the selection of a path and the removing of an intersection are repeated (S6) to output a corrected mounting path 01. |
