| 摘要 |
<p>PROBLEM TO BE SOLVED: To efficiently lead out the optimum combination of cable routes in a short time by noticing the total length of an extended line, the number of bending times and a storing situation value so as to evaluate a character string and recursively optimizing the character string. SOLUTION: A two-dimensional cable is prepared to arrange cable numbers 1, 2, 3,... to lay laterally in an order from a left side. Then a route candidate is applied to a position corresponding to each cable number 1, 2, 3,... by selecting at random. In addition, the number of a link through which a the cable route passes, the length of the link and the number of the bending times can be referred to concerning the selected route. By repeating similar operation with respect to the other cables 2 to 5, a character string consisting of five alphabets C-A-D-A-E is prepared. Character strings showing the combinations of cable routes like this are plurally prepared by varying the coordination of each route number and a route candidate number and an optimum character string is found out to obtain optimum cable arrangement.</p> |
