| 摘要 |
PROBLEM TO BE SOLVED: To quickly solve an optimum line planning problem having the enormous number of combinations and including an optimum plan by a probabilistic searching procedure. SOLUTION: The device provided with an input part 1, memories 2, 3, 5, an operation part 4, and an output part 6 is constituted so as to input various information and minimize the value of an objective function expressing an item to be minimized based on a given condition. A minimum value searching means in the operation part 4 sets up a state variable arranging the segmentation order of wire lods in the descending length order of the wire rods as an initial value, changes the initial value of the state variable for search based on the initial value to find out the minimum value. |
